Abstract
A huge consumption of energy in the data centres has become a motivation for improvement in computing capability and energy conservation. The dynamic speed scaling and job scheduling are efficient methods to improve the energy efficiency of processors. In this study, an online non-clairvoyant scheduling algorithm arrival time-algorithm (At-ALG) is proposed with an objective to scale the speed of processors and schedule the jobs in a multiprocessor system to minimise the total magnitude-based/weighted flow time plus energy consumed. The traditional power function Power = Spee d ω is adopted, where ω > 1 is a constant. At-ALG is analysed, against an offline adversary, using the potential function analysis. The magnitude/weight/priority of jobs in At-ALG are generated using their processed time (waiting time plus executed time) and speed of any processor depends on the number of active jobs plus sum of processed time of active jobs. At-ALG is O ( 1 ) -competitive with no resource augmentation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
