GPU Parallelization of Algebraic Dynamic Programming
Bielefeld University, Faculty of Technology, Germany
In Parallel Processing and Applied Mathematics, Vol. 6068 (2010), pp. 290-299
@article{steffen2010gpu,
title={GPU Parallelization of Algebraic Dynamic Programming},
author={Steffen, P. and Giegerich, R. and Giraud, M.},
journal={Parallel Processing and Applied Mathematics},
pages={290–299},
year={2010},
publisher={Springer}
}
Algebraic Dynamic Programming (ADP) is a framework to encode a broad range of optimization problems, including common bioinformatics problems like RNA folding or pairwise sequence alignment. The ADP compiler translates such ADP programs into C. As all the ADP problems have similar data dependencies in the dynamic programming tables, a generic parallelization is possible. We updated the compiler to include a parallel backend, launching a large number of independent threads. Depending on the application, we report speedups ranging from 6.1x to 25.8x on a Nvidia GTX 280 through the CUDA libraries.
December 17, 2010 by hgpu
