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

Server consolidation with migration control for virtualized data centers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
128
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 264 publications
(132 citation statements)
references
References 11 publications
0
128
0
Order By: Relevance
“…The experimentation yielded the applicability of this approach to effectively determine which virtual machines should be migrated and on which physical machines to host them while minimizing operational and migration costs. In [82], authors proposed a Linear Programming formulation and heuristics to control VM migration that gives priority to the virtual machines with steady capacity. In order to draw comparison between this migration-control approaches with the well-established eager-migration-based solutions, the simulations are implemented using TU-Berlin and Google data center workloads.…”
Section: Scheduling Based On Virtualizationmentioning
confidence: 99%
“…The experimentation yielded the applicability of this approach to effectively determine which virtual machines should be migrated and on which physical machines to host them while minimizing operational and migration costs. In [82], authors proposed a Linear Programming formulation and heuristics to control VM migration that gives priority to the virtual machines with steady capacity. In order to draw comparison between this migration-control approaches with the well-established eager-migration-based solutions, the simulations are implemented using TU-Berlin and Google data center workloads.…”
Section: Scheduling Based On Virtualizationmentioning
confidence: 99%
“…The larger the I is, the longer the duration of the traffic surge. 6 In this subsection, we use the bursty workload generator (with I=100, 400, and 1000) to investigate the non-monotonic response time variations under the condition that the workload of a consolidated system is bursty. Figure 7 shows the response time of Sys_Const with the original RUBBoS workload (constant at WL=2100) consolidated with Sys_Inc which has bursty workload with various I values (also I=1, that is, the case of original RUBBoS workload).…”
Section: Bursty Workloads Increase Performance Interferencementioning
confidence: 99%
“…Thus, in the periods recognized as high workload, the VM is assigned low priority on CPU allocation by the scheduler. 6 The burstiness level of the original RUBBoS workload generator is I=1. Finally, one more result with the Limit=50% configuration (i.e, fifty-fifty CPU splitting) is shown in Figure 8, so as to show the performance interference from bursty workload on a consolidated system is unavoidable even under unsaturated CPU utilization in the disjoint CPU allocation scenario.…”
Section: Bursty Workloads Increase Performance Interferencementioning
confidence: 99%
See 1 more Smart Citation
“…There are a number of processes running in the background. These processes consume more memory and energy to reduce this utilization of memory and energy and to make system flexible there arose a concept of OFF [1]. Using these OFF concept switch off the unwanted processes which occupy the memory using Ad-hoc network in distributed environment.…”
Section: Introductionmentioning
confidence: 99%