A Novel High-Throughput Acceleration Engine for Read Alignment
Authors:
- Jason CongJCJason Cong
- Jie LeiJLJie Lei
- Peng WeiPWPeng Wei
- 1 May 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-202
Abstract
The Smith-Waterman (S-W) algorithm is widely adopted by the state-of-the-art DNA sequence aligners. Existing wave front-based methods ignored the fact that the S-W algorithm is fed with significantly varied-size inputs in modern aligners, in which the S-W algorithm is further optimized by exerting extensive pruning. In this paper, we propose an architecture, tailored for varied input sizes as well as harnessing software pruning strategies, to accelerate S-W. Our implementation demonstrates a 26.4x speedup over a 24-thread Intel Has well Xeon server, and outperforms wave front-based implementations by up to 6x with the same FPGA resource.Keywords
This publication has 9 references indexed in Scilit:
- Race logicACM SIGARCH Computer Architecture News, 2014
- BSW: FPGA-accelerated BLAST-Wrapped Smith-Waterman aligner2013
- Fast gapped-read alignment with Bowtie 2Nature Methods, 2012
- High-Level Synthesis for FPGAs: From Prototyping to DeploymentIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- Parameters for accurate genome alignmentBMC Bioinformatics, 2010
- The impact of next-generation sequencing technology on geneticsTrends in Genetics, 2008
- Implementation of the Smith-Waterman algorithm on a reconfigurable supercomputing platform2007
- Basic Local Alignment Search ToolJournal of Molecular Biology, 1990
- Parallel processing of biological sequence comparison algorithmsInternational Journal of Parallel Programming, 1988