2015
DOI: 10.1016/j.future.2015.04.004
|View full text |Cite
|
Sign up to set email alerts
|

Rigorous results on the effectiveness of some heuristics for the consolidation of virtual machines in a cloud data center

Abstract: Dynamic consolidation of virtual machines (VMs) in a cloud data center can be used to minimize power consumption. Beloglazov et al. have proposed the MM (Minimization of Migrations) heuristic for selecting the VMs to migrate from under-or over-utilized hosts, as well as the MBFD (Modified Best Fit Decreasing) heuristic for deciding the placement of the migrated VMs. According to their simulation results, these heuristics work very well in practice. In this paper, we investigate what performance guarantees can … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 30 publications
(18 citation statements)
references
References 24 publications
0
18
0
Order By: Relevance
“…Although a great deal of research has been done on applying server consolidation technique to achieve energy efficiency in most of these researches the VMs are assumed to be independent of each other. [125][126][127] If a distributed policy is used for satisfying some of the requests (on several different VMs), the assumption of VMs' independence in consolidation process may degrade performance. In recent years, handling this challenge has been noted by some researchers.…”
Section: Hybrid Server Consolidation Techniquesmentioning
confidence: 99%
“…Although a great deal of research has been done on applying server consolidation technique to achieve energy efficiency in most of these researches the VMs are assumed to be independent of each other. [125][126][127] If a distributed policy is used for satisfying some of the requests (on several different VMs), the assumption of VMs' independence in consolidation process may degrade performance. In recent years, handling this challenge has been noted by some researchers.…”
Section: Hybrid Server Consolidation Techniquesmentioning
confidence: 99%
“…Indeed, the usage of FF has been suggested [15], just like BF [9], WF [51,65,95], FFD [99,101] and BFD [7,6,42]. It should be noted though that the approximation results concerning these algorithms on bin packing do not automatically carry over to the more complicated VM placement problem [68].…”
Section: Heuristics For the Single-dc Problemmentioning
confidence: 99%
“…For some restricted problem versions, polynomial-time approximation algorithms have been presented with rigorously proven approximation guarantees [1,2,18,68].…”
Section: Rigorous Analysismentioning
confidence: 99%
“…One of our aims was to investigate to what extent approximation algorithms are possible for VM allocation. In [148], we gave formal proofs that some of the previously proposed heuristics are actually approximation algorithms for some important sub problems, like the optimal selection of VMs to migrate from an overloaded host.…”
Section: Algorithmic Approachesmentioning
confidence: 99%