A multi‐GPU protein database search model with hybrid alignment manner on distributed GPU clusters

In computational biology, technologies of protein database search become more and more indispensable for researchers. As the database size rapidly grows, the search complexity is improving, leading to an excessively long runtime. In this paper, we provide a novel parallel protein database search model based on distributed GPU clusters. The proposed model targets clusters composed of personal computers equipped with graphic processing unit (GPU) cards and can employ computing power of GPUs and CPUs in the cluster nodes. The workload distribution strategy is designed to take the performance of each node into account, which enables the model to work well with inhomogeneous cluster nodes with different hardware configurations. A hybrid alignment approach, an extension to our previous work, is used in our model to make global and local alignments done concurrently. The parallel program is realized with compute unified device architecture (CUDA) parallel framework and Microsoft message passing interface (MS‐MPI). In the experiment, the model is tested on a small cluster composed of three personal computers. The results show that the proposed model can achieve a speedup up to 159.89 times over the serial counterpart when searching the Swiss‐Prot database.

[1]  Sean R Eddy,et al.  Where did the BLOSUM62 alignment score matrix come from? , 2004, Nature Biotechnology.

[2]  Heba Khaled,et al.  Design and implementation of a hybrid MPI-CUDA model for the Smith-Waterman algorithm , 2015, Int. J. Data Min. Bioinform..

[3]  Fa Zhang,et al.  A parallel Smith-Waterman algorithm based on divide and conquer , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[4]  O. Gotoh An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.

[5]  Fengshun Lu,et al.  HLognGP: A parallel computation model for GPU clusters , 2015, Concurr. Comput. Pract. Exp..

[6]  Yongchao Liu,et al.  CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units , 2009, BMC Research Notes.

[7]  D. Mount Bioinformatics: Sequence and Genome Analysis , 2001 .

[8]  W. Pearson Rapid and sensitive sequence comparison with FASTP and FASTA. , 1990, Methods in enzymology.

[9]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[10]  Yongchao Liu,et al.  CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions , 2013, BMC Bioinformatics.

[11]  William J. Dally,et al.  The GPU Computing Era , 2010, IEEE Micro.

[12]  Thomas L. Madden,et al.  Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. , 1997, Nucleic acids research.

[13]  Jie Cheng,et al.  Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..

[14]  Mark J. Clement,et al.  High Performance Computing for the Masses , 1999, IPPS/SPDP Workshops.

[15]  William J. Dally,et al.  GPUs and the Future of Parallel Computing , 2011, IEEE Micro.

[16]  Mahdi Noorian,et al.  Performance enhancement of smith-waterman algorithm using hybrid model: Comparing the MPI and hybrid programming paradigm on SMP clusters , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[17]  Weiguo Liu,et al.  Bio-sequence database scanning on a GPU , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[18]  Wei Zhou,et al.  Protein database search of hybrid alignment algorithm based on GPU parallel acceleration , 2017, The Journal of Supercomputing.

[19]  Jacek Blazewicz,et al.  Protein alignment algorithms with an efficient backtracking routine on multiple GPUs , 2011, BMC Bioinformatics.

[20]  Valery Polyanovsky,et al.  Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences , 2011, Algorithms for Molecular Biology.

[21]  Yongchao Liu,et al.  CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions , 2010, BMC Research Notes.

[22]  Kevin Skadron,et al.  Scalable parallel programming , 2008, 2008 IEEE Hot Chips 20 Symposium (HCS).

[23]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[24]  Kevin Skadron,et al.  Scalable parallel programming , 2008, 2008 IEEE Hot Chips 20 Symposium (HCS).