Journal article

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

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS | ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD | Published : 2018

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 ..

View full abstract

Grants

Awarded by National Natural Science Foundation of China (NSFC)


Awarded by Science and Technology Plan of Sichuan Province


Awarded by Xi Bu Zhi Guang Plan of Chinese Academy of Science


Funding Acknowledgements

This research is sponsored by the National Natural Science Foundation of China (NSFC) (Grand Number: 61672136, 61650110513, 61602434), Science and Technology Plan of Sichuan Province (2016GZ0322), Xi Bu Zhi Guang Plan of Chinese Academy of Science (R51A150Z10). The problem statement as presented in Section 2.2 is also discussed in our earlier paper (Tian and Yeo, 2015) although solutions provided in this paper are new.