Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound

Nan Guan; Wang Yi

doi:10.1109/IPDPSW.2012.305

Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound

Nan Guan, Wang Yi

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

17 Citations (Scopus)

Abstract

The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and low-power requirements. This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years. However the multiprocessor scheduling problem to map tasks onto parallel architectures is a much harder challenge. In this work, we study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound.

Original language	English
Title of host publication	Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
Pages	2470-2473
Number of pages	4
DOIs	https://doi.org/10.1109/IPDPSW.2012.305
Publication status	Published - 18 Oct 2012
Externally published	Yes
Event	2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 - Shanghai, China Duration: 21 May 2012 → 25 May 2012

Conference

Conference	2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
Country/Territory	China
City	Shanghai
Period	21/05/12 → 25/05/12

ASJC Scopus subject areas

Software

More information

10.1109/IPDPSW.2012.305

Cite this

@inproceedings{8a4d9a16106e42a4a7683324c943f6e3,

title = "Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound",

abstract = "The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and low-power requirements. This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years. However the multiprocessor scheduling problem to map tasks onto parallel architectures is a much harder challenge. In this work, we study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound.",

author = "Nan Guan and Wang Yi",

year = "2012",

month = oct,

day = "18",

doi = "10.1109/IPDPSW.2012.305",

language = "English",

isbn = "9780769546766",

pages = "2470--2473",

booktitle = "Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012",

note = "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 ; Conference date: 21-05-2012 Through 25-05-2012",

}

Guan, N & Yi, W 2012, Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound. in Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012., 6270871, pp. 2470-2473, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012, Shanghai, China, 21/05/12. https://doi.org/10.1109/IPDPSW.2012.305

Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound. / Guan, Nan; Yi, Wang.
Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. 2012. p. 2470-2473 6270871.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound

AU - Guan, Nan

AU - Yi, Wang

PY - 2012/10/18

Y1 - 2012/10/18

N2 - The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and low-power requirements. This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years. However the multiprocessor scheduling problem to map tasks onto parallel architectures is a much harder challenge. In this work, we study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound.

AB - The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and low-power requirements. This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years. However the multiprocessor scheduling problem to map tasks onto parallel architectures is a much harder challenge. In this work, we study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound.

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

U2 - 10.1109/IPDPSW.2012.305

DO - 10.1109/IPDPSW.2012.305

M3 - Conference article published in proceeding or book

SN - 9780769546766

SP - 2470

EP - 2473

BT - Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

T2 - 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

Y2 - 21 May 2012 through 25 May 2012

ER -

Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this