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

Files in This Item:
File Description SizeFormat 
Li_2014_fair.pdf448.24 kBAdobe PDFDownload
Title: A Fair Comparison of VM Placement Heuristics and a More Effective Solution
Authors: Li, Xi
Ventresque, Anthony
Murphy, John
Thorburn, James
Permanent link: http://hdl.handle.net/10197/7143
Date: 27-Jun-2014
Abstract: Data 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.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Publisher: Institute of Electrical and Electronic Engineers (IEEE)
Copyright (published version): 2014 IEEE
Keywords: HeuristicBenchmarkVM placementServer consolidation
DOI: 10.1109/ISPDC.2014.8
Language: en
Status of Item: Peer reviewed
Conference Details: 13th IEEE International Symposium on Parallel and Distributed Computing (ISPDC), Aix-Marseille University - Porquerolles Golden Island, France, 24- 27 June, 2014
Appears in Collections:Computer Science Research Collection
PEL Research Collection

Show full item record

SCOPUSTM   
Citations 50

6
Last Week
0
Last month
checked on Aug 9, 2018

Download(s) 50

132
checked on May 25, 2018

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.