Next Article in Journal
Topological Photonic Media and the Possibility of Toroidal Electromagnetic Wavepackets
Next Article in Special Issue
Multi Objective for PMU Placement in Compressed Distribution Network Considering Cost and Accuracy of State Estimation
Previous Article in Journal
Influence of Nitrogen Source and Growth Phase on Extracellular Biosynthesis of Silver Nanoparticles Using Cultural Filtrates of Scenedesmus obliquus
Previous Article in Special Issue
Voltage/Frequency Deviations Control via Distributed Battery Energy Storage System Considering State of Charge
Open AccessArticle

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

1
Department of Computer Science Engineering, Amity School of Engineering and Technology, Noida 226010, India
2
Department of Electrical and Computer Engineering, Hawassa University, Awasa P.O. Box 05, Ethiopia
3
Department of CSE, Jaypee Institute of Information Technology Noida, Noida 201309, India
4
Department of Electrical Power Engineering, Tishreen University, Lattakia 2230, Syria
5
Department of Management & Innovation Systems, University of Salerno, 84084 Salerno, Italy
*
Author to whom correspondence should be addressed.
Appl. Sci. 2019, 9(7), 1467; https://doi.org/10.3390/app9071467
Received: 25 February 2019 / Revised: 2 April 2019 / Accepted: 4 April 2019 / Published: 8 April 2019
(This article belongs to the Special Issue Energy Management and Smart Grids)
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. View Full-Text
Keywords: non-clairvoyant scheduling; online scheduling; traditional power function; speed scaling non-clairvoyant scheduling; online scheduling; traditional power function; speed scaling
Show Figures

Figure 1

MDPI and ACS Style

Singh, P.; Khan, B.; Vidyarthi, A.; Haes Alhelou, H.; Siano, P. Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function. Appl. Sci. 2019, 9, 1467.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop