虚拟机位置。多目标方法

Fabio Lopez Pires, Elias Melgarejo, B. Barán
{"title":"虚拟机位置。多目标方法","authors":"Fabio Lopez Pires, Elias Melgarejo, B. Barán","doi":"10.1109/CLEI.2013.6670671","DOIUrl":null,"url":null,"abstract":"The process of selecting which virtual machines will be placed (i.e. executed) in the physical machines available in a Datacenter is known as virtual machine placement problem. This work proposes for the first time a formulation of the problem, with a multi-objective approach, of the main objective functions studied so far as mono-objective in the state of the art. Also it is proposed a multi-objective memetic algorithm for solving the proposed problem. The validity of the proposed formulation is checked by comparing experimental results of the proposed algorithm with a brute force algorithm. Finally it is experimentally verified the scalability of the used meta-heuristic.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Virtual machine placement. A multi-objective approach\",\"authors\":\"Fabio Lopez Pires, Elias Melgarejo, B. Barán\",\"doi\":\"10.1109/CLEI.2013.6670671\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The process of selecting which virtual machines will be placed (i.e. executed) in the physical machines available in a Datacenter is known as virtual machine placement problem. This work proposes for the first time a formulation of the problem, with a multi-objective approach, of the main objective functions studied so far as mono-objective in the state of the art. Also it is proposed a multi-objective memetic algorithm for solving the proposed problem. The validity of the proposed formulation is checked by comparing experimental results of the proposed algorithm with a brute force algorithm. Finally it is experimentally verified the scalability of the used meta-heuristic.\",\"PeriodicalId\":184399,\"journal\":{\"name\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"volume\":\"358 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2013.6670671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 XXXIX Latin American Computing Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2013.6670671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

选择将哪些虚拟机放置(即执行)在数据中心可用的物理机中的过程称为虚拟机放置问题。这项工作首次提出了一个问题的表述,用多目标方法,研究了目前为止单目标的主要目标函数。并提出了一种多目标模因算法来求解该问题。通过将该算法的实验结果与蛮力算法的实验结果进行比较,验证了该算法的有效性。最后通过实验验证了所采用的元启发式算法的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Virtual machine placement. A multi-objective approach
The process of selecting which virtual machines will be placed (i.e. executed) in the physical machines available in a Datacenter is known as virtual machine placement problem. This work proposes for the first time a formulation of the problem, with a multi-objective approach, of the main objective functions studied so far as mono-objective in the state of the art. Also it is proposed a multi-objective memetic algorithm for solving the proposed problem. The validity of the proposed formulation is checked by comparing experimental results of the proposed algorithm with a brute force algorithm. Finally it is experimentally verified the scalability of the used meta-heuristic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信