Proceedings of the 40th Annual International Symposium on Computer Architecture 2013
DOI: 10.1145/2485922.2485931
|View full text |Cite
|
Sign up to set email alerts
|

Agile, efficient virtualization power management with low-latency server power states

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
15
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(17 citation statements)
references
References 31 publications
2
15
0
Order By: Relevance
“…In the case of ERWS, the lower panel of Figure 1 clearly shows that the optimal value of k may lie elsewhere. In line with the findings in [10] suspend gives the best ERP and ERWS amongst the sleep options. This is because setup delay from the suspend sleep state is significantly lower while the power consumption is still kept reasonably low.…”
Section: Numerical Resultssupporting
confidence: 83%
See 1 more Smart Citation
“…In the case of ERWS, the lower panel of Figure 1 clearly shows that the optimal value of k may lie elsewhere. In line with the findings in [10] suspend gives the best ERP and ERWS amongst the sleep options. This is because setup delay from the suspend sleep state is significantly lower while the power consumption is still kept reasonably low.…”
Section: Numerical Resultssupporting
confidence: 83%
“…Moreover, mean setup delays of 100 s, 50 s and 10 s will be used for the off, hibernate and suspend states, respectively. All values are taken from experimental measurements performed in [7,10] while the service times obey an exponential distribution, where the mean is exaggerated to E[S] = 1 s for illustration. Weighting factors of w1 = 1 and w2 = 0.75 are used for all the ERWS plots.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Sleep power for all nodes is calculated as a fixed percentage of static power for each node type, assumed to be 16% based on a recent study of node power states [19]. The average node utilization factor used during FDLD allocations, φ E , is set as Algorithm 2 Pseudo-code for GALD-CL heuristic 1. create an initial population of chromosomes 2. while within time limit do 3. perform selection, crossover and mutation to create new chromosomes 4. for each new chromosome, evaluate: 5.…”
Section: A Experimental Setupmentioning
confidence: 99%
“…modify chromosome, return to step 5 18. trim population (with elitism) 19. end while 20. take final allocation from the best chromosome 21. calculate final execution rates (CERi(τ ), ∀i ∈ I, ∀τ ∈ N τ ) 22. calculate final cost from sum of power costs and allocation costs (P C d (τ ) and AC d (τ ), ∀d ∈ D, ∀τ ∈ N τ ) Each of five task types is representative of a different benchmark from the PARSEC benchmark suite.…”
Section: A Experimental Setupmentioning
confidence: 99%
“…DVFS), system-wide approaches that reduce servers' idle powers [13], per-core power gating [14], consolidation of servers during low workload periods (e.g. [15]), virtualization techniques to obtain energy savings [16], [17] or the use of low-latency power state changes in servers to improve the impact of virtualization [18]. To complement these, there are many contributions that focus on the characterization of workloads in DCs, such as [19].…”
Section: Related Workmentioning
confidence: 99%