GAPiM: Discovering Genetic Variations on a Real Processing-in-Memory System
Abecassis, N.; Gomez Luna, J.; Mutlu, O.; Ginosar, R.; Moisson-Franckhauser, A.; Yavits, L.
Show abstract
Variant calling is a fundamental stage in genome analysis that identifies mutations (variations) in a sequenced genome relative to a known reference genome. Pair-HMM is a key part of the variant calling algorithm and its most compute-intensive part. In recent years, Processing-in-Memory (PiM) solutions, which consist of placing compute capabilities near/inside memory, have been proposed to speed up the genome analysis pipeline. We implement the Pair-HMM algorithm on a commercial PiM platform developed by UPMEM. We modify the Pair-HMM algorithm to make it more suitable for PiM execution with acceptable loss of accuracy. We evaluate our implementation on single chromosomes and whole genome sequencing datasets, demonstrating up to 2x speedup compared to existing CPU accelerations and up to 3x speedup compared to FPGA accelerations.
Matching journals
The top 3 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- GPU Accelerated Adaptive Banded Event Alignment for Rapid Comparative Nanopore Signal Analysis 98%
- An FPGA-based hardware accelerator supporting sensitivesequence homology filtering with profile hidden Markovmodels 98%
- CUDASW++4.0: Ultra-fast GPU-based Smith-Waterman Protein Sequence Database Search 97%
Similar papers in this journal
- MCell4 with BioNetGen: A Monte Carlo Simulator of Rule-Based Reaction-Diffusion Systems with Python Interface 95%
- Beam search decoder for enhancing sequence decoding speed in single-molecule peptide sequencing data 94%
- Assessing the Performance of Methods for Cell Clustering from Single-cell DNA Sequencing Data 94%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.