Issue No. 10 - Oct. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.19
Ananth Kalyanaraman , Washington State University, Pullman
Changjun Wu , Xerox Research Center, Webster
William R. Cannon , Pacific Northwest National Laboratory, Richland
Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problem particularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.
Protein sequence, Computational modeling, Amino acids, DNA, Image edge detection, Dynamic programming, producer-consumer model, Parallel protein sequence homology detection, parallel sequence graph construction, hierarchical master-worker paradigm
Ananth Kalyanaraman, Changjun Wu, William R. Cannon, "pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1923-1933, Oct. 2012, doi:10.1109/TPDS.2012.19