TL;DR
This paper introduces gpuPairHMM, a GPU-optimized algorithm that significantly accelerates the Pair-HMM forward algorithm used in DNA variant calling, achieving near-peak performance and outperforming previous implementations on multiple hardware platforms.
Contribution
The paper presents a novel GPU-based parallelization scheme for the Pair-HMM forward algorithm that improves efficiency by optimizing memory access and instructions, outperforming prior methods.
Findings
Achieves close-to-peak performance on modern GPUs.
Outperforms prior GPU, CPU, and FPGA implementations by at least 8.6x, 10.4x, and 14.5x.
Provides publicly available implementation at GitHub.
Abstract
The continually increasing volume of DNA sequence data has resulted in a growing demand for fast implementations of core algorithms. Computation of pairwise alignments between candidate haplotypes and sequencing reads using Pair-HMMs is a key component in DNA variant calling tools such as the GATK HaplotypeCaller but can be highly time consuming due to its quadratic time complexity and the large number of pairs to be aligned. Unfortunately, previous approaches to accelerate this task using the massively parallel processing capabilities of modern GPUs are limited by inefficient memory access schemes. This established the need for significantly faster solutions. We address this need by presenting gpuPairHMM -- a novel GPU-based parallelization scheme for the dynamic-programming based Pair-HMM forward algorithm based on wavefronts and warp-shuffles. It gains efficiency by minimizing both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
