Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Real-Time Syst (2010) 46: 88120 DOI 10.1007/s11241-010-9100-y

Summary: Real-Time Syst (2010) 46: 88120
DOI 10.1007/s11241-010-9100-y
Competitive analysis of online real-time scheduling
algorithms under hard energy constraint
Vinay Devadas Fei Li Hakan Aydin
Published online: 14 July 2010
Springer Science+Business Media, LLC 2010
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 algo-
rithm 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 competi-
tive factor in these settings. In non-uniform value density settings, we derive an upper


Source: Aydin, Hakan - Department of Computer Science, George Mason University


Collections: Computer Technologies and Information Sciences; Engineering