Static-priority scheduling of multiframe tasks

S. K. Baruah; Deji Chen; A. Mok

doi:10.1109/EMRTS.1999.777448

Static-priority scheduling of multiframe tasks

S. K. Baruah
, Deji Chen
, A. Mok

Department of Computer Science & Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved correct - this generalizes a result of A.K. Mok and D. Chen (1997).

Original language	English
Title of host publication	Proceedings of the 11th Euromicro Conference on Real-Time Systems, ECRTS 1999
Pages	38-45
Number of pages	8
DOIs	https://doi.org/10.1109/EMRTS.1999.777448
State	Published - 1999
Event	11th Euromicro Conference on Real-Time Systems, ECRTS 1999 - York, United Kingdom Duration: Jun 9 1999 → Jun 11 1999

Publication series

Name	Proceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)	1068-3070

Conference

Conference	11th Euromicro Conference on Real-Time Systems, ECRTS 1999
Country/Territory	United Kingdom
City	York
Period	06/9/99 → 06/11/99

Keywords

feasibility determination
Hard-real-time scheduling
multiframe tasks
rate-monotonic
static priorities

Access to Document

10.1109/EMRTS.1999.777448

Cite this

@inproceedings{f1f2247f02884a2e98648e7aaa1ebe38,

title = "Static-priority scheduling of multiframe tasks",

abstract = "The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved correct - this generalizes a result of A.K. Mok and D. Chen (1997).",

keywords = "feasibility determination, Hard-real-time scheduling, multiframe tasks, rate-monotonic, static priorities",

author = "Baruah, \{S. K.\} and Deji Chen and A. Mok",

year = "1999",

doi = "10.1109/EMRTS.1999.777448",

language = "English",

isbn = "0769502407",

series = "Proceedings - Euromicro Conference on Real-Time Systems",

pages = "38--45",

booktitle = "Proceedings of the 11th Euromicro Conference on Real-Time Systems, ECRTS 1999",

note = "11th Euromicro Conference on Real-Time Systems, ECRTS 1999 ; Conference date: 09-06-1999 Through 11-06-1999",

}

Baruah, SK, Chen, D & Mok, A 1999, Static-priority scheduling of multiframe tasks. in Proceedings of the 11th Euromicro Conference on Real-Time Systems, ECRTS 1999., 777448, Proceedings - Euromicro Conference on Real-Time Systems, pp. 38-45, 11th Euromicro Conference on Real-Time Systems, ECRTS 1999, York, United Kingdom, 06/9/99. https://doi.org/10.1109/EMRTS.1999.777448

TY - GEN

T1 - Static-priority scheduling of multiframe tasks

AU - Baruah, S. K.

AU - Chen, Deji

AU - Mok, A.

PY - 1999

Y1 - 1999

N2 - The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved correct - this generalizes a result of A.K. Mok and D. Chen (1997).

AB - The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved correct - this generalizes a result of A.K. Mok and D. Chen (1997).

KW - feasibility determination

KW - Hard-real-time scheduling

KW - multiframe tasks

KW - rate-monotonic

KW - static priorities

UR - https://www.scopus.com/pages/publications/84884597853

U2 - 10.1109/EMRTS.1999.777448

DO - 10.1109/EMRTS.1999.777448

M3 - Conference contribution

AN - SCOPUS:84884597853

SN - 0769502407

SN - 9780769502403

T3 - Proceedings - Euromicro Conference on Real-Time Systems

SP - 38

EP - 45

BT - Proceedings of the 11th Euromicro Conference on Real-Time Systems, ECRTS 1999

T2 - 11th Euromicro Conference on Real-Time Systems, ECRTS 1999

Y2 - 9 June 1999 through 11 June 1999

ER -

Static-priority scheduling of multiframe tasks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this