High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels
Pages 600 - 601
Abstract
Dynamic Programming (DP) provides optimal solutions to a problem by combining optimal solutions to many overlapping subproblems. DP algorithms exploit this overlapping property to explore otherwise exponential-sized problem spaces in polynomial time, making them central to many important applications spanning from logistics to computational biology. In this paper, we present a general strategy of obtaining highly efficient parallel DP implementations using recursive cache-oblivious divide and conquer technique which turns inflexible kernels into flexible ones (kernels that read from and write to disjoint sub-matrices). We solve four non-trivial DP problems widely used in Bioinformatics, namely the parenthesis problem, Floyd-Warshall's all-pairs shortest paths, gap problem and protein accordion folding using recursive cache-oblivious technique that decompose the original inflexible looping kernel to highly optimizable flexible kernels. To the best of our knowledge no such recursive parallel DP algorithms were known for the protein folding and gap problems. The algorithms are hybrid in the same way as most high-performance matrix multiplication algorithms are recursive with iterative base cases. We show that the base cases of these recursive divide-and-conquer algorithms are predominantly matrix-multiplication-like (MM-like) flexible that expose many optimization opportunities not offered by the traditional looping DP codes. Moreover, the most costly/dominating kernel for these problems are often flexible. As a result, one can obtain highly efficient DP implementations by simply optimizing these kernels. We present a few generic optimization steps that suffices to optimize these DP implementations. Our implementations achieve 5--100x speedup over their standard loop based DP counterparts on modern multicore machines. We also present results on manycores (Xeon Phi) and clusters of multicores obtained by simple extensions for SIMD and shared-distributed-shared-memory architectures, respectively.
References
[1]
R. B. Lyngs, M. Zuker, and C. Pedersen. Fast evaluation of internal loops in rna secondary structure prediction. Bioinformatics, 15(6):440--445, 1999.
[2]
I. Mandoiu, R. Sunderraman, and A. Zelikovsky. Bioinformatics Research and Applications: Fourth International Symposium, ISBRA 2008, Atlanta, GA, USA, May 6-9, 2008, Proceedings, volume 4983. Springer, 2008.
[3]
G. Tan, S. Feng, and N. Sun. Locality and parallelism optimization for dynamic programming algorithm in bioinformatics. In Proceedings of the 2006 ACM/IEEE conference on Supercomputing, page 78. ACM, 2006.
Index Terms
- High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels
Recommendations
High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels
IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing SymposiumDynamic Programming (DP) problems arise in wide range of application areas spanning from logistics to computational biology. In this paper, we show how to obtain high-performing parallel implementations for a class of Problems by reducing them to highly ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/435bbfa9-766b-4b51-922a-440b104a5aea/2649387.cover.jpg)
Copyright © 2014 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 September 2014
Check for updates
Qualifiers
- Poster
Conference
BCB '14
Sponsor:
Acceptance Rates
Overall Acceptance Rate 254 of 885 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 92Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in