Cake cutting of CPU resources among multiple HPC agents on a cloud

Kausal Malladi, Debargha Ganguly
{"title":"Cake cutting of CPU resources among multiple HPC agents on a cloud","authors":"Kausal Malladi, Debargha Ganguly","doi":"10.1109/ICRTIT.2013.6844172","DOIUrl":null,"url":null,"abstract":"“You cut, I choose” is a classical algorithm for fair sharing of resources among two agents which guarantees “envy-freeness”. In a multi-agent scenario, several algorithms were proposed for sharing resources fairly on a Cloud. However, no algorithm has been proposed till now for High Performance Computing (HPC) agents which are computational intensive, where not just the resources are to be fair-shared but used to the utmost. This paper proposes an algorithm that considers a specific number of HPC agents that can be run on a host machine and tries to do a fair-share of resources. The proposed algorithm assumes the agents demanding resources to be taking a game-theoretic approach and gives a decent proportion of the demand as the allocation value. This algorithm works for a real-world scenario in which, the agents keep getting added dynamically to a host machine and assumes that the agents will not depart after they are allocated.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

“You cut, I choose” is a classical algorithm for fair sharing of resources among two agents which guarantees “envy-freeness”. In a multi-agent scenario, several algorithms were proposed for sharing resources fairly on a Cloud. However, no algorithm has been proposed till now for High Performance Computing (HPC) agents which are computational intensive, where not just the resources are to be fair-shared but used to the utmost. This paper proposes an algorithm that considers a specific number of HPC agents that can be run on a host machine and tries to do a fair-share of resources. The proposed algorithm assumes the agents demanding resources to be taking a game-theoretic approach and gives a decent proportion of the demand as the allocation value. This algorithm works for a real-world scenario in which, the agents keep getting added dynamically to a host machine and assumes that the agents will not depart after they are allocated.
云上多个HPC代理之间的CPU资源分割
“你切,我选”是两个智能体公平共享资源的经典算法,保证了“无嫉妒”。在多智能体场景下,提出了几种在云上公平共享资源的算法。然而,目前还没有针对计算密集型的高性能计算(HPC)代理的算法,这些代理不仅需要公平共享资源,而且需要最大限度地利用资源。本文提出了一种算法,该算法考虑了可以在主机上运行的特定数量的HPC代理,并试图公平地共享资源。该算法假设需求资源的代理采用博弈论方法,并给出需求的适当比例作为分配值。该算法适用于一个真实世界的场景,在这个场景中,代理不断被动态地添加到主机上,并假设代理在分配后不会离开。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信