Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is introduced a solution for parallelizing multiple progressive alignments in distributed memory systems that overcomes such delays. Results: The proposed approach uses threads to separate actual alignment from synchronization and communication. It also uses a different approach to schedule independent tasks. Conclusion/Recommendations: The approach was intensively tested, producing a performance remarkably better than a largely used algorithm. It is suggested that it can be applied to improve the performance of some multiple alignment tools, as CLUSTALW and MUSCLE.

[1]  Alessandro Dal Palù,et al.  A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction , 2007 .

[2]  Suchendra M. Bhandarkar,et al.  Parallel Computing for Chromosome Reconstruction via Ordering of DNA Sequences , 1998, Parallel Comput..

[3]  José Marcio Machado,et al.  SKPDB: a structural database of shikimate pathway enzymes , 2010, BMC Bioinformatics.

[4]  Elizabeth M. Smigielski,et al.  dbSNP: the NCBI database of genetic variation , 2001, Nucleic Acids Res..

[5]  Feng Lin,et al.  Reconstruction of large phylogenetic trees: A parallel approach , 2005, Comput. Biol. Chem..

[6]  E. Li,et al.  Parallel implementation and performance characterization of MUSCLE , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[7]  Desmond G. Higgins,et al.  Evaluation of iterative alignment algorithms for multiple alignment , 2005, Bioinform..

[8]  Jaap Heringa,et al.  Parallelized multiple alignment , 2002, Bioinform..

[9]  Denis Trystram,et al.  Parallel Multiple Sequence Alignment with Decentralized Cache Support , 2005, Euro-Par.

[10]  Volker Strumpen.  Coupling hundreds of workstations for parallel molecular sequence analysis , 1995, Softw. Pract. Exp..

[11]  H.S. Lopes,et al.  A distributed approach for a multiple sequence alignment algorithm using a parallel virtual machine , 2005, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference.

[12]  Nur'Aini Abdul Rashid,et al.  A Survey of Compute Intensive Algorithms for Ribo Nucleic Acids Structural Detection , 2009 .

[13]  Alessandro Dal Palù,et al.  A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction , 2007, Softw. Pract. Exp..

[14]  M Ishikawa,et al.  Multiple sequence alignment by parallel simulated annealing , 1993, Comput. Appl. Biosci..

[15]  Kuo-Bin Li,et al.  ClustalW-MPI: ClustalW analysis using distributed and parallel computing , 2003, Bioinform..

[16]  Raymond A. Paul,et al.  Parallel multiple sequence alignment with dynamic scheduling , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[17]  Rodrigo Lopez,et al.  Clustal W and Clustal X version 2.0 , 2007, Bioinform..

[18]  Andrei Tchernykh,et al.  Parallel multiple sequence alignment with local phylogeny search by simulated annealing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[19]  Amitava Datta,et al.  Multiple sequence alignment in parallel on a workstation cluster , 2004, Bioinform..

[20]  Manimozhiyan Arumugam,et al.  The Treeterbi and Parallel Treeterbi algorithms: efficient, optimal decoding for ordinary, generalized and pair HMMs , 2007, Bioinform..