the nimrod computational workbench a case strongstudystrong in desktop.pptVIP

下载本文档

1
0
约4.14千字
约 18页
2016-03-05 发布于广东
举报
版权申诉

the nimrod computational workbench a case strongstudystrong in desktop.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

the nimrod computational workbench a case strongstudystrong in desktop

Computational Grids and Computational Economy: Nimrod/G Approach Parametric Execution of Applications Coarse-grained SPMD model Execute one application repeatedly for many combinations of input parameters Legacy applications: add iteration and distribution without modifying code New applications: remove iteration and distribution from design Parametrised modeling experiments: Require very high levels of performance Generate Large amounts of work concurrency Uncoupled computations Tolerate - moderately high latencies Working with Small Clusters Nimrod (1994 - ) DSTC funded project Designed for department level clusters Proof of concept Clustor (Activetools) (1997 - ) Commercial version of Nimrod Re-engineered Features Workstation orientation Access to idle workstations Random allocation policy Password security Clustor limitations Manual resource location static file of machine names No resource scheduling first come first served No cost model all machines cost alike Single access mechanism Towards Grid Computing…. Nimrod/G - Nimrod over Globus/Grid Wide-Area Network Support redesigned architecture use of high-performance networks Scalable Scheduling “guaranteed” deadline use of existing schedulers Computational Economy “I am willing to pay $$, can you complete the job by given deadline” trading, bidding, resource reservation... Layered Architecture (Grid Components) Nimrod/G Architecture Nimrod/G Interactions Scheduling Algorithm Find a set of machines (MDS search) Distribute jobs from root to machines Establish job consumption rate for each machine For each machine Can we meet deadline? If not, then return some jobs to root If yes, distribute more jobs to resource If cannot meet deadline with current resource Find additional resources A Nimrod/G Client Sample Applications of Nimrod Bioinformatics: Protein Modeling Sensitivity experiments on smog formation Parametric study of Laser detuning Combinatorial Optimization: Simulated Annealing Ecological Mo