Rolling partial prefix-sums to speedup evaluation of uniform and affine recurrence equations

Narayan Ganesan; Roger D. Chamberlin; Jeremy Buhler; Michela Taufer

doi:10.1117/12.884896

20 May 2011 Rolling partial prefix-sums to speedup evaluation of uniform and affine recurrence equations

Narayan Ganesan, Roger D. Chamberlin, Jeremy Buhler, Michela Taufer

Proceedings Volume 8060, Modeling and Simulation for Defense Systems and Applications VI; 806003 (2011) https://doi.org/10.1117/12.884896
Event: SPIE Defense, Security, and Sensing, 2011, Orlando, Florida, United States

Abstract

As multithreaded and reconfigurable logic architectures play an increasing role in high-performance computing (HPC), the scientific community is in need for new programming models for efficiently mapping existing applications to the new parallel platforms. In this paper, we show how we can effectively exploit tightly coupled fine-grained parallelism in architectures such as GPU and FPGA to speedup applications described by uniform recurrence equations. We introduce the concept of rolling partial-prefix sums to dynamically keep track of and resolve multiple dependencies without having to evaluate intermediary values. Rolling partial-prefix sums are applicable in low-latency evaluation of dynamic programming problems expressed as uniform or affine equations. To assess our approach, we consider two common problems in computational biology, hidden Markov models (HMMER) for protein motif finding and the Smith-Waterman algorithm. We present a platform independent, linear time solution to HMMER, which is traditionally solved in bilinear time, and a platform independent, sub-linear time solution to Smith-Waterman, which is normally solved in linear time.

Citation Download Citation

Narayan Ganesan, Roger D. Chamberlin, Jeremy Buhler, and Michela Taufer "Rolling partial prefix-sums to speedup evaluation of uniform and affine recurrence equations", Proc. SPIE 8060, Modeling and Simulation for Defense Systems and Applications VI, 806003 (20 May 2011); https://doi.org/10.1117/12.884896

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available