{"title":"Performance Evaluation of Protein Structure Comparison Algorithms Under Integrated Resource Management Environment for MPI Jobs","authors":"A. Shah, Daniel Barthel, G. Folino, N. Krasnogor","doi":"10.1109/ISPA.2008.41","DOIUrl":null,"url":null,"abstract":"The comparison of protein tertiary structures is a key milestone in many structural bioinformatics activities that rely in comparing very large structure datasets. As the number of proteins in the dataset increases, the corresponding computational time taken by the protein structure comparison algorithms also increases, squarely for an all-against-all comparison and linearly for an all-against-target assessment. Thus ever larger proteomics problems call for the distribution of pairwise comparison jobs in the form of well granulated subsets/packages to be run in parallel on a pool of networked processors/workstations under the coordination of a message passing interface (MPI) environment. This paper evaluates the effect on the performance of such jobs when the MPI environment is integrated with a local resource management system (LRMS) such as sun grid engine (SGE). From our experiments with different ways of integration we draw a comparative picture of all possible approaches with the description of resource usage information for each parallel job on each processor. Understanding of different ways of integration sheds light on the most promising routes for setting up an efficient environment for very large scale protein structure comparisons.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"22 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2008.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The comparison of protein tertiary structures is a key milestone in many structural bioinformatics activities that rely in comparing very large structure datasets. As the number of proteins in the dataset increases, the corresponding computational time taken by the protein structure comparison algorithms also increases, squarely for an all-against-all comparison and linearly for an all-against-target assessment. Thus ever larger proteomics problems call for the distribution of pairwise comparison jobs in the form of well granulated subsets/packages to be run in parallel on a pool of networked processors/workstations under the coordination of a message passing interface (MPI) environment. This paper evaluates the effect on the performance of such jobs when the MPI environment is integrated with a local resource management system (LRMS) such as sun grid engine (SGE). From our experiments with different ways of integration we draw a comparative picture of all possible approaches with the description of resource usage information for each parallel job on each processor. Understanding of different ways of integration sheds light on the most promising routes for setting up an efficient environment for very large scale protein structure comparisons.