Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Bell, Paul C.; Wong, Prudence W.H.

doi:10.1007/s10878-013-9618-8

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Bell, Paul C.; Wong, Prudence W.H.

Authors

Paul Bell p.c.bell@keele.ac.uk

Prudence W.H. Wong

Abstract

In this paper we study energy efficient deadline scheduling on multiprocessors in which the processors consumes power at a rate of sa when running at speed s, where a=2. The problem is to dispatch jobs to processors and determine the speed and jobs to run for each processor so as to complete all jobs by their deadlines using the minimum energy. The problem has been well studied for the single processor case. For the multiprocessor setting, constant competitive online algorithms for special cases of unit size jobs or arbitrary size jobs with agreeable deadlines have been proposed by Albers et al. (2007). A randomized algorithm has been proposed for jobs of arbitrary sizes and arbitrary deadlines by Greiner et al. (2009). We propose a deterministic online algorithm for the general setting and show that it is O(logaP)-competitive, where P is the ratio of the maximum and minimum job size.

Journal Article Type	Article
Acceptance Date	Apr 27, 2013
Publication Date	May 1, 2015
Journal	Journal of Combinatorial Optimization
Print ISSN	1382-6905
Publisher	Springer Verlag
Peer Reviewed	Peer Reviewed
Volume	29
Pages	739 - 749
DOI	https://doi.org/10.1007/s10878-013-9618-8
Publisher URL	https://link.springer.com/article/10.1007/s10878-013-9618-8