Communication-avoiding micro-architecture to compute Xcorr scores for peptide identification
Sumesh Kumar, Fahad Saeed

TL;DR
This paper introduces a novel micro-architecture that reduces communication overhead in peptide spectrum matching, significantly accelerating the computation of Xcorr scores for proteomics analysis.
Contribution
It presents a communication-avoiding micro-architecture with local caching, peptide pre-fetching, and a custom broadcast bus to improve efficiency in peptide identification.
Findings
24x performance improvement over CPU implementation
Reduced DRAM accesses and improved data utilization
Efficient parallelism and synchronization in micro-architecture
Abstract
Database algorithms play a crucial part in systems biology studies by identifying proteins from mass spectrometry data. Many of these database search algorithms incur huge computational costs by computing similarity scores for each pair of sparse experimental spectrum and candidate theoretical spectrum vectors. Modern MS instrumentation techniques which are capable of generating high-resolution spectrometry data require comparison against an enormous search space, further emphasizing the need of efficient accelerators. Recent research has shown that the overall cost of scoring, and deducing peptides is dominated by the communication costs between different hierarchies of memory and processing units. However, these communication costs are seldom considered in accelerator-based architectures leading to inefficient DRAM accesses, and poor data-utilization due to irregular memory access…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
