Published September 22, 2003
| public
Journal Article
Parallel BLAST on split databases
- Creators
- Mathog, David R.
Abstract
BLAST programs often run on large SMP machines where multiple threads can work simultaneously and there is enough memory to cache the databases between program runs. A group of programs is described which allows comparable performance to be achieved with a Beowulf configuration in which no node has enough memory to cache a database but the cluster as an aggregate does. To achieve this result, databases are split into equal sized pieces and stored locally on each node. Each query is run on all nodes in parallel and the resultant BLAST output files from all nodes merged to yield the final output.
Additional Information
© 2003 Oxford University Press. Received on July 10, 2002; revised on February 20, 2003; accepted on April 18, 2003. I thank Caltech and the Howard Hughes Medical Institute for support. I also thank R. Andrew Cameron, Erich Schwarz and Leonard Thomas, for their comments on the manuscript.Additional details
- Eprint ID
- 27321
- Resolver ID
- CaltechAUTHORS:20111020-082203402
- Caltech
- Howard Hughes Medical Institute (HHMI)
- Created
-
2011-10-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field