On an efficient parallelization of exhaustive sequence comparison algorithms on message passing architectures.
We present a new parallel computing approach to the case of exhaustive sequential sequence comparison algorithms on message-passing architectures. In this context a modification of guided self-scheduling as well as efficient buffering strategies are presented. We discuss two specific implementations, one on the Paramid parallel computer, and the other on a cluster of workstations running PVM. In both cases the parallel performance is higher than with any other method presented so far. The code is public domain and can be obtained by anonymous ftp at ftp.cnb.uam.es.
Trelles-Salazar
O
O
Department of Computer Architecture, University of Malaga.
Zapata
E L
EL
Carazo
J M
JM
D000465:Algorithms; D003195:Computer Communication Networks; D003199:Computer Systems; D017421:Sequence Analysis