A Fair Comparison of VM Placement Heuristics and a More Effective Solution

DC FieldValueLanguage
dc.contributor.authorLi, Xi-
dc.contributor.authorVentresque, Anthony-
dc.contributor.authorMurphy, John-
dc.contributor.authorThorburn, James-
dc.date.accessioned2015-10-05T08:30:59Z-
dc.date.available2015-10-05T08:30:59Z-
dc.date.copyright2014 IEEEen
dc.date.issued2014-06-27-
dc.identifier.urihttp://hdl.handle.net/10197/7143-
dc.description13th IEEE International Symposium on Parallel and Distributed Computing (ISPDC), Aix-Marseille University - Porquerolles Golden Island, France, 24- 27 June, 2014en
dc.description.abstractData center optimization, mainly through virtual machine (VM) placement, has received considerable attention in the past years. A lot of heuristics have been proposed to give quick and reasonably good solutions to this problem. However it is difficult to compare them as they use different datasets, while the distribution of resources in the datasets has a big impact on the results. In this paper we propose the first benchmark for VM placement heuristics and we define a novel heuristic. Our benchmark is inspired from a real data center and explores different possible demographics of data centers, which makes it suitable when comparing the behaviour of heuristics. Our new algorithm, RBP, outperforms the state-of-the-art heuristics and provides close to optimal results quickly.en
dc.description.sponsorshipScience Foundation Irelanden
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronic Engineers (IEEE)en
dc.rights© © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en
dc.subjectHeuristicen
dc.subjectBenchmarken
dc.subjectVM placementen
dc.subjectServer consolidationen
dc.titleA Fair Comparison of VM Placement Heuristics and a More Effective Solutionen
dc.typeConference Publicationen
dc.internal.authorcontactotheranthony.ventresque@ucd.ie-
dc.statusPeer revieweden
dc.identifier.doi10.1109/ISPDC.2014.8-
dc.neeo.contributorLi|Xi|aut|-
dc.neeo.contributorVentresque|Anthony|aut|-
dc.neeo.contributorMurphy|John|aut|-
dc.neeo.contributorThorburn|James|aut|-
dc.description.othersponsorshipLeroen
dc.description.othersponsorshipEnterprise Ireland Innovation Partnershipen
dc.internal.rmsid527305463-
dc.date.updated2015-09-30T05:30:02Z-
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:Computer Science Research Collection
PEL Research Collection
Files in This Item:
File Description SizeFormat 
Li_2014_fair.pdf448.24 kBAdobe PDFDownload
Show simple item record

SCOPUSTM   
Citations 50

8
Last Week
0
Last month
checked on Sep 11, 2020

Page view(s) 50

1,532
Last Week
11
Last month
14
checked on Nov 28, 2020

Download(s) 50

272
checked on Nov 28, 2020

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.