Resource Allocation for Heterogeneous Cloud Computing Using Weighted Fair-Share Queues

K. N. Kumar, Reshmi Mitra
{"title":"Resource Allocation for Heterogeneous Cloud Computing Using Weighted Fair-Share Queues","authors":"K. N. Kumar, Reshmi Mitra","doi":"10.1109/CCEM.2018.00014","DOIUrl":null,"url":null,"abstract":"On-demand resource provisioning is based on automated approaches for resource pooling and elasticity on the cloud service provider (CSP) side. The infrastructure services must be adapted dynamically to accommodate customer demands and yet, operate within offerings of the CSP. Although multiple approaches for homogeneous clouds are available, more realistic platforms based on heterogeneous resources and virtual machines (VMs) present unique challenges. Our resource management algorithm allocates memory, network and computational resources to heterogeneous VMs, in order to provide customized fine-grained control for the scalable capacity planning of data centers. Weighted fair-share (WFS) queues: high, medium and low are used to classify the incoming jobs in buckets of appropriate length based on priority. The highest priority jobs with aggressive deadlines are allowed to progress at a similar pace using round-robin scheduling, while lowest priority jobs are allocated on Low Queue with First-Come-First-Serve (FCFS) scheduling. The proposed algorithm performs better on throughput related metrics: number of instructions executed (30% more), turn-around and waiting times (on an average of about 10% less) w.r.t. standard policies such as shortest job first (SJF) and FCFS.","PeriodicalId":156315,"journal":{"name":"2018 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCEM.2018.00014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

On-demand resource provisioning is based on automated approaches for resource pooling and elasticity on the cloud service provider (CSP) side. The infrastructure services must be adapted dynamically to accommodate customer demands and yet, operate within offerings of the CSP. Although multiple approaches for homogeneous clouds are available, more realistic platforms based on heterogeneous resources and virtual machines (VMs) present unique challenges. Our resource management algorithm allocates memory, network and computational resources to heterogeneous VMs, in order to provide customized fine-grained control for the scalable capacity planning of data centers. Weighted fair-share (WFS) queues: high, medium and low are used to classify the incoming jobs in buckets of appropriate length based on priority. The highest priority jobs with aggressive deadlines are allowed to progress at a similar pace using round-robin scheduling, while lowest priority jobs are allocated on Low Queue with First-Come-First-Serve (FCFS) scheduling. The proposed algorithm performs better on throughput related metrics: number of instructions executed (30% more), turn-around and waiting times (on an average of about 10% less) w.r.t. standard policies such as shortest job first (SJF) and FCFS.
基于加权公平共享队列的异构云计算资源分配
按需资源供应基于云服务提供商(CSP)端资源池和弹性的自动化方法。基础设施服务必须动态调整以适应客户需求,同时在CSP的产品中运行。尽管同构云有多种可用的方法,但基于异构资源和虚拟机(vm)的更现实的平台提出了独特的挑战。我们的资源管理算法为异构虚拟机分配内存、网络和计算资源,为数据中心的可扩展容量规划提供定制化的细粒度控制。加权公平共享(WFS)队列:高、中、低用于根据优先级将传入作业分类到适当长度的桶中。使用循环调度,允许具有侵略性截止日期的最高优先级的作业以类似的速度进行,而使用先到先服务(FCFS)调度的低队列分配最低优先级的作业。所提出的算法在吞吐量相关指标上表现更好:执行的指令数(多30%)、周转时间和等待时间(平均减少约10%)比标准策略(如最短作业优先(SJF)和FCFS)要好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信