RACC

Saurav Nanda, T. Hacker
{"title":"RACC","authors":"Saurav Nanda, T. Hacker","doi":"10.1145/3217871.3217876","DOIUrl":null,"url":null,"abstract":"Resource optimization has always been a big challenge in modern data centers. The process of performing workload consolidation on a minimal number of physical machines is becoming more complex when these data centers began supporting containers in addition to virtual machines (VMs). With the increasing usage of containers with VMs in data centers, it becomes critical to address this problem from the container's point of view - that is to optimally allocate containers in the fewest number of physical hosts. Depending on the type of application workload or tasks, infrastructure providers may provision separate containers to handle each task. These tasks may have different resource demands, such as: some of these tasks are CPU intensive, some memory intensive, some I/O intensive and some may be network intensive. Also, the physical machines in the data center are heterogeneous i.e. the hardware configuration (resource capacity) of these machines may differ from each other. Hence, the challenge is to consolidate all the active containers with different resource requirements on the minimum number of physical machines that are not even. We formulate a multi-resource bin packing problem and propose a Deep Learning technique called Fit-for-Packing to place a near-optimal number of containers on a physical machine. Experimental results show that our model achieves an average training accuracy of 82.01% and an average testing accuracy of 82.93%.","PeriodicalId":174025,"journal":{"name":"Proceedings of the First Workshop on Machine Learning for Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First Workshop on Machine Learning for Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3217871.3217876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Resource optimization has always been a big challenge in modern data centers. The process of performing workload consolidation on a minimal number of physical machines is becoming more complex when these data centers began supporting containers in addition to virtual machines (VMs). With the increasing usage of containers with VMs in data centers, it becomes critical to address this problem from the container's point of view - that is to optimally allocate containers in the fewest number of physical hosts. Depending on the type of application workload or tasks, infrastructure providers may provision separate containers to handle each task. These tasks may have different resource demands, such as: some of these tasks are CPU intensive, some memory intensive, some I/O intensive and some may be network intensive. Also, the physical machines in the data center are heterogeneous i.e. the hardware configuration (resource capacity) of these machines may differ from each other. Hence, the challenge is to consolidate all the active containers with different resource requirements on the minimum number of physical machines that are not even. We formulate a multi-resource bin packing problem and propose a Deep Learning technique called Fit-for-Packing to place a near-optimal number of containers on a physical machine. Experimental results show that our model achieves an average training accuracy of 82.01% and an average testing accuracy of 82.93%.
]
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信