Accelerating HMMER on FPGA using Parallel Prefixes and Reductions

Abstract : HMMER is a widely used tool in bioinformatics, based on Profile Hidden Markov Models. The computation kernels of HMMER i.e. MSV and P7Viterbi are very compute intensive and data dependencies restrict to sequential execution. In this paper, we propose an original parallelization scheme for HMMER by rewriting their mathematical formulation, to expose the hidden potential parallelization opportunities. Our parallelization scheme targets FPGA technology, and our architecture can achieve 10 times speedup compared with that of latest HMMER3 SSE version, while not compromising on sensitivity of original algorithm.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00554191
Contributor : Steven Derrien <>
Submitted on : Monday, January 10, 2011 - 2:29:40 PM
Last modification on : Wednesday, December 18, 2019 - 5:28:35 PM

Identifiers

  • HAL Id : inria-00554191, version 1

Citation

Naeem Abbas, Steven Derrien, Patrice Quinton, Sanjay Rajopadhye. Accelerating HMMER on FPGA using Parallel Prefixes and Reductions. Proc. of the IEEE International Conference on Field-Programmable Technology (FPT'10), Dec 2010, Beijing, China, China. x-proceedings = yes, x-international-audience = yes, x-editorial-board = yes, x-invited-conference. ⟨inria-00554191⟩

Share

Metrics

Record views

240