The reviewed record of science sign in
Pith

arxiv: 2401.11685 · v1 · pith:TRZD4D4J · submitted 2024-01-22 · cs.AR · q-bio.GN

Accelerating Seed Location Filtering in DNA Read Mapping Using a Commercial Compute-in-SRAM Architecture

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TRZD4D4Jrecord.jsonopen to challenge →

classification cs.AR q-bio.GN
keywords acceleratingalignmentfilteringcandidatecompute-in-sramacceleratorarchitecturecommercial
0
0 comments X
read the original abstract

DNA sequence alignment is an important workload in computational genomics. Reference-guided DNA assembly involves aligning many read sequences against candidate locations in a long reference genome. To reduce the computational load of this alignment, candidate locations can be pre-filtered using simpler alignment algorithms like edit distance. Prior work has explored accelerating filtering on simulated compute-in-DRAM, due to the massive parallelism of compute-in-memory architectures. In this paper, we present work-in-progress on accelerating filtering using a commercial compute-in-SRAM accelerator. We leverage the recently released Gemini accelerator platform from GSI Technology, which is the first, to our knowledge, commercial-scale compute-in-SRAM system. We accelerate the Myers' bit-parallel edit distance algorithm, producing average speedups of 14.1x over single-core CPU performance. Individual query/candidate alignments produce speedups of up to 24.1x. These early results suggest this novel architecture is well-suited to accelerating the filtering step of sequence-to-sequence DNA alignment.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.