Dynamic resource allocation of shared data centers supporting multiclass requests

S. R. Mahabhashyam, N. Gautam
{"title":"Dynamic resource allocation of shared data centers supporting multiclass requests","authors":"S. R. Mahabhashyam, N. Gautam","doi":"10.1109/ICAC.2004.28","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a shared data center (or Web server) with requests from multiple companies: each company with two classes of request: 1) streaming requests and 2) elastic requests. The processing capacity of the Web server is shared by the companies' requests of the two classes. An analytical model is developed and matrix geometric method is used to derive the system performance measures. A cost model is developed to obtain a request admission control policy that utilizes the Web server's processing capacity efficiently. The objective is to maximize the revenue of the data center, which is a function of the multiclass request characteristics and the quality of service measures. It is well known that the request characteristics like arrival rates vary dynamically over time. As a consequence, autonomic computing is the only practical way for determining on the fly how to partition the Web server processing capacity over time among the companies.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Autonomic Computing, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAC.2004.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In this paper, we consider a shared data center (or Web server) with requests from multiple companies: each company with two classes of request: 1) streaming requests and 2) elastic requests. The processing capacity of the Web server is shared by the companies' requests of the two classes. An analytical model is developed and matrix geometric method is used to derive the system performance measures. A cost model is developed to obtain a request admission control policy that utilizes the Web server's processing capacity efficiently. The objective is to maximize the revenue of the data center, which is a function of the multiclass request characteristics and the quality of service measures. It is well known that the request characteristics like arrival rates vary dynamically over time. As a consequence, autonomic computing is the only practical way for determining on the fly how to partition the Web server processing capacity over time among the companies.
支持多类请求的共享数据中心的动态资源分配
在本文中,我们考虑一个具有来自多个公司的请求的共享数据中心(或Web服务器):每个公司有两类请求:1)流请求和2)弹性请求。Web服务器的处理能力由这两个类的公司请求共享。建立了分析模型,并采用矩阵几何方法推导了系统的性能度量。为了获得有效利用Web服务器处理能力的请求允许控制策略,建立了成本模型。目标是使数据中心的收益最大化,这是多类请求特征和服务质量度量的函数。众所周知,请求特征(如到达率)会随时间动态变化。因此,自主计算是动态确定如何在公司之间划分Web服务器处理能力的唯一实用方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信