Scheduling tasks with variable deadlines

Chi Sheng Shih; Lui Sha; Jane Liu

doi:10.1109/RTTAS.2001.929874

Scheduling tasks with variable deadlines

Chi Sheng Shih, Lui Sha, Jane Liu

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

Abstract

Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. This paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.

Original language	English (US)
Pages (from-to)	120-122
Number of pages	3
Journal	Real-Time Technology and Applications - Proceedings
DOIs	https://doi.org/10.1109/RTTAS.2001.929874
State	Published - 2001

ASJC Scopus subject areas

Hardware and Architecture
Computer Networks and Communications
Software

Online availability

10.1109/RTTAS.2001.929874

Library availability

Discover UIUC Full Text

Cite this

@article{77fff05bc2b24efe838f73474d20caa1,

title = "Scheduling tasks with variable deadlines",

abstract = "Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. This paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.",

author = "Shih, {Chi Sheng} and Lui Sha and Jane Liu",

year = "2001",

doi = "10.1109/RTTAS.2001.929874",

language = "English (US)",

pages = "120--122",

journal = "Real-Time Technology and Applications - Proceedings",

issn = "1080-1812",

publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Scheduling tasks with variable deadlines

AU - Shih, Chi Sheng

AU - Sha, Lui

AU - Liu, Jane

PY - 2001

Y1 - 2001

N2 - Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. This paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.

AB - Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the deadlines may also change with time. This paper discusses the problem of scheduling tasks with variable deadlines and presents preliminary results and on-going work.

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

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

U2 - 10.1109/RTTAS.2001.929874

DO - 10.1109/RTTAS.2001.929874

M3 - Article

AN - SCOPUS:0034835750

SN - 1080-1812

SP - 120

EP - 122

JO - Real-Time Technology and Applications - Proceedings

JF - Real-Time Technology and Applications - Proceedings

ER -

Scheduling tasks with variable deadlines

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this