MLF-DRS:异构云计算系统中多级公平资源分配算法

Hamed Hamzeh, Sofia Meacham, B. Virginas, Kashaf Khan, Keith Phalp
{"title":"MLF-DRS:异构云计算系统中多级公平资源分配算法","authors":"Hamed Hamzeh, Sofia Meacham, B. Virginas, Kashaf Khan, Keith Phalp","doi":"10.1109/CCOMS.2019.8821774","DOIUrl":null,"url":null,"abstract":"Cloud computing is a novel paradigm which provides on demand, scalable and pay-as-you-use computing resources in a virtualized form. With cloud computing, users are able to access large pools of resources anywhere without any limitation. In order to use the provided facilities by the cloud in an efficient way, the management of resources is an undeniable fact that should be considered in different aspects. Among all those aspects, resource allocation has received much attentions. Given the fact that the cloud is heterogeneous, the allocation of resources has to become more sophisticated. As a first promising work to deal with that problem, Dominant Resource Fairness (DRF) has been proposed which takes into account dominant shares of users. Although DRF has a sort of desirable fairness properties, it has some limitations that have already been identified in the literature. Unfortunately, DRF and its recent developments are not intuitively fair with respect to various resource demands. In this paper, we propose a Multi-level Fair Dominant Resource Scheduling (MLF-DRS) algorithm as a new allocation model inspired by Max-Min fairness and proportionality. Unlike other works that they equalize dominant shares of different resource types which leads to starvation in the maximization of allocation for some users, our algorithm guarantees that each user receives the resources they desire for based on dominant shares. As can be deducted from the mathematical proofs, MLF-DRS provides a full utilization of resources and meets some of the desirable fair allocation properties and it is applicable to be used in a navïe extension form in the presence of multiple servers as well.","PeriodicalId":289009,"journal":{"name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"MLF-DRS: A Multi-level Fair Resource Allocation Algorithm in Heterogeneous Cloud Computing Systems\",\"authors\":\"Hamed Hamzeh, Sofia Meacham, B. Virginas, Kashaf Khan, Keith Phalp\",\"doi\":\"10.1109/CCOMS.2019.8821774\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing is a novel paradigm which provides on demand, scalable and pay-as-you-use computing resources in a virtualized form. With cloud computing, users are able to access large pools of resources anywhere without any limitation. In order to use the provided facilities by the cloud in an efficient way, the management of resources is an undeniable fact that should be considered in different aspects. Among all those aspects, resource allocation has received much attentions. Given the fact that the cloud is heterogeneous, the allocation of resources has to become more sophisticated. As a first promising work to deal with that problem, Dominant Resource Fairness (DRF) has been proposed which takes into account dominant shares of users. Although DRF has a sort of desirable fairness properties, it has some limitations that have already been identified in the literature. Unfortunately, DRF and its recent developments are not intuitively fair with respect to various resource demands. In this paper, we propose a Multi-level Fair Dominant Resource Scheduling (MLF-DRS) algorithm as a new allocation model inspired by Max-Min fairness and proportionality. Unlike other works that they equalize dominant shares of different resource types which leads to starvation in the maximization of allocation for some users, our algorithm guarantees that each user receives the resources they desire for based on dominant shares. As can be deducted from the mathematical proofs, MLF-DRS provides a full utilization of resources and meets some of the desirable fair allocation properties and it is applicable to be used in a navïe extension form in the presence of multiple servers as well.\",\"PeriodicalId\":289009,\"journal\":{\"name\":\"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCOMS.2019.8821774\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCOMS.2019.8821774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

云计算是一种新颖的范例,它以虚拟化的形式提供按需、可扩展和按需付费的计算资源。使用云计算,用户可以在任何地方不受任何限制地访问大型资源池。为了有效地使用云提供的设施,资源的管理是一个不可否认的事实,应该从不同的方面考虑。在这些方面中,资源配置受到了广泛的关注。考虑到云是异构的这一事实,资源分配必须变得更加复杂。作为解决这一问题的第一个有希望的工作,主导资源公平(DRF)被提出,它考虑了用户的主导份额。尽管DRF具有一种理想的公平性,但它有一些已经在文献中确定的局限性。不幸的是,就各种资源需求而言,DRF及其最近的发展在直觉上并不公平。本文提出了一种基于最大最小公平性和比例性的多级公平优势资源调度算法。不像其他作品,他们均衡不同资源类型的主导份额,导致一些用户的分配最大化饥饿,我们的算法保证每个用户获得他们想要的基于主导份额的资源。从数学证明中可以看出,MLF-DRS充分利用了资源,满足了一些理想的公平分配特性,也适用于在多服务器存在的情况下以navïe扩展形式使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MLF-DRS: A Multi-level Fair Resource Allocation Algorithm in Heterogeneous Cloud Computing Systems
Cloud computing is a novel paradigm which provides on demand, scalable and pay-as-you-use computing resources in a virtualized form. With cloud computing, users are able to access large pools of resources anywhere without any limitation. In order to use the provided facilities by the cloud in an efficient way, the management of resources is an undeniable fact that should be considered in different aspects. Among all those aspects, resource allocation has received much attentions. Given the fact that the cloud is heterogeneous, the allocation of resources has to become more sophisticated. As a first promising work to deal with that problem, Dominant Resource Fairness (DRF) has been proposed which takes into account dominant shares of users. Although DRF has a sort of desirable fairness properties, it has some limitations that have already been identified in the literature. Unfortunately, DRF and its recent developments are not intuitively fair with respect to various resource demands. In this paper, we propose a Multi-level Fair Dominant Resource Scheduling (MLF-DRS) algorithm as a new allocation model inspired by Max-Min fairness and proportionality. Unlike other works that they equalize dominant shares of different resource types which leads to starvation in the maximization of allocation for some users, our algorithm guarantees that each user receives the resources they desire for based on dominant shares. As can be deducted from the mathematical proofs, MLF-DRS provides a full utilization of resources and meets some of the desirable fair allocation properties and it is applicable to be used in a navïe extension form in the presence of multiple servers as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信