| Literature DB >> 27104636 |
Sergio Gálvez1, Adis Ferusic1, Francisco J Esteban2, Pilar Hernández3, Juan A Caballero4, Gabriel Dorado5.
Abstract
The Smith-Waterman algorithm has a great sensitivity when used for biological sequence-database searches, but at the expense of high computing-power requirements. To overcome this problem, there are implementations in literature that exploit the different hardware-architectures available in a standard PC, such as GPU, CPU, and coprocessors. We introduce an application that splits the original database-search problem into smaller parts, resolves each of them by executing the most efficient implementations of the Smith-Waterman algorithms in different hardware architectures, and finally unifies the generated results. Using non-overlapping hardware allows simultaneous execution, and up to 2.58-fold performance gain, when compared with any other algorithm to search sequence databases. Even the performance of the popular BLAST heuristic is exceeded in 78% of the tests. The application has been tested with standard hardware: Intel i7-4820K CPU, Intel Xeon Phi 31S1P coprocessors, and nVidia GeForce GTX 960 graphics cards. An important increase in performance has been obtained in a wide range of situations, effectively exploiting the available hardware.Keywords: CUDA; Xeon Phi; balance load; bioinformatics; coarse-grained parallelization; many-core; non-overlapping hardware; sequence alignment
Mesh:
Year: 2016 PMID: 27104636 DOI: 10.1089/cmb.2015.0237
Source DB: PubMed Journal: J Comput Biol ISSN: 1066-5277 Impact factor: 1.479