A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison.
This paper discusses the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a general-purpose parallel computing platform based on a fine-grain event-driven multithreaded program execution model. Fine-grain multithreading permits efficient parallelism exploitation in this application both by taking advantage of asynchronous point-to-point synchronizations and communication with low overheads and by effectively tolerating latency through the overlapping of computation and communication. We have implemented our scheme on EARTH, a fine-grain event-driven multithreaded execution and architecture model which has been ported to a number of parallel machines with off-the-shelf processors. Our experimental results show that the dynamic programming algorithm can be efficiently implemented on EARTH systems with high performance (e.g., speedup of 90 on 120 nodes), good programmability and reasonable cost.
Martins
W S
WS
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, USA.
Del Cuvillo
J B
JB
Useche
F J
FJ
Theobald
K B
KB
Gao
G R
GR
D000465:Algorithms; D016415:Sequence Alignment / Q000706:statistics & numerical data*; D012984:Software