DMCA
Accelerating Bowtie2 with a lock-less concurrency approach and memory affinity
| Citations: | 2 - 1 self |
BibTeX
@MISC{Misale_acceleratingbowtie2,
author = {Claudia Misale},
title = {Accelerating Bowtie2 with a lock-less concurrency approach and memory affinity},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—The implementation of DNA alignment tools for Bioinformatics lead to face different problems that dip into performances. A single alignment takes an amount of time that is not predictable and there are different factors that can affect performances, for instance the length of sequences can determine the computational grain of the task and mismatches or insertion/deletion (indels) increase time needed to complete an alignment. Moreover, an alignment is a strong memory-bound problem because of the irregular memory access pat-terns and limitations in memory-bandwidth. Over the years, many alignment tools were implemented. A concrete example is Bowtie2, one of the fastest (concurrent, Pthread-based) and state of the art not GPU-based alignment tool. Bowtie2 exploits concurrency by instantiating a pool of threads, which have access to a global input dataset, share the reference genome and have access to different objects for collecting alignment results. In this paper a modified implementation of Bowtie2 is presented, in which the concurrency structure has been changed. The proposed implementation exploits the task-farm skeleton pattern implemented as a Master-Worker. The Master-Worker pattern permits to delegate only to the Master thread dataset reading and to make private to each Worker data structures that are shared in the original version. Only the reference genome is left shared. As a further optimisation, the Master and each Worker were pinned on cores and the reference genome was allocated interleaved among memory nodes. The proposed implementation is able to gain up to 10 speedup points over the original implementation. I.
Keyphrases
lock-less concurrency approach reference genome memory affinity alignment result task-farm skeleton pattern irregular memory access pat-terns many alignment tool dna alignment tool increase time original implementation single alignment concurrency structure different object strong memory-bound problem modified implementation worker data structure speedup point memory node global input dataset master-worker pattern master thread dataset reading original version different problem gpu-based alignment tool insertion deletion different factor concrete example computational grain
