Coupling hundreds of workstations for parallel molecular sequence analysis
- 1 March 1995
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 25 (3) , 291-304
- https://doi.org/10.1002/spe.4380250305
Abstract
We present a highly scalable approach to distributed parallel computing on workstations in the Internet which provides significant speed‐up to molecular biology sequence analysis. Recent developments show that smaller numbers of workstations connected via a local area network can be used efficiently for parallel computing. This work emphasizes scalability with respect to the number of workstations employed. We show that a massively parallel approach using several hundred workstations, dispersed over all continents, can successfully be applied for solving problems with low requirements on communication bandwidth. We calculated the optimal local alignment scores between a single genetic sequence and all sequences of a genetic sequence database using the ssearch code that is well known among molecular biologists. In a heterogeneous network with more than 800 workstations this job terminated after several minutes, in contrast to several days it would have taken on a single machine.Keywords
This publication has 11 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- A federated DBMS-based integrated environment for molecular biologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient parallel computing in distributed workstation environmentsParallel Computing, 1993
- Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithmsGenomics, 1991
- PVM: A framework for parallel distributed computingConcurrency: Practice and Experience, 1990
- Unix network programmingACM SIGCOMM Computer Communication Review, 1990
- Computational approaches to discovering semantics in molecular biologyProceedings of the IEEE, 1989
- Linda and FriendsComputer, 1986
- The String-to-String Correction ProblemJournal of the ACM, 1974
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970