Dynamic Placement of Virtual Machines for Managing SLA Violations
Top Cited Papers
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15730077,p. 119-128
Abstract
A dynamic server migration and consolidation algorithm is introduced. The algorithm is shown to provide substantial improvement over static server consolidation in reducing the amount of required capacity and the rate of service level agreement violations. Benefits accrue for workloads that are variable and can be forecast over intervals shorter than the time scale of demand variability. The management algorithm reduces the amount of physical capacity required to support a specified rate of SLA violations for a given workload by as much as 50% as compared to static consolidation approach. Another result is that the rate of SLA violations at fixed capacity may be reduced by up to 20%. The results are based on hundreds of production workload traces across a variety of operating systems, applications, and industries.Keywords
This publication has 17 references indexed in Scilit:
- Minimizing migrations in fair multiprocessor scheduling of persistent tasksJournal of Scheduling, 2006
- Performance management for cluster-based web servicesIEEE Journal on Selected Areas in Communications, 2005
- Virtual Machine Technology: A Bridge From Large Mainframes To Networks Of Small Computers2005
- Dynamic Application Placement Under Service and Memory Constraints2005
- Statistical service assurances for applications in utility grid environmentsPerformance Evaluation, 2004
- Stochastic load balancing and related problems2003
- Optimizing the migration of virtual computers2002
- Cellular DiscoACM SIGOPS Operating Systems Review, 1999
- System/370 Extended Architecture: Facilities for Virtual MachinesIBM Journal of Research and Development, 1983
- The Origin of the VM/370 Time-Sharing SystemIBM Journal of Research and Development, 1981