On-Line Scheduling of Real-Time Tasks

Kwang S. Hong; Joseph Y.T. Leung

doi:10.1109/12.166609

On-Line Scheduling of Real-Time Tasks

Kwang S. Hong, Joseph Y.T. Leung

Research output: Contribution to journal › Article › peer-review

62 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	1326-1331
Number of pages	6
Journal	IEEE Transactions on Computers
Volume	41
Issue number	10
DOIs	https://doi.org/10.1109/12.166609
State	Published - Oct 1992
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.166609

Cite this

@article{79215452138e4ed9a3d0d764cd865061,

title = "On-Line Scheduling of Real-Time Tasks",

abstract = "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.",

author = "Hong, {Kwang S.} and Leung, {Joseph Y.T.}",

year = "1992",

month = oct,

doi = "10.1109/12.166609",

language = "English (US)",

volume = "41",

pages = "1326--1331",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - On-Line Scheduling of Real-Time Tasks

AU - Hong, Kwang S.

AU - Leung, Joseph Y.T.

PY - 1992/10

Y1 - 1992/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026939501&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026939501&partnerID=8YFLogxK

U2 - 10.1109/12.166609

DO - 10.1109/12.166609

M3 - Article

AN - SCOPUS:0026939501

SN - 0018-9340

VL - 41

SP - 1326

EP - 1331

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 10

ER -

On-Line Scheduling of Real-Time Tasks

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this