paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Harp: Leveraging Quasi-Sequential Characteristics to Accelerate Sequence-to-Graph Mapping of Long Reads

Harp:利用准序列特性加速长读的序列到图映射
ASPLOS Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 32024匹配度 0/10 · 该论文研究面向基因组长读比对的硬件加速系统,核心是序列到图映射的数据结构与加速器设计,与静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析均无直接关联。引用 8 inbox
Yichi Zhang, Dibei Chen, Gang Zeng, Jianfeng Zhu, Zhaoshi Li, Longlong Chen, Shaojun Wei, Leibo Liu
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出硬件加速系统 Harp,利用基因组图的准序列特性降低序列到图映射开销,显著加速长读比对。

长读序列到图映射(S2G)正逐渐取代序列到序列映射,但其图处理开销高且性能热点发生转移,给现有软件实现与硬件加速器带来挑战。本文提出 Harp,一种面向 S2G 的加速系统。它利用基因组图与序列之间的结构相似性,挖掘图的准序列特性,从而简化图处理算法。Harp 与两个算法组件协同设计:HarpTree 紧凑数据结构显式暴露准序列特性,HarpExt 多阶段种子扩展算法在保持映射视野的同时降低图操作开销。评估显示,Harp 在长读 S2G 映射中平均比最新软件快 140 倍,比最先进 S2G 加速器快 23.6 倍,并减少 72% 芯片面积。

问题
序列到图映射(S2G)存在高昂的图处理开销和性能热点转移问题,现有软件与硬件加速器难以高效支持长读映射。
方法
Harp 利用基因组图的准序列特性,协同设计 HarpTree 紧凑数据结构和 HarpExt 多阶段种子扩展算法,以简化图处理并降低图操作开销。
评估
通过长读 S2G 映射实验,与最新 S2G 软件及最先进 S2G 加速器对比,报告平均 140 倍、23.6 倍加速以及 72% 芯片面积缩减。
原文摘要(Abstract)

Read mapping is a crucial task in computational genomics. Recently, there has been a significant paradigm shift from sequence-to-sequence mapping (S2S) to sequence-to-graph mapping (S2G). The S2G mapping incurs high graph processing overheads and leads to an unnoticed shift of performance hotspots. This presents a substantial challenge to current software implementations and hardware accelerators. This paper introduces Harp, a novel S2G mapping acceleration system. Harp leverages the structural similarities between genome graphs and sequences, significantly reducing graph processing overhead by exploiting their quasi-sequential characteristic. The Harp accelerator is co-designed with two main algorithmic components: (1) HarpTree, a compact data structure that explicitly reveals the quasi-sequential characteristic, enabling simplifications of graph processing algorithms in S2G mapping, and (2) HarpExt, a multi-stage seed-extension algorithm that mitigates graph operation overhead while maintaining the sight of S2G mapping. Harp achieves an average 140× speedup over the latest S2G mapping software and outperforms the state-of-the-art S2G accelerator by 23.6× while reducing the chip area by 72% in S2G mapping of long reads.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{ZhangCZ0LCWL24,
  title = {Harp: Leveraging Quasi-Sequential Characteristics to Accelerate Sequence-to-Graph Mapping of Long Reads},
  author = {Yichi Zhang and Dibei Chen and Gang Zeng and Jianfeng Zhu and Zhaoshi Li and Longlong Chen and Shaojun Wei and Leibo Liu},
  booktitle = {ASPLOS},
  year = {2024},
  doi = {10.1145/3620666.3651331}
}