Application-Aware Virtual Machine Placement in Data Centers

Fei Song, Daochao Huang, Huachun Zhou, I. You
{"title":"Application-Aware Virtual Machine Placement in Data Centers","authors":"Fei Song, Daochao Huang, Huachun Zhou, I. You","doi":"10.1109/IMIS.2012.119","DOIUrl":null,"url":null,"abstract":"Based on the convex optimization theory, the energy-efficient and scalability problems of modern data centers are studied. Then a novel application-aware virtual machine (VM) placement algorithm is proposed to cope with these problems. Firstly, the definition of VM placement fairness and utility function are given, and the basic algorithm of VM placement which fulfills server constraints of physical machines is con-ducted. Secondly, we formulate the VM placement as an optimization problem. A two-tier algorithm that efficiently solves the VM placement problem in large scale was designed. Comparing to existing methods, we illustrate the performance improvement such as reducing the number of physical machines efficiently, decreasing communication distance between VMs, improving energy-efficient and scalability of data centers.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMIS.2012.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Based on the convex optimization theory, the energy-efficient and scalability problems of modern data centers are studied. Then a novel application-aware virtual machine (VM) placement algorithm is proposed to cope with these problems. Firstly, the definition of VM placement fairness and utility function are given, and the basic algorithm of VM placement which fulfills server constraints of physical machines is con-ducted. Secondly, we formulate the VM placement as an optimization problem. A two-tier algorithm that efficiently solves the VM placement problem in large scale was designed. Comparing to existing methods, we illustrate the performance improvement such as reducing the number of physical machines efficiently, decreasing communication distance between VMs, improving energy-efficient and scalability of data centers.
数据中心中应用感知的虚拟机布局
基于凸优化理论,研究了现代数据中心的节能和可扩展性问题。针对这些问题,提出了一种新的应用感知虚拟机(VM)布局算法。首先,给出了虚拟机放置公平性和效用函数的定义,给出了满足物理机服务器约束的虚拟机放置的基本算法;其次,我们将虚拟机放置表述为一个优化问题。设计了一种有效解决大规模虚拟机放置问题的两层算法。通过与现有方法的比较,说明了该方法在有效减少物理机数量、缩短虚拟机之间的通信距离、提高数据中心的能效和可扩展性等方面的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信