Global semi-fixed-priority scheduling on multiprocessors

Hiroyuki Chishiro, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Current real-time systems such as robots have multiprocessors and the number of processors tends to be increased. In order to achieve these real-time systems, global real-time scheduling has been required. Many real-time scheduling algorithms are usually based on Liu and Layland's model. Compared to Liu and Layland's model, the imprecise computation model is one of the techniques to overcome the gap between theory and practice. Semi-fixed-priority scheduling is part-level fixed-priority scheduling in the extended imprecise computation model, which has a second mandatory part to terminate an optional part. Unfortunately, current semi-fixed-priority scheduling is only adapted to uniprocessors. This paper presents a global semifixed-priority scheduling algorithm, called Global Rate Monotonic with Wind-up Part (G-RMWP). G-RMWP calculates the optional deadline, the termination time of each optional part, by Response Time Analysis for Global Rate Monotonic (G-RM). The schedulability analysis shows that one task set is schedulable by G-RMWP if the task set is schedulable by G-RM. Simulation results show that G-RMWP has higher schedulability than GRM.

Original languageEnglish
Title of host publicationProceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
Pages218-223
Number of pages6
DOIs
Publication statusPublished - 2011 Dec 1
Event17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011 - Toyama, Japan
Duration: 2011 Aug 282011 Aug 31

Publication series

NameProceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
Volume1

Other

Other17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
CountryJapan
CityToyama
Period11/8/2811/8/31

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

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

  • Cite this

    Chishiro, H., & Yamasaki, N. (2011). Global semi-fixed-priority scheduling on multiprocessors. In Proceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011 (pp. 218-223). [6029851] (Proceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011; Vol. 1). https://doi.org/10.1109/RTCSA.2011.32