Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound

Nan Guan; Martin Stigge; Wang Yi; Ge Yu

doi:10.1109/RTAS.2010.39

Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound

Nan Guan
, Martin Stigge
, Wang Yi^*
, Ge Yu

^*Corresponding author for this work

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

79 Scopus citations

Abstract

Liu and Layland discovered the famous utilization bound N(2 ^1/N-1) for fixed-priority scheduling on single-processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.

Original language	English
Title of host publication	Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
Pages	165-174
Number of pages	10
DOIs	https://doi.org/10.1109/RTAS.2010.39
State	Published - 2010
Externally published	Yes
Event	16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 - Stockholm, Sweden Duration: 12 Apr 2010 → 15 Apr 2010

Publication series

Name	Real-Time Technology and Applications - Proceedings
ISSN (Print)	1080-1812

Conference

Conference	16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
Country/Territory	Sweden
City	Stockholm
Period	12/04/10 → 15/04/10

Keywords

Fixed priority scheduling
Multiprocessor
Real-time systems
Utilization bound

Access to Document

10.1109/RTAS.2010.39

Cite this

@inproceedings{5444f32f6c6543a9be2e37813d1dbd91,

title = "Fixed-priority multiprocessor scheduling with Liu \& Layland's utilization bound",

abstract = "Liu and Layland discovered the famous utilization bound N(2 1/N-1) for fixed-priority scheduling on single-processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.",

keywords = "Fixed priority scheduling, Multiprocessor, Real-time systems, Utilization bound",

author = "Nan Guan and Martin Stigge and Wang Yi and Ge Yu",

year = "2010",

doi = "10.1109/RTAS.2010.39",

language = "英语",

isbn = "9780769540016",

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

pages = "165--174",

booktitle = "Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010",

note = "16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 ; Conference date: 12-04-2010 Through 15-04-2010",

}

Guan, N, Stigge, M, Yi, W & Yu, G 2010, Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound. in Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010., 5465974, Real-Time Technology and Applications - Proceedings, pp. 165-174, 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010, Stockholm, Sweden, 12/04/10. https://doi.org/10.1109/RTAS.2010.39

Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound. / Guan, Nan; Stigge, Martin; Yi, Wang et al.
Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010. 2010. p. 165-174 5465974 (Real-Time Technology and Applications - Proceedings).

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

TY - GEN

T1 - Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound

AU - Guan, Nan

AU - Stigge, Martin

AU - Yi, Wang

AU - Yu, Ge

PY - 2010

Y1 - 2010

N2 - Liu and Layland discovered the famous utilization bound N(2 1/N-1) for fixed-priority scheduling on single-processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.

AB - Liu and Layland discovered the famous utilization bound N(2 1/N-1) for fixed-priority scheduling on single-processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.

KW - Fixed priority scheduling

KW - Multiprocessor

KW - Real-time systems

KW - Utilization bound

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

U2 - 10.1109/RTAS.2010.39

DO - 10.1109/RTAS.2010.39

M3 - 会议稿件

AN - SCOPUS:77953866185

SN - 9780769540016

T3 - Real-Time Technology and Applications - Proceedings

SP - 165

EP - 174

BT - Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010

T2 - 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010

Y2 - 12 April 2010 through 15 April 2010

ER -

Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this