2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing 2015
DOI: 10.1109/ccgrid.2015.15
|View full text |Cite
|
Sign up to set email alerts
|

A Virtual Machine Placement Taxonomy

Abstract: Cloud computing datacenters dynamically provide millions of virtual machines (VMs) in actual cloud markets. In this context, Virtual Machine Placement (VMP) is one of the most challenging problems in cloud infrastructure management, considering the large number of possible optimization criteria and different formulations that could be studied. VMP literature include relevant research topics such as energy efficiency, Service Level Agreement (SLA), Quality of Service (QoS), cloud service pricing schemes and car… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 84 publications
(52 citation statements)
references
References 45 publications
(63 reference statements)
0
48
0
Order By: Relevance
“…The algorithm used by the operator for re‐optimizing the placement of VMs has large impact on multiple vital metrics: Energy consumption. A good VM placement optimization algorithm achieves low overall DC energy consumption, mainly by consolidating the VMs to as few PMs as possible (without violating performance objectives, see below).…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm used by the operator for re‐optimizing the placement of VMs has large impact on multiple vital metrics: Energy consumption. A good VM placement optimization algorithm achieves low overall DC energy consumption, mainly by consolidating the VMs to as few PMs as possible (without violating performance objectives, see below).…”
Section: Introductionmentioning
confidence: 99%
“…The benefit of the AOF approach is that it reduces complexity and often improves runtime of the algorithm by limiting the search to a subspace of the feasible solutions. However, the drawback is that a correct combination of the objectives requires certain weights to be assigned to each objective, which often requires an in-depth knowledge of the problem domain [46]. Therefore, the assignment of the weights is essentially subjective [24].…”
Section: Rq3: Objectivesmentioning
confidence: 99%
“…Over the past few years, researchers have used a multitude of ways to develop novel VM consolidation approaches [3,[5][6][7][8][9][10][11][12][13][14][15]. Some of these approaches have also been reported in recent literature reviews [16,17].…”
Section: Introductionmentioning
confidence: 99%
“…The benefit of the AOF approach is that it reduces complexity and may improve the runtime of the algorithm by limiting the search to a subspace of the feasible solutions. However, the main drawback is that a correct combination of the objectives requires certain weights to be assigned to each objective, which often requires an in-depth knowledge of the problem domain [17]. Therefore, the assignment of the weights is essentially subjective [24].…”
Section: Introductionmentioning
confidence: 99%