No pain and gain!—experiences with Mentat on a biological application
- 1 June 1993
- journal article
- research article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 5 (4) , 309-328
- https://doi.org/10.1002/cpe.4330050407
Abstract
Throughout much of the parallel processing community there is the sense that writing software for distributed‐memory parallel processors Is subject to a ‘no pain—no gain’ rule: that In order to reap the benefits of parallel computation one must first suffer the pain of converting the application to run on a parallel machine. We believe this Is the result of Inadequate programming tools and not a problem Inherent to parallel processing. We will show that one can parallelize real scientific applications and obtain good performance with little effort If the right tools are used. Our vehicle for this demonstration is a 6000‐line DNA and protein sequence comparison application that we have implemented in Mental, an object‐oriented parallel processing system for both parallel and distributed architectures. We briefly describe the application and present performance information for both the Mentat version and a hand‐coded parallel version of the application.Keywords
This publication has 10 references indexed in Scilit:
- The Mentat Run-Time System: Support for Medium Grain Parallel ComputationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- Dynamic, object-oriented parallel processingIEEE Parallel & Distributed Technology: Systems & Applications, 1993
- Easy-to-use object-oriented parallel processing with MentatComputer, 1993
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Linda in contextCommunications of the ACM, 1989
- Improved tools for biological sequence comparison.Proceedings of the National Academy of Sciences, 1988
- Parallel Programming and CompilersPublished by Springer Nature ,1988
- Dependence graphs and compiler optimizationsPublished by Association for Computing Machinery (ACM) ,1981
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970