A Fair Comparison of VM Placement Heuristics and a More Effective Solution
|Title:||A Fair Comparison of VM Placement Heuristics and a More Effective Solution||Authors:||Li, Xi
|Permanent link:||http://hdl.handle.net/10197/7143||Date:||27-Jun-2014||Online since:||2015-10-05T08:30:59Z||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:||Heuristic; Benchmark; VM placement; Server 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
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.