Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors

Singh, Pawan; Prashast,

doi:10.1016/j.kijoms.2015.11.008

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Energy consumption has become a prime concern in the design of modern microprocessors, especially for battery based devices and data centers. Modern microprocessors [1,2] use dynamic speed scaling to save energy. The processors are designed in such a way that they can vary its speed to conserve energy using dynamic speed scaling.…”

Section: Introductionmentioning

confidence: 99%

Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function

et al. 2019

Self Cite

View full text Add to dashboard Cite

Efficient job scheduling reduces energy consumption and enhances the performance of machines in data centers and battery-based computing devices. Practically important online non-clairvoyant job scheduling is studied less extensively than other algorithms. In this paper, an online non-clairvoyant scheduling algorithm Highest Scaled Importance First (HSIF) is proposed, where HSIF selects an active job with the highest scaled importance. The objective considered is to minimize the scaled importance based flow time plus energy. The processor’s speed is proportional to the total scaled importance of all active jobs. The performance of HSIF is evaluated by using the potential analysis against an optimal offline adversary and simulating the execution of a set of jobs by using traditional power function. HSIF is 2-competitive under the arbitrary power function and dynamic speed scaling. The competitive ratio obtained by HSIF is the least to date among non-clairvoyant scheduling. The simulation analysis reflects that the performance of HSIF is best among the online non-clairvoyant job scheduling algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…The scheduling problems under the non-clairvoyant settings are more difficult and practical than the clairvoyant setting. In the last decade, the non-clairvoyant scheduling problems for the objective of minimising the magnitude-based/weighted flow time plus energy have been studied less extensively than others; few results for this objective are [18][19][20][21][22][23].…”

Section: Introductionmentioning

confidence: 99%