Skip to Main content Skip to Navigation
Reports

D-OVER ; an optimal on-line scheduling algorithm for overloaded real-time systems

Abstract : Every task in a real-time system has a deadline by which time it should complete. Each task also has a value that it obtains only if it completes by its deadline. The problem is to design an on-line scheduling algorithm (i.e., the scheduler has no knowledge of a task until it is released) that maximizes the obtained value. When such a system is underloaded (i.e. there exists a schedule for which all tasks meet their deadlines), Dertouzos showed that the earliest deadline first algorithm will achieve 100% of the possible value. Locke showed that earliest deadline firtst performs very badly when the system is overloaded and proposed heuristics to deal with overload. This paper presents an optimal on-line scheduling algorithm for overloaded systems. It is optimal in the sense that it gives the best competitive factor possible relative to an offline scheduler.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00070030
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 6:51:40 PM
Last modification on : Thursday, February 11, 2021 - 2:50:06 PM
Long-term archiving on: : Tuesday, February 22, 2011 - 11:05:51 AM

Identifiers

  • HAL Id : inria-00070030, version 1

Collections

Citation

G. Koren, Dennis Shasha. D-OVER ; an optimal on-line scheduling algorithm for overloaded real-time systems. RT-0138, INRIA. 1992, pp.45. ⟨inria-00070030⟩

Share

Metrics

Record views

198

Files downloads

264