TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS.

E. Douglas Jensen, C. Douglass Locke, Hideyuki Tokuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

283 Citations (Scopus)

Abstract

Process scheduling in real-time systems has almost invariably used one or more of three algorithms, namely, fixed priority, FIFO, or round robin. The notion that the primary distinguishing characteristic of a real-time system is the concept that completion of a process or a set of processes has a value to the system which can be expressed as a function of time is discussed. This notion is described in terms of a time-driven scheduling model for real-time operating systems and provides a tool for measuring the effectiveness of most of the currently used process schedulers in real-time systems. Applying this model, a multiprocessor real-time system simulator was constructed with which a number of well-known scheduling algorithms such as Shortest Process Time (SPT), Deadline, Shortest Slack Time, FIFO, and a fixed priority scheduler are measured with respect to the resulting total system values. This approach to measuring the process scheduling effectiveness is a first step in the longer term effort to produce a scheduler which will explicitly schedule real-time processes in such a way that their execution times maximize their collective value to the system.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages112-122
Number of pages11
ISBN (Print)0818606754
Publication statusPublished - 1985
Externally publishedYes

Fingerprint

Computer operating systems
Real time systems
Scheduling
Scheduling algorithms
Simulators

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Jensen, E. D., Locke, C. D., & Tokuda, H. (1985). TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS. In Unknown Host Publication Title (pp. 112-122). IEEE.

TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS. / Jensen, E. Douglas; Locke, C. Douglass; Tokuda, Hideyuki.

Unknown Host Publication Title. IEEE, 1985. p. 112-122.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jensen, ED, Locke, CD & Tokuda, H 1985, TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS. in Unknown Host Publication Title. IEEE, pp. 112-122.
Jensen ED, Locke CD, Tokuda H. TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS. In Unknown Host Publication Title. IEEE. 1985. p. 112-122
Jensen, E. Douglas ; Locke, C. Douglass ; Tokuda, Hideyuki. / TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS. Unknown Host Publication Title. IEEE, 1985. pp. 112-122
@inproceedings{792b38ec988040e885b9f14ead3d1171,
title = "TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS.",
abstract = "Process scheduling in real-time systems has almost invariably used one or more of three algorithms, namely, fixed priority, FIFO, or round robin. The notion that the primary distinguishing characteristic of a real-time system is the concept that completion of a process or a set of processes has a value to the system which can be expressed as a function of time is discussed. This notion is described in terms of a time-driven scheduling model for real-time operating systems and provides a tool for measuring the effectiveness of most of the currently used process schedulers in real-time systems. Applying this model, a multiprocessor real-time system simulator was constructed with which a number of well-known scheduling algorithms such as Shortest Process Time (SPT), Deadline, Shortest Slack Time, FIFO, and a fixed priority scheduler are measured with respect to the resulting total system values. This approach to measuring the process scheduling effectiveness is a first step in the longer term effort to produce a scheduler which will explicitly schedule real-time processes in such a way that their execution times maximize their collective value to the system.",
author = "Jensen, {E. Douglas} and Locke, {C. Douglass} and Hideyuki Tokuda",
year = "1985",
language = "English",
isbn = "0818606754",
pages = "112--122",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - TIME-DRIVEN SCHEDULING MODEL FOR REAL-TIME OPERATING SYSTEMS.

AU - Jensen, E. Douglas

AU - Locke, C. Douglass

AU - Tokuda, Hideyuki

PY - 1985

Y1 - 1985

N2 - Process scheduling in real-time systems has almost invariably used one or more of three algorithms, namely, fixed priority, FIFO, or round robin. The notion that the primary distinguishing characteristic of a real-time system is the concept that completion of a process or a set of processes has a value to the system which can be expressed as a function of time is discussed. This notion is described in terms of a time-driven scheduling model for real-time operating systems and provides a tool for measuring the effectiveness of most of the currently used process schedulers in real-time systems. Applying this model, a multiprocessor real-time system simulator was constructed with which a number of well-known scheduling algorithms such as Shortest Process Time (SPT), Deadline, Shortest Slack Time, FIFO, and a fixed priority scheduler are measured with respect to the resulting total system values. This approach to measuring the process scheduling effectiveness is a first step in the longer term effort to produce a scheduler which will explicitly schedule real-time processes in such a way that their execution times maximize their collective value to the system.

AB - Process scheduling in real-time systems has almost invariably used one or more of three algorithms, namely, fixed priority, FIFO, or round robin. The notion that the primary distinguishing characteristic of a real-time system is the concept that completion of a process or a set of processes has a value to the system which can be expressed as a function of time is discussed. This notion is described in terms of a time-driven scheduling model for real-time operating systems and provides a tool for measuring the effectiveness of most of the currently used process schedulers in real-time systems. Applying this model, a multiprocessor real-time system simulator was constructed with which a number of well-known scheduling algorithms such as Shortest Process Time (SPT), Deadline, Shortest Slack Time, FIFO, and a fixed priority scheduler are measured with respect to the resulting total system values. This approach to measuring the process scheduling effectiveness is a first step in the longer term effort to produce a scheduler which will explicitly schedule real-time processes in such a way that their execution times maximize their collective value to the system.

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

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

M3 - Conference contribution

SN - 0818606754

SP - 112

EP - 122

BT - Unknown Host Publication Title

PB - IEEE

ER -