On minimizing total energy consumption in the scheduling of virtual machine reservations

Wenhong Tian, Majun He, Wenxia Guo, Wenqiang Huang, Xiaoyu Shi, Mingsheng Shang, Adel Nadjaran Toosi, Rajkumar Buyya

Research output: Contribution to journalArticleResearchpeer-review

Abstract

This paper considers the energy-efficient scheduling of virtual machine (VM) reservations in a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to schedule all reservations non-preemptively, subjecting to constraints of physical machine (PM) capacities and running time interval spans, such that the total energy consumption of all PMs is minimized (called MinTEC for abbreviation). The MinTEC problem is NP-complete in general. The best known results for this problem is a 5-approximation algorithm for special instances using First-Fit-Decreasing algorithm and 3-approximation algorithm for general offline parallel machine scheduling with unit demand. By combining the features of optimality and workload in interval spans, we propose a method to find the optimal solution with the minimum number of job migrations, and a 2-approximation algorithm called LLIF for general cases. We then show how our algorithms are applied to minimize the total energy consumption in a Cloud Data center. Our theoretical results are validated by intensive simulation using trace-driven and synthetically generated data.

Original languageEnglish
Pages (from-to)64-74
Number of pages11
JournalJournal of Network and Computer Applications
Volume113
DOIs
Publication statusPublished - 1 Jul 2018
Externally publishedYes

Keywords

  • Cloud Data centers
  • Energy efficiency
  • Resource scheduling
  • Virtual machine reservation

Cite this

Tian, Wenhong ; He, Majun ; Guo, Wenxia ; Huang, Wenqiang ; Shi, Xiaoyu ; Shang, Mingsheng ; Toosi, Adel Nadjaran ; Buyya, Rajkumar. / On minimizing total energy consumption in the scheduling of virtual machine reservations. In: Journal of Network and Computer Applications. 2018 ; Vol. 113. pp. 64-74.
@article{cdbd227f417a4349b0318f0924ccf48a,
title = "On minimizing total energy consumption in the scheduling of virtual machine reservations",
abstract = "This paper considers the energy-efficient scheduling of virtual machine (VM) reservations in a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to schedule all reservations non-preemptively, subjecting to constraints of physical machine (PM) capacities and running time interval spans, such that the total energy consumption of all PMs is minimized (called MinTEC for abbreviation). The MinTEC problem is NP-complete in general. The best known results for this problem is a 5-approximation algorithm for special instances using First-Fit-Decreasing algorithm and 3-approximation algorithm for general offline parallel machine scheduling with unit demand. By combining the features of optimality and workload in interval spans, we propose a method to find the optimal solution with the minimum number of job migrations, and a 2-approximation algorithm called LLIF for general cases. We then show how our algorithms are applied to minimize the total energy consumption in a Cloud Data center. Our theoretical results are validated by intensive simulation using trace-driven and synthetically generated data.",
keywords = "Cloud Data centers, Energy efficiency, Resource scheduling, Virtual machine reservation",
author = "Wenhong Tian and Majun He and Wenxia Guo and Wenqiang Huang and Xiaoyu Shi and Mingsheng Shang and Toosi, {Adel Nadjaran} and Rajkumar Buyya",
year = "2018",
month = "7",
day = "1",
doi = "10.1016/j.jnca.2018.03.033",
language = "English",
volume = "113",
pages = "64--74",
journal = "Journal of Network and Computer Applications",
issn = "1084-8045",
publisher = "Elsevier",

}

On minimizing total energy consumption in the scheduling of virtual machine reservations. / Tian, Wenhong; He, Majun; Guo, Wenxia; Huang, Wenqiang; Shi, Xiaoyu; Shang, Mingsheng; Toosi, Adel Nadjaran; Buyya, Rajkumar.

In: Journal of Network and Computer Applications, Vol. 113, 01.07.2018, p. 64-74.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - On minimizing total energy consumption in the scheduling of virtual machine reservations

AU - Tian, Wenhong

AU - He, Majun

AU - Guo, Wenxia

AU - Huang, Wenqiang

AU - Shi, Xiaoyu

AU - Shang, Mingsheng

AU - Toosi, Adel Nadjaran

AU - Buyya, Rajkumar

PY - 2018/7/1

Y1 - 2018/7/1

N2 - This paper considers the energy-efficient scheduling of virtual machine (VM) reservations in a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to schedule all reservations non-preemptively, subjecting to constraints of physical machine (PM) capacities and running time interval spans, such that the total energy consumption of all PMs is minimized (called MinTEC for abbreviation). The MinTEC problem is NP-complete in general. The best known results for this problem is a 5-approximation algorithm for special instances using First-Fit-Decreasing algorithm and 3-approximation algorithm for general offline parallel machine scheduling with unit demand. By combining the features of optimality and workload in interval spans, we propose a method to find the optimal solution with the minimum number of job migrations, and a 2-approximation algorithm called LLIF for general cases. We then show how our algorithms are applied to minimize the total energy consumption in a Cloud Data center. Our theoretical results are validated by intensive simulation using trace-driven and synthetically generated data.

AB - This paper considers the energy-efficient scheduling of virtual machine (VM) reservations in a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to schedule all reservations non-preemptively, subjecting to constraints of physical machine (PM) capacities and running time interval spans, such that the total energy consumption of all PMs is minimized (called MinTEC for abbreviation). The MinTEC problem is NP-complete in general. The best known results for this problem is a 5-approximation algorithm for special instances using First-Fit-Decreasing algorithm and 3-approximation algorithm for general offline parallel machine scheduling with unit demand. By combining the features of optimality and workload in interval spans, we propose a method to find the optimal solution with the minimum number of job migrations, and a 2-approximation algorithm called LLIF for general cases. We then show how our algorithms are applied to minimize the total energy consumption in a Cloud Data center. Our theoretical results are validated by intensive simulation using trace-driven and synthetically generated data.

KW - Cloud Data centers

KW - Energy efficiency

KW - Resource scheduling

KW - Virtual machine reservation

UR - http://www.scopus.com/inward/record.url?scp=85045450346&partnerID=8YFLogxK

U2 - 10.1016/j.jnca.2018.03.033

DO - 10.1016/j.jnca.2018.03.033

M3 - Article

VL - 113

SP - 64

EP - 74

JO - Journal of Network and Computer Applications

JF - Journal of Network and Computer Applications

SN - 1084-8045

ER -