Poster Abstract: Parallel VM Placement with Provable Guarantees

Itamar Cohen, Gil Einziger, M. Goldstein, Yaniv Sa'ar, Gabriel Scalosub, Erez Waisbard
{"title":"Poster Abstract: Parallel VM Placement with Provable Guarantees","authors":"Itamar Cohen, Gil Einziger, M. Goldstein, Yaniv Sa'ar, Gabriel Scalosub, Erez Waisbard","doi":"10.1109/infocomwkshps50562.2020.9162912","DOIUrl":null,"url":null,"abstract":"Efficient on-demand deployment of VMs is at the core of cloud infrastructure but the existing resource management approaches are too slow to fulfill this promise. Parallel resource management is a promising direction for boosting performance, but when applied naïvely, it significantly increases the communication overhead and the decline ratio of deployment attempts. We propose a new dynamic and randomized algorithm, APSR, for parallel assignment of VMs to hosts in a cloud environment. APSR is guaranteed to satisfy an SLA containing decline ratio constraints, and communication overheads constraints. Furthermore, via extensive simulations, we show that APSR obtains a higher throughput than other commonly employed policies (including those used in OpenStack) while achieving a reduction of up to 13x in decline ratio and a reduction of over 85% in communication overheads.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/infocomwkshps50562.2020.9162912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Efficient on-demand deployment of VMs is at the core of cloud infrastructure but the existing resource management approaches are too slow to fulfill this promise. Parallel resource management is a promising direction for boosting performance, but when applied naïvely, it significantly increases the communication overhead and the decline ratio of deployment attempts. We propose a new dynamic and randomized algorithm, APSR, for parallel assignment of VMs to hosts in a cloud environment. APSR is guaranteed to satisfy an SLA containing decline ratio constraints, and communication overheads constraints. Furthermore, via extensive simulations, we show that APSR obtains a higher throughput than other commonly employed policies (including those used in OpenStack) while achieving a reduction of up to 13x in decline ratio and a reduction of over 85% in communication overheads.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
摘要:具有可证明保证的并行VM放置
高效的按需部署vm是云基础设施的核心,但现有的资源管理方法太慢,无法实现这一承诺。并行资源管理是提高性能的一个很有前途的方向,但是当应用naïvely时,它会显著增加通信开销和部署尝试的下降率。本文提出了一种新的动态随机算法APSR,用于云环境中虚拟机到主机的并行分配。APSR保证满足包含下降率约束和通信开销约束的SLA。此外,通过广泛的模拟,我们表明APSR比其他常用策略(包括OpenStack中使用的策略)获得更高的吞吐量,同时实现下降率降低高达13倍,通信开销降低超过85%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Framework for Bandwidth and Latency Guaranteed Service in New IP Network Energy Minimization for MEC-enabled Cellular-Connected UAV: Trajectory Optimization and Resource Scheduling A Multi-property Method to Evaluate Trust of Edge Computing Based on Data Driven Capsule Network Real Time Adaptive Networking using Programmable 100Gbps NIC on Data Transfer Nodes IRS Assisted Multiple User Detection for Uplink URLLC Non-Orthogonal Multiple Access
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1