On-Line Scheduling of Real-Time Tasks

Kwang S. Hong, Joseph Y.T. Leung

Research output: Contribution to journalArticlepeer-review

61 Scopus citations


An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal on-line scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.

Original languageEnglish (US)
Pages (from-to)1326-1331
Number of pages6
JournalIEEE Transactions on Computers
Issue number10
StatePublished - Oct 1992
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'On-Line Scheduling of Real-Time Tasks'. Together they form a unique fingerprint.

Cite this