论文信息 - Efficient Parallel Execution of Sequence Similarity Analysis Via Dynamic Load Balancing

Efficient Parallel Execution of Sequence Similarity Analysis Via Dynamic Load Balancing

We present a parallel approach to analyzing sequence similarity in a set of genomes that employs dynamic load balancing to address the variation in execution time for genes of different lengths and complexity, the variation in processor power in different nodes of the computer cluster, and the variation in other load on the nodes. Our approach executes using MPI on a cluster of computers. We provide experimental results to demonstrate the effectiveness of using our approach in conjunction with NCBI BLAST.

Philip J. Hatcher | James D. Jackson

[1] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.

[2] Christophe Dessimoz,et al. SWPS3 – fast multi-threaded vectorized Smith-Waterman for IBM Cell/B.E. and ×86/SSE2 , 2008, BMC Research Notes.

[3] Wu-chun Feng,et al. The design, implementation, and evaluation of mpiBLAST , 2003 .

[4] Chunlin Wang,et al. SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters , 2004, BMC Bioinformatics.

[5] Ning Ma,et al. BLAST+: architecture and applications , 2009, BMC Bioinformatics.

[6] Thomas L. Casavant,et al. Parallelization of local BLAST service on workstation clusters , 2001, Future Gener. Comput. Syst..

[7] Michael S. Farrar. Optimizing Smith-Waterman for the Cell Broadband Engine , 2008 .