Exploration of Alternative GPU Implementations of the Pair-HMMs Forward Algorithm

Conference paper (2016)

Authors

S. Ren Computer Engineering -

K.L.M. Bertels Quantum & Computer Engineering

Z. Al-Ars Computer Engineering -

Department

Quantum & Computer Engineering

DOI: https://doi.org/10.1109/BIBM.2016.7822645

More Info

expand_more

To reference this document use:

http://resolver.tudelft.nl/uuid:e1703289-7f50-4cef-9e0d-5621a66918ed

Published Date

2016

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Department

Quantum & Computer Engineering

Abstract

In order to handle the massive raw data generated by next generation sequencing (NGS) platforms, GPUs are widely used by many genetic analysis tools to speed up the used algorithms. In this paper, we use GPUs to accelerate the pair-HMMs forward algorithm, which is used to calculate the overall alignment probability in many genomics analysis tools. We firstly evaluate two different implementation methods to accelerate the pair-HMMs forward algorithm according to their effectiveness on GPU platforms. Based on these two methods, we present several implementations of the pair-HMMs forward algorithm.
We execute these implementations on the NVIDIA Tesla K40 card using different datasets to compare the performance. Experimental results show that the intra-task implementation has the highest throughput in most cases, achieving pure computational throughput as high as 23.56 GCUPS for synthetic datasets.
On a real dataset, the inter-task implementation achieves 4.82x speedup compared with a vectorized implementation executed on a 20-core POWER8 system.

Files

10238082.pdf

(.pdf | 0.462 Mb)