On-line scheduling of real-time tasks

Kwang S. Hong, Joseph Y.T. Leung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Scopus citations


The problem of online scheduling of a set of n independent, real-time tasks on m ≥ 1 identical processors is addressed. An online scheduler is said to be optimal if it performs as well as the best offline scheduler. It is shown that no optimal online scheduler can exist if the tasks have more than one distinct deadline. An optimal online scheduler for tasks with one common deadline is given. An optimal online scheduler is also given for environments in which processors can go down unexpectedly.

Original languageEnglish (US)
Title of host publicationProc Real Time Syst Symp
PublisherPubl by IEEE
Number of pages7
ISBN (Print)0818608943
StatePublished - 1988
Externally publishedYes

Publication series

NameProc Real Time Syst Symp
Volume35 n 6

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'On-line scheduling of real-time tasks'. Together they form a unique fingerprint.

Cite this