2016
DOI: 10.1177/1094342016654215
|View full text |Cite
|
Sign up to set email alerts
|

Oswald

Abstract: The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local sequence alignments. Unfortunately, SW has quadratic time complexity, which makes this algorithm computationally demanding for large protein databases. In this paper, we present OSWALD, a portable, fully functional and general implementation to accelerate SW database searches in heterogeneous platforms based on Altera's FPGA. OSWALD exploits OpenMP multithreading and SIMD computing through SSE and AVX2 extensions on the host wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2

Relationship

5
2

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 23 publications
0
13
0
Order By: Relevance
“…2). It is important to mention that, although in the OSWALD implementation [10] Intel/Altera OpenCL channels are used to communicate these data, the use of this technique is not feasible in the context of DNA with millions of nucleotide bases involved, since its size would exceed by far the channel resources available. We should point out that although the use of these buffers could double memory consumption, it is by far compensated on speedup terms.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…2). It is important to mention that, although in the OSWALD implementation [10] Intel/Altera OpenCL channels are used to communicate these data, the use of this technique is not feasible in the context of DNA with millions of nucleotide bases involved, since its size would exceed by far the channel resources available. We should point out that although the use of these buffers could double memory consumption, it is by far compensated on speedup terms.…”
Section: Methodsmentioning
confidence: 99%
“…Most of them correspond to protein alignment, and are parallelized on High-Performance Computing (HPC) architectures [7] and emerging architectures [810]. For very long sequences, such as with DNA, the number of works is significantly lower.…”
Section: Introductionmentioning
confidence: 99%
“…The first three servers were used to evaluate SWIMM 2.0 and the other SIMD-based alternatives, while the rest were employed to perform a comparison with GPUs and FPGAs. The performance was evaluated by carrying out similar experiments to those in previous works [19,14,11,7]. We have evaluated SWIMM 2.0 by searching 20 query protein sequences against three well-known databases of different size:…”
Section: Experimental Designmentioning
confidence: 99%
“…This version computes using 32-bit integer data but allow us to include newer GPUs in the analysis. For FPGA accelerators, we have chosen the OS-WALD package [19] in its hybrid configuration because it offers a satisfactory performance-power tradeoff. Table 2 presents power efficiency ratios considering the GCUPS peak performance and the Thermal Design Power (TDP) of each platform.…”
Section: Performance and Power Efficiency Comparison With Gpus And Fpgasmentioning
confidence: 99%
See 1 more Smart Citation