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)|
|Number of pages||3|
|Journal||Real-Time Technology and Applications - Proceedings|
|State||Published - Jan 1 2001|
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications