Portioned static-priority scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationIPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
DOIs
Publication statusPublished - 2008
EventIPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium - Miami, FL, United States
Duration: 2008 Apr 142008 Apr 18

Other

OtherIPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium
CountryUnited States
CityMiami, FL
Period08/4/1408/4/18

Fingerprint

Scheduling
Scheduling algorithms
Derivatives

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Electrical and Electronic Engineering

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] 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.

Research output: Chapter in Book/Report/Conference proceedingConference 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 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 https://doi.org/10.1109/IPDPS.2008.4536299
Kato, Shinpei ; Yamasaki, Nobuyuki. / Portioned static-priority scheduling on multiprocessors. IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM. 2008.
@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",
year = "2008",
doi = "10.1109/IPDPS.2008.4536299",
language = "English",
isbn = "9781424416943",
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

SN - 9781424416943

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

ER -