Scheduling tasks with variable deadlines

Chi Sheng Shih, Lui Sha, Jane Liu

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)120-122
Number of pages3
JournalReal-Time Technology and Applications - Proceedings
StatePublished - 2001

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software


Dive into the research topics of 'Scheduling tasks with variable deadlines'. Together they form a unique fingerprint.

Cite this