12920

Mapping dynamic programming algorithms on graphics processing units

Muhammad Kashif Hanif
Technischen Universitat Hamburg, Harburg
Technischen Universitat Hamburg, 2014

@article{hanif2014mapping,

   title={Mapping dynamic programming algorithms on graphics processing units},

   author={Hanif, Muhammad Kashif},

   year={2014},

   publisher={Universit{"a}tsbibliothek}

}

Download Download (PDF)   View View   Source Source   

1128

views

Alignment is the fundamental operation used to compare biological sequences. It also serves to identify regions of similarity that are eventually consequences of structural, functional, or evolutionary relationships. Today, the processing of sequences from large DNA or protein databases is a big challenge. Graphics Processing Units (GPUs) are based on a highly parallel, many-core streaming architecture and can be used to tackle the processing of large biological data. In the thesis, progressive alignment methods and their parallel implemenation by modern GPUs are studied. It turns out that wavefront and matrix-matrix product techniques can cope best with the data dependencies and so are highly appropriate for the implementation on a GPU. The performance of these methods is analyzed and the method with the highest speed-up is used to realize the alignment stage in the well-known software package ClustalW. Similar studies are made for the hidden Markov model. General principles and guidelines for GPU programming of matrix-based algorithms are discussed.
No votes yet.
Please wait...

* * *

* * *

Featured events

HGPU group © 2010-2018 hgpu.org

All rights belong to the respective authors

Contact us: