Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chang, Mau-Chung Frank | en_US |
dc.contributor.author | Chen, Yu-Ting | en_US |
dc.contributor.author | Cong, Jason | en_US |
dc.contributor.author | Huang, Po-Tsang | en_US |
dc.contributor.author | Kuo, Chun-Liang | en_US |
dc.contributor.author | Yu, Cody Hao | en_US |
dc.date.accessioned | 2017-04-21T06:49:02Z | - |
dc.date.available | 2017-04-21T06:49:02Z | - |
dc.date.issued | 2016 | en_US |
dc.identifier.isbn | 978-1-5090-2356-1 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/FCCM.2016.21 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/136358 | - |
dc.description.abstract | The advance of next-generation sequencing technology has dramatically reduced the cost of genome sequencing. However, processing and analyzing huge amounts of data collected from sequencers introduces significant computation challenges; these have become the bottleneck in many research and clinical applications. For such applications, read alignment is usually one of the most compute-intensive steps. Billions of reads generated from the sequencer need to be aligned to the long reference genome. Recent state-of-the-art software read aligners follow the seed-andextend model. In this paper we focus on accelerating the first seeding stage, which generates the seeds using the supermaximal exact match (SMEM) seeding algorithm. The two main challenges for accelerating this process are 1) how to process a huge number of short reads with high throughput, and 2) how to hide the frequent and long random memory access when we try to fetch the value of the reference genome. In this paper, we propose a scalable array-based architecture, which is composed by many processing engines (PEs) to process large amounts of data simultaneously for the demand of high throughput. Furthermore, we provide a tight software/hardware integration that realizes the proposed architecture on the Intel-Altera HARP system. With a 16-PE accelerator engine, we accelerate the SMEM algorithm by 4x, and the overall SMEM seeding stage by 26% when compared with 16-thread CPU execution. We further analyze the performance bottleneck of the design due to extensive DRAM accesses and discuss the possible improvements that are worthwhile to be explored in the future. | en_US |
dc.language.iso | en_US | en_US |
dc.title | The SMEM Seeding Acceleration for DNA Sequence Alignment | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.doi | 10.1109/FCCM.2016.21 | en_US |
dc.identifier.journal | 2016 IEEE 24TH ANNUAL INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES (FCCM) | en_US |
dc.citation.spage | 32 | en_US |
dc.citation.epage | 39 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.identifier.wosnumber | WOS:000389602200012 | en_US |
dc.citation.woscount | 0 | en_US |
Appears in Collections: | Conferences Paper |