A model for optimal resource allocation in distributed computing systems

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? Pub Date : 1988-03-27 DOI:10.1109/INFCOM.1988.13020

Ge-Ming Chiu, C. Raghavendra

{"title":"A model for optimal resource allocation in distributed computing systems","authors":"Ge-Ming Chiu, C. Raghavendra","doi":"10.1109/INFCOM.1988.13020","DOIUrl":null,"url":null,"abstract":"Optimal allocation of redundant resources in distributed computing systems is studied. In this model, a request from a processing site for a resource can be satisfied by any one of the copies. Among the redundant copies of the resources, the least-expensive and the second-least-expensive ones are considered for accessing by each processing site, which is measured in terms of communication cost. This access scheme offers to encompass some of the intrinsically important features, such as graceful degradation and reliability consideration, in the design model. The increase of communication cost due to the failures of resources should be gradual to maintain the system performance. With the present formulation, the goal of the allocation is to minimize the total communication cost incurred. The Lagrangian relaxation and subgradient methods are applied to solve this problem. An efficient algorithm based on these techniques, and computational results, are presented.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"16 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.13020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

Abstract

Optimal allocation of redundant resources in distributed computing systems is studied. In this model, a request from a processing site for a resource can be satisfied by any one of the copies. Among the redundant copies of the resources, the least-expensive and the second-least-expensive ones are considered for accessing by each processing site, which is measured in terms of communication cost. This access scheme offers to encompass some of the intrinsically important features, such as graceful degradation and reliability consideration, in the design model. The increase of communication cost due to the failures of resources should be gradual to maintain the system performance. With the present formulation, the goal of the allocation is to minimize the total communication cost incurred. The Lagrangian relaxation and subgradient methods are applied to solve this problem. An efficient algorithm based on these techniques, and computational results, are presented.<>

查看原文本刊更多论文

分布式计算系统中最优资源分配模型

研究了分布式计算系统中冗余资源的优化分配问题。在这个模型中，处理站点对资源的请求可以由任何一个副本来满足。在资源的冗余副本中，每个处理站点考虑访问最便宜和第二便宜的副本，这是根据通信成本来衡量的。这种访问方案提供了在设计模型中包含一些本质上重要的特性，例如优雅退化和可靠性考虑。由于资源失效导致的通信成本的增加应该是渐进的，以保持系统的性能。在目前的公式中，分配的目标是最小化所产生的总通信成本。应用拉格朗日松弛法和次梯度法求解了这一问题。本文给出了一种基于这些技术的高效算法，并给出了计算结果。

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

求助全文

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

来源期刊

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?

自引率

0.00%

发文量