On-line scheduling of real-time tasks

Kwang S. Hong, Joseph Y T Leung

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

39 Scopus citations

Abstract

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
Pages244-250
Number of pages7
Volume35 n 6
ISBN (Print)0818608943
StatePublished - Dec 1 1988
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

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

Cite this