| | |
Summary: Competitive Analysis of Energy-Constrained Real-Time Scheduling
Vinay Devadas Fei Li Hakan Aydin
Department of Computer Science
George Mason University
Fairfax, VA 22030
{vdevadas, lifei, aydin }@cs.gmu.edu
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 focus-
ing 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
|
