Portioned static-priority scheduling on multiprocessors

Shinpei Kato; Nobuyuki Yamasaki

doi:10.1109/IPDPS.2008.4536299

Portioned static-priority scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki

Department of Information and Computer Science

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

23 Citations (Scopus)

Abstract

This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithmis well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.

Original language	English
Title of host publication	IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
DOIs	https://doi.org/10.1109/IPDPS.2008.4536299
Publication status	Published - 2008
Event	IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium - Miami, FL, United States Duration: 2008 Apr 14 → 2008 Apr 18

Publication series

Name	IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Other

Other	IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium
Country	United States
City	Miami, FL
Period	08/4/14 → 08/4/18

ASJC Scopus subject areas

Hardware and Architecture
Software
Electrical and Electronic Engineering

Access to Document

10.1109/IPDPS.2008.4536299

Fingerprint Dive into the research topics of 'Portioned static-priority scheduling on multiprocessors'. Together they form a unique fingerprint.

Cite this

Kato, S., & Yamasaki, N. (2008). Portioned static-priority scheduling on multiprocessors. In IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM [4536299] (IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM). https://doi.org/10.1109/IPDPS.2008.4536299

Portioned static-priority scheduling on multiprocessors. / Kato, Shinpei; Yamasaki, Nobuyuki.

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM. 2008. 4536299 (IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM).

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

Kato, S & Yamasaki, N 2008, Portioned static-priority scheduling on multiprocessors. in IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM., 4536299, IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM, IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium, Miami, FL, United States, 08/4/14. https://doi.org/10.1109/IPDPS.2008.4536299

Kato S, Yamasaki N. Portioned static-priority scheduling on multiprocessors. In IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM. 2008. 4536299. (IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM). https://doi.org/10.1109/IPDPS.2008.4536299

@inproceedings{2db89268dc82442ea876ad2121154244,

title = "Portioned static-priority scheduling on multiprocessors",

abstract = "This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithmis well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.",

author = "Shinpei Kato and Nobuyuki Yamasaki",

note = "Copyright: Copyright 2008 Elsevier B.V., All rights reserved.; IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium ; Conference date: 14-04-2008 Through 18-04-2008",

year = "2008",

doi = "10.1109/IPDPS.2008.4536299",

language = "English",

isbn = "9781424416943",

series = "IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM",

booktitle = "IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM",

}

TY - GEN

T1 - Portioned static-priority scheduling on multiprocessors

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2008

Y1 - 2008

N2 - This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithmis well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.

AB - This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithmis well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.

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

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

U2 - 10.1109/IPDPS.2008.4536299

DO - 10.1109/IPDPS.2008.4536299

M3 - Conference contribution

AN - SCOPUS:51049098730

SN - 9781424416943

T3 - IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

BT - IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

T2 - IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium

Y2 - 14 April 2008 through 18 April 2008

ER -