Creating services with hard guarantees from cycle-harvesting systems

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI:10.1109/CCGRID.2003.1199372

Chris M. Kenyon, G. Cheliotis

{"title":"Creating services with hard guarantees from cycle-harvesting systems","authors":"Chris M. Kenyon, G. Cheliotis","doi":"10.1109/CCGRID.2003.1199372","DOIUrl":null,"url":null,"abstract":"Cycle-harvesting is a significant part of the Grid computing landscape. However, creating commercial service contracts based on resources made available by cycle-harvesting is a significant challenge: the characteristics of the harvested resources are inherently stochastic; and secondly, in a commercial environment, purchasers can expect providers to optimize against the quality of service (QoS) definitions. The essential point for creating commercially valuable QoS definitions is to guarantee a set of statistical parameters for each contract instance. Here we describe an appropriate QoS definition, Hard Statistical QoS (HSQ), and show how this can be implemented using a hybrid stochastic-deterministic system. We analyze algorithm behavior analytically using a distribution free approach versus the expected proportion of deterministic resources required for an HSQ specification. We conclude that commercial service contracts based on cycle-harvested resources are viable both from a conceptual point of view and quantitatively.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"425 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGRID.2003.1199372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

Abstract

Cycle-harvesting is a significant part of the Grid computing landscape. However, creating commercial service contracts based on resources made available by cycle-harvesting is a significant challenge: the characteristics of the harvested resources are inherently stochastic; and secondly, in a commercial environment, purchasers can expect providers to optimize against the quality of service (QoS) definitions. The essential point for creating commercially valuable QoS definitions is to guarantee a set of statistical parameters for each contract instance. Here we describe an appropriate QoS definition, Hard Statistical QoS (HSQ), and show how this can be implemented using a hybrid stochastic-deterministic system. We analyze algorithm behavior analytically using a distribution free approach versus the expected proportion of deterministic resources required for an HSQ specification. We conclude that commercial service contracts based on cycle-harvested resources are viable both from a conceptual point of view and quantitatively.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

创建由循环收集系统提供硬保证的服务

循环收集是网格计算领域的重要组成部分。然而，基于循环收集提供的资源创建商业服务合同是一个重大挑战:收集的资源的特征本质上是随机的;其次，在商业环境中，购买者可以期望提供者根据服务质量(QoS)定义进行优化。创建具有商业价值的QoS定义的要点是保证为每个契约实例提供一组统计参数。在这里，我们描述了一个适当的QoS定义，硬统计QoS (HSQ)，并展示了如何使用混合随机-确定性系统来实现它。我们使用无分布的方法分析算法行为，而不是HSQ规范所需的确定性资源的预期比例。我们的结论是，基于循环收获资源的商业服务合同从概念上和数量上都是可行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.

自引率

0.00%

发文量

期刊最新文献

An overlay-network approach for distributed access to SRS Large scale dissemination using a peer-to-peer network MPICH/MADIII : a cluster of clusters enabled MPI implementation DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications Fault-tolerant distributed mass storage for LHC computing