Which is the best algorithm for virtual machine placement optimization?. (21st March 2017)

• Record Type: Journal Article
• Authors: Mann, Zoltán Ádám; Szabó, Máté
• Is Part Of: Concurrency and computation. Volume 29:Number 10(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-03-21
• Subjects: cloud computing -- data center -- Infrastructure‐as‐a‐Service -- virtual machines -- VM consolidation -- VM placement; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4083
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: One of the key problems for Infrastructure‐as‐a‐Service providers is finding the optimal allocation of virtual machines on the physical machines available in the provider's data center. Since the allocation has significant impact on operational costs as well as on the performance of the accommodated applications, several algorithms have been proposed for the virtual machine placement problem. So far, no objective comparison of the proposed algorithms has been provided; therefore, it is not known which one works best or what factors influence the performance of the algorithms. In this paper, we present an environment and methodology for such comparisons and compare 7 different algorithms using the proposed environment and methodology. Our results showcase differences of up to 66% between the effectiveness of different algorithms on the same real‐world workload traces, thus underlining the importance of objectively comparing the performance of competing algorithms.