Energy efficient non-clairvoyant scheduling for unbounded-speed multi-core machines

Abstract

With the increasing consumption of energy in data centers, the demand for energy efficient multiprocessor job scheduling is growing dramatically. Besides flow time, energy conservation has become a significant issue and drawn enormous interest. In this paper, an online non-clairvoyant scheduling algorithm Significance-based Multiprocessor Round Robin (SbMRR) is proposed. SbMRR utilizes the unbounded speed model, where the range of the speed of any processor is from zero to infinity. To validate the effectiveness of the algorithm, mathematical and simulation-based analysis are conducted which demonstrates that SbMRR provides the minimum sum of significance-based flow time and energy consumed. SbMRR is O(α)-competitive, more precisely ((α + 1)⁄((1–1⁄αβ)))-competitive, where β ≥ 4 a constant. The competitive ratio of SbMRR is least to date. SbMRR provides the minimum sum of energy consumed and significance-based flow-time.