A static VM placement and hybrid job scheduling model for green data centers
Open Access
- 13 August 2020
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (8) , e0237238
Abstract
Reducing energy consumption has become a critical issue in today data centers. Reducing the number of required physical and Virtual Machines results in energy-efficiency. In this paper, to avoid the disadvantages of VM migration, a static VM placement algorithm is proposed which places VMs on hosts in a Worst-Fit-Decreasing (WFD) fashion. To reduce energy consumption further, the effect of job scheduling policy on the number of VMs needed for maintaining QoS requirements is studied. Each VM is modeled by an M/M/* queue in space-shared, time-shared, and hybrid job scheduling policies, and energy consumption of real-time as well as non-real-time applications is analyzed. Numerical results show that the hybrid policy outperforms space-shared and time-shared policies, in terms of energy consumption as well as Service Level Agreement (SLA) violations. Moreover, our non-migration method outperforms three different algorithms which use VM migration, in terms of reducing both energy consumption and SLA Violations.Keywords
This publication has 37 references indexed in Scilit:
- Using matrix approximation for high-dimensional discrete optimization problems: Server consolidation based on cyclic time-series dataEuropean Journal of Operational Research, 2012
- Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centersConcurrency and Computation: Practice and Experience, 2011
- Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centersJournal of Parallel and Distributed Computing, 2011
- CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithmsSoftware: Practice and Experience, 2010
- The cost of a cloudACM SIGCOMM Computer Communication Review, 2008
- Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a surveyConcurrency and Computation: Practice and Experience, 2005
- On measuring fairness in queuesAdvances in Applied Probability, 2004
- Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfillingIEEE Transactions on Parallel and Distributed Systems, 2001
- Waiting time distributions for M/M/N processor sharing queuesCommunications in Statistics. Stochastic Models, 1994
- Waiting Time Distributions for Processor-Sharing SystemsJournal of the ACM, 1970