Modelling Robust Resource Allocation for Grid Computing

Zhimin Tian, Yang Yang, Zhengli Zhai
{"title":"Modelling Robust Resource Allocation for Grid Computing","authors":"Zhimin Tian, Yang Yang, Zhengli Zhai","doi":"10.1109/GCC.2006.63","DOIUrl":null,"url":null,"abstract":"With the increase in size, complexity, and heterogeneity of grid computing environments, we argue that, in addition to performance metrics, the resource allocation algorithms should be designed for robustness. That is, they should have the ability to maintain performance under a wide variety of operating conditions. Although robustness is easy to define, there are no widely used metrics for this property. We introduce the concept of robustness and present an analysis technique to determine the robustness of a resource allocation. As the main contributions of the paper, we present a mathematical description of a metric for the robustness of a resource allocation with respect to a specific disturbance. Simulation results prove the efficiency and applicability of our algorithms","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the increase in size, complexity, and heterogeneity of grid computing environments, we argue that, in addition to performance metrics, the resource allocation algorithms should be designed for robustness. That is, they should have the ability to maintain performance under a wide variety of operating conditions. Although robustness is easy to define, there are no widely used metrics for this property. We introduce the concept of robustness and present an analysis technique to determine the robustness of a resource allocation. As the main contributions of the paper, we present a mathematical description of a metric for the robustness of a resource allocation with respect to a specific disturbance. Simulation results prove the efficiency and applicability of our algorithms
网格计算鲁棒资源分配建模
随着网格计算环境的规模、复杂性和异质性的增加,我们认为,除了性能指标外,资源分配算法还应该设计为鲁棒性。也就是说,它们应该有能力在各种操作条件下保持性能。虽然鲁棒性很容易定义,但对于这一属性没有广泛使用的度量。我们引入了鲁棒性的概念,并提出了一种确定资源分配鲁棒性的分析技术。作为本文的主要贡献,我们提出了一种关于特定干扰的资源分配鲁棒性度量的数学描述。仿真结果证明了算法的有效性和适用性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信