We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function.
- Authors
Singh, Pawan; Khan, Baseem; Vidyarthi, Ankit; Haes Alhelou, Hassan; Siano, Pierluigi
- Abstract
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.
- Subjects
COMPUTER scheduling; GROUNDWATER flow; MACHINE performance; SPEED; SERVER farms (Computer network management); ENERGY consumption
- Publication
Applied Sciences (2076-3417), 2019, Vol 9, Issue 7, p1467
- ISSN
2076-3417
- Publication type
Article
- DOI
10.3390/app9071467