Parallel Multiple Sequence Alignment with Dynamic Scheduling

Authors:
Jiancong Luo;Ishfaq Ahmad;Munib Ahmed;Raymond Paul
Affiliations:
The University of Texas at Arlington, TX;The University of Texas at Arlington, TX;The University of Texas at Arlington, TX;The University of Texas at Arlington, TX
Venue:
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Year:
2005

Citing 0
Cited 3

Pairwise Distance Matrix Computation for Multiple Sequence Alignment on the Cell Broadband Engine

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
MT-clustalW: multithreading multiple sequence alignment

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parallelization of multiple genome alignment

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a parallel implementation of the multiple sequence alignment algorithm, known as ClustalW, on distributed memory parallel machines. The proposed algorithm divides a progressive alignment into subtasks and schedules them dynamically. A task tree is built according to the dependency of the generated phylogenetic tree. The computation and communication costs of the tasks are estimated at run-time and updated periodically. With dynamic scheduling, tasks are allocated to the processors considering the tasks' estimated computation and communication costs and the processors' workload in order to minimize the completion time. The experiment results show that the proposed parallel implementation is achieves a considerable speedup over the sequential ClustalW.