一句话:提出基因组序列比对协处理器Darwin,通过软硬件协同设计与新型过滤/比对算法,实现最高15000倍加速且不牺牲灵敏度。
基因组数据增长远超摩尔定律,第三代测序读长更长但计算代价极高:人基因组参考引导组装需超1300 CPU小时,de novo组装需超15600 CPU小时。本文提出Darwin,一种基因组序列比对协处理器,通过硬件/算法协同设计,用更易加速的比对取代内存密集的过滤并优化过滤内存系统。它硬件加速新型过滤算法D-SOFT和新型比对算法GACT;GACT以常量内存完成计算密集步骤,为任意长序列生成近最优比对。评估表明,Darwin在不牺牲灵敏度下,对第三代reads参考引导组装相比最先进软件最高加速15000倍,并可通过调节速度与灵敏度适配新测序技术和更多基因组应用。
Genomics is transforming medicine and our understanding of life in fundamental ways. Genomics data, however, is far outpacing Moore»s Law. Third-generation sequencing technologies produce 100X longer reads than second generation technologies and reveal a much broader mutation spectrum of disease and evolution. However, these technologies incur prohibitively high computational costs. Over 1,300 CPU hours are required for reference-guided assembly of the human genome, and over 15,600 CPU hours are required for de novo assembly. This paper describes "Darwin" --- a co-processor for genomic sequence alignment that, without sacrificing sensitivity, provides up to $15,000X speedup over the state-of-the-art software for reference-guided assembly of third-generation reads. Darwin achieves this speedup through hardware/algorithm co-design, trading more easily accelerated alignment for less memory-intensive filtering, and by optimizing the memory system for filtering. Darwin combines a hardware-accelerated version of D-SOFT, a novel filtering algorithm, alignment at high speed, and with a hardware-accelerated version of GACT, a novel alignment algorithm. GACT generates near-optimal alignments of arbitrarily long genomic sequences using constant memory for the compute-intensive step. Darwin is adaptable, with tunable speed and sensitivity to match emerging sequencing technologies and to meet the requirements of genomic applications beyond read assembly.
DOI 原文 ·
@inproceedings{paperbot4231,
title = {Darwin},
author = {Yatish Turakhia and Gill Bejerano and William J. Dally},
booktitle = {ASPLOS},
year = {2018},
doi = {10.1145/3173162.3173193}
}