Parallel BLAST on split databases

Open Access
Publisher Website
Google Scholar
Abstract
Summary: 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. Availability: Source code is available from ftp://saf.bio.caltech.edu/

This publication has 0 references indexed in Scilit: