The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centers
Abstract
SUMMARY: The rapid growth in demand for computational power driven by modern service applications combined with the shift to the Cloud computing model have led to the establishment of large‐scale virtualized data centers. Such data centers consume enormous amounts of electrical energy resulting in high operating costs and carbon dioxide emissions. Dynamic consolidation of virtual machines (VMs) using live migration and switching idle nodes to the sleep mode allows Cloud providers to optimize resource usage and reduce energy consumption. However, the obligation of providing high quality of service to customers leads to the necessity in dealing with the energy‐performance trade‐off, as aggressive consolidation may lead to performance degradation. Because of the variability of workloads experienced by modern applications, the VM placement should be optimized continuously in an online manner. To understand the implications of the online nature of the problem, we conduct a competitive analysis and prove competitive ratios of optimal online deterministic algorithms for the single VM migration and dynamic VM consolidation problems. Furthermore, we propose novel adaptive heuristics for dynamic consolidation of VMs based on an analysis of historical data from the resource usage by VMs. The proposed algorithms significantly reduce energy consumption, while ensuring a high level of adherence to the service level agreement. We validate the high efficiency of the proposed algorithms by extensive simulations using real‐world workload traces from more than a thousand PlanetLab VMs. Copyright © 2011 John Wiley & Sons, Ltd.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Robust Locally Weighted Regression and Smoothing Scatterplots
Cleveland, W. S. (1979) · Journal of the American Statistical Association · doi:10.1080/01621459.1979.10481038 · Cited by 11,594
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Buyya, R., Yeo, C. S., Venugopal, S., Broberg, J., & Brandic, I. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.12.001 · Cited by 5,937
Self-citationXen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., & Warfield, A. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945462 · Cited by 5,915
Calheiros, R. N., Ranjan, R., Beloglazov, A., De Rose, C. A. F., & Buyya, R. (2011) · Software: Practice and Experience · doi:10.1002/spe.995 · Cited by 4,948
Self-citationBeloglazov, A., Abawajy, J., & Buyya, R. (2012) · Future Generation Computer Systems · doi:10.1016/j.future.2011.04.017 · Cited by 2,761
Self-citationLive migration of virtual machines
Clark, C. J., Fraser, K. A., Hand, S., Hansen, J. G., Jul, E., Limpach, C., Pratt, I., & Warfield, A. (2005) · doi:10.5555/1251203.1251223 · Cited by 2,562
The Case for Energy-Proportional Computing
Barroso, L. A., & Hölzle, U. (2007) · Computer · doi:10.1109/mc.2007.443 · Cited by 2,491
Online Computation and Competitive Analysis
Borodin, A., & El‐Yaniv, R. (1998) · Cited by 2,333
Power provisioning for a warehouse-sized computer
Fan, X., Weber, W.-D., & Barroso, L. A. (2007) · Proceedings of the 34th annual international symposium on Computer architecture · doi:10.1145/1250662.1250665 · Cited by 1,797
Cleveland, W. S. (1993) · Cited by 1,698
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/277851.277897 · Cited by 1,431
Encyclopedia of measurement and statistics
(2007) · Choice Reviews Online · doi:10.5860/choice.44-4214 · Cited by 1,385
Kendall, M. G., & Ord, J. K. (1973) · Cited by 1,356
PowerNap: eliminating server idle power
Meisner, D., Gold, B. T., & Wenisch, T. F. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508269 · Cited by 901
Energy aware consolidation for cloud computing
Srikantaiah, S., Kansal, A., & Zhao, F. (2008) · Cited by 784
Power and performance management of virtualized computing environments via lookahead control
Kusic, D., Kephart, J. O., Hanson, J. E., Kandasamy, N., & Jiang, G. (2009) · Cluster Computing · doi:10.1007/s10586-008-0070-y · Cited by 699
pMapper: Power and Migration Cost Aware Application Placement in Virtualized Systems
Verma, A., Ahuja, P., & Neogi, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89856-6_13 · Cited by 649
VirtualPower: coordinated power management in virtualized enterprise systems
Nathuji, R., & Schwan, K. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294287 · Cited by 606
CoMon: a mostly-scalable monitoring system for PlanetLab
Park, K., & Pai, V. S. (2006) · ACM SIGOPS Operating Systems Review · doi:10.1145/1113361.1113374 · Cited by 585
Cost of Virtual Machine Live Migration in Clouds: A Performance Evaluation
Voorsluys, W., Broberg, J., & Venugopal, S. (2010) · Cited by 485
Optimal power allocation in server farms
Gandhi, A., Harchol-Balter, M., Das, R., & Lefurgy, C. (2009) · Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems · doi:10.1145/1555349.1555368 · Cited by 457
Smoothing by Local Regression: Principles and Methods
Cleveland, W. S., & Loader, C. (1996) · Contributions to Statistics · doi:10.1007/978-3-642-48425-4_2 · Cited by 456
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/277858.277897 · Cited by 442
Beloglazov, A., & Buyya, R. (2010) · Proceedings of the 8th International Workshop on Middleware for Grids, Clouds and e-Science · doi:10.1145/1890799.1890803 · Cited by 413
Self-citationServer workload analysis for power minimization using consolidation
Verma, A., Dasgupta, G., Nayak, T. K., De, P., & Kothari, R. (2009) · Cited by 381
Ensemble-level Power Management for Dense Blade Servers
Ranganathan, P., Leech, P., Irwin, D., & Chase, J. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136492 · Cited by 357
Towards energy-aware scheduling in data centers using machine learning
Berral, J. L., Goiri, Í., Nou, R., Julià, F., Guitart, J., Gavaldà, R., & Torres, J. (2010) · Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking · doi:10.1145/1791314.1791349 · Cited by 262 · cited 2×
“Berral et al [27] have studied the problem of dynamic consolidation of VMs running applications with deadlines that are set in the SLAs.”
BackgroundOn the power of randomization in on-line algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1994) · Algorithmica · doi:10.1007/bf01294260 · Cited by 262
Shares and utilities based power consolidation in virtualized server environments
Cardosa, M., Korupolu, M. R., & Singh, A. (2009) · 2009 IFIP/IEEE International Symposium on Integrated Network Management · doi:10.1109/inm.2009.5188832 · Cited by 262
Ensemble-level Power Management for Dense Blade Servers
Ranganathan, P., Leech, P., Irwin, D., & Chase, J. S. (2006) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2006.20 · Cited by 242
Nathuji, R., & Schwan, K. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294287 · Cited by 221
On the power of randomization in online algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100268 · Cited by 174
Meisner, D., Gold, B. T., & Wenisch, T. F. (2009) · ACM SIGPLAN Notices · doi:10.1145/1508284.1508269 · Cited by 171
A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm
Yue, M. (1991) · Acta Mathematicae Applicatae Sinica English Series · doi:10.1007/bf02009683 · Cited by 155
Minas, L., & Ellison, B. (2009) · Intel Press eBooks · Cited by 140
Workload Modeling for Performance Evaluation
Feitelson, D. G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45798-4_6 · Cited by 137
A Cost-Sensitive Adaptation Engine for Server Consolidation of Multitier Applications
Jung, G., Joshi, K. R., Hiltunen, M. A., Schlichting, R. D., & Pu, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10445-9_9 · Cited by 120
Kumar, S., Talwar, V., Kumar, V., Ranganathan, P., & Schwan, K. (2009) · International Conference on Autonomic Computing · doi:10.1145/1555228.1555262 · Cited by 120
Parallel Computer Workload Modeling with Markov Chains
Song, B., Ernemann, C., & Yahyapour, R. (2005) · Lecture notes in computer science · doi:10.1007/11407522_3 · Cited by 66
Multiple Correlation Coefficient
Nijsse, M. (2008) · Springer eBooks · doi:10.1007/978-0-387-32833-1_275 · Cited by 63
Workload dynamics on clusters and grids
Li, H. (2008) · The Journal of Supercomputing · doi:10.1007/s11227-008-0189-x · Cited by 56
Cited by
Energy efficiency in cloud computing data centers: a survey on software technologies
Katal, A., Dahiya, S., & Choudhury, T. (2023) · Cluster Computing · doi:10.1007/s10586-022-03713-0 · Cited by 516
“The metric for SLA is calculated as the fraction of the difference among the allocated and the requested CPU for each VM [43].”
From Cloud to Fog Computing: A Review and a Conceptual Live VM Migration Framework
Osanaiye, O., Chen, S., Yan, Z., Lu, R., Choo, K.-K. R., & Dlodlo, M. (2017) · IEEE Access · doi:10.1109/access.2017.2692960 · Cited by 320
Tuli, S., Ilager, S., Ramamohanarao, K., & Buyya, R. (2022) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.3017079 · Cited by 257
Self-citationEnergy-aware Virtual Machine Migration for Cloud Computing - A Firefly Optimization Approach
Kansal, N. J., & Chana, I. (2016) · Journal of Grid Computing · doi:10.1007/s10723-016-9364-0 · Cited by 151
A Survey of Virtual Machine Placement Techniques in a Cloud Data Center
Usmani, Z., & Singh, S. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.02.093 · Cited by 142
Metadata
- Authors
- Beloglazov, A., & Buyya, R.
- Venue
- Concurrency and Computation: Practice and Experience
- Publisher
- Wiley
- Published
- 2011-10-07
- Volume
- 24
- Issue
- 13
- Pages
- 1397-1420
- ISSN
- 1532-0626 (ISSN-L)
- 1532-0634
- OpenAlex
- W2110374615
- Cited by
- 1,864
- References
- 42
- FWCI
- 178.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.