ON AN EFFICIENT PARALLELIZATION OF EXHAUSTIVE SEQUENCE COMPARISON ALGORITHMS ON MESSAGE-PASSING ARCHITECTURES

Authors
TRELLESSALAZAR O ZAPATA EL CARAZO JM
Citation
O. Trellessalazar et al., ON AN EFFICIENT PARALLELIZATION OF EXHAUSTIVE SEQUENCE COMPARISON ALGORITHMS ON MESSAGE-PASSING ARCHITECTURES, Computer applications in the biosciences, 10(5), 1994, pp. 509-511
Citations number
10
Categorie Soggetti
Mathematical Methods, Biology & Medicine","Computer Sciences, Special Topics","Computer Science Interdisciplinary Applications","Biology Miscellaneous
Journal title
Computer applications in the biosciences → ACNP
ISSN journal
02667061
Volume
10
Issue
5
Year of publication
1994
Pages
509 - 511
Database
ISI
SICI code
0266-7061(1994)10:5<509:OAEPOE>2.0.ZU;2-B
Abstract
We present a new parallel computing approach to the case of exhaustive sequential sequence comparison algorithms on message-passing architec tures. In this context a modification of guided self-scheduling as wel l as efficient buffering strategies are presented. We discuss two spec ific implementations, one on the Paramid parallel computer, and the ot her an a cluster of workstations running PVM. In both cases the parall el 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.uames.