D-OVER ; an optimal on-line scheduling algorithm for overloaded real-time systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1992

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

G. Koren
  • Function : Author
Dennis Shasha
  • Function : Author
  • PersonId : 833427

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RT-0138.pdf (2.15 Mo) Télécharger le fichier

Dates and versions

inria-00070030 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070030 , version 1

Cite

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⟩
126 View
193 Download

Share

Gmail Facebook Twitter LinkedIn More