On the predictability of protein database search complexity and its relevance to optimization of distributed searches.
We discuss several aspects related to load balancing of database search jobs in a distributed computing environment, such as Linux cluster. Load balancing is a technique for making the most of multiple computational resources, which is particularly relevant in environments in which the usage of such resources is very high. The particular case of the Sequest program is considered here, but the general methodology should apply to any similar database search program. We show how the runtimes for Sequest searches of tandem mass spectral data can be predicted from profiles of previous representative searches, and how this information can be used for better load balancing of novel data. A well-known heuristic load balancing method is shown to be applicable to this problem, and its performance is analyzed for a variety of search parameters.
Deciu
Cosmin
C
Diversa Corporation, San Diego, California 92121, USA. cdeciu@diversa.com
Sun
Jun
J
Wall
Mark A
MA
D001426:Bacterial Proteins / Q000737:chemistry; D002853:Chromatography, Liquid; D019295:Computational Biology / Q000379:methods; D003201:Computers; D003205:Computing Methodologies; D030562:Databases, Protein; D003901:Desulfovibrio / Q000378:metabolism; D006801:Humans; D016247:Information Storage and Retrieval; D013058:Mass Spectrometry; D040901:Proteomics / Q000295:instrumentation* / Q000379:methods; D015203:Reproducibility of Results; D012984:Software; D013997:Time Factors
D001426:Bacterial Proteins