Competitive Analysis of Energy-Constrained Real-Time Scheduling
Devadas, V.
Fei Li
Aydin, H.
Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA;
This paper appears in: Real-Time Systems, 2009. ECRTS '09. 21st Euromicro Conference on
Publication Date: 1-3 July 2009
On page(s): 217-226
Location: Dublin,
ISSN: 1068-3070
ISBN: 978-0-7695-3724-5
INSPEC Accession Number: 10750498
Digital Object Identifier: 10.1109/ECRTS.2009.12
Current Version Published: 2009-07-10
Abstract
In this paper, we undertake the competitive analysis of the online real-time scheduling problems under a given hard energy constraint. Specifically, we derive worst-case performance bounds that apply to any online algorithm, when compared to an optimal algorithm that has the knowledge of the input sequence in advance. First, by focusing on uniform value-density settings, we prove that no online algorithm can achieve a competitive factor greater than 1 - emax/E, where emax is the upper bound on the size of any job and E is the available energy budget. Then we propose a variant of EDF algorithm, EC-EDF, that is able to achieve this upper bound. We show that a priori information about the largest job size in the actual input sequence makes possible the design of a semi-online algorithm EC-EDF* which achieves a constant competitive factor of 0.5. This turns out to be the best achievable competitive factor in these settings. We also extend our analysis to other settings, including those with non-uniform value densities and dynamic voltage scaling capability.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
