Performance Evaluation of Protein Structure Comparison Algorithms Under Integrated Resource Management Environment for MPI Jobs

A. Shah, Daniel Barthel, G. Folino, N. Krasnogor
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综合资源管理环境下MPI作业中蛋白质结构比较算法的性能评价
蛋白质三级结构的比较是许多结构生物信息学活动的关键里程碑,这些活动依赖于比较非常大的结构数据集。随着数据集中蛋白质数量的增加,蛋白质结构比较算法所花费的相应计算时间也会增加,对于全对全比较来说,计算时间是正数,对于全对目标评估来说,计算时间是线性的。因此,更大的蛋白质组学问题需要以良好粒度的子集/包的形式分发成对比较作业,以便在消息传递接口(MPI)环境的协调下在网络处理器/工作站池上并行运行。本文评估了MPI环境与本地资源管理系统(LRMS)(如太阳网格引擎(SGE))集成时对这些作业性能的影响。通过对不同集成方式的实验,我们通过描述每个处理器上每个并行作业的资源使用信息,绘制了所有可能方法的比较图。对不同整合方式的理解揭示了最有希望为大规模蛋白质结构比较建立有效环境的途径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Image Feature Vector Construction Using Interest Point Based Regions A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs Fixed Point Decimal Multiplication Using RPS Algorithm Self-Stabilizing Construction of Bounded Size Clusters ScatterClipse: A Model-Driven Tool-Chain for Developing, Testing, and Prototyping Wireless Sensor Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1