Global semi-fixed-priority scheduling on multiprocessors

Hiroyuki Chishiro, Nobuyuki Yamasaki

研究成果: Conference contribution

9 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトルProceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
ページ218-223
ページ数6
DOI
出版物ステータスPublished - 2011 12 1
イベント17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011 - Toyama, Japan
継続期間: 2011 8 282011 8 31

出版物シリーズ

名前Proceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
1

Other

Other17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011
Japan
Toyama
期間11/8/2811/8/31

ASJC Scopus subject areas

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

フィンガープリント Global semi-fixed-priority scheduling on multiprocessors' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Chishiro, H., & Yamasaki, N. (2011). Global semi-fixed-priority scheduling on multiprocessors. : 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; 巻数 1). https://doi.org/10.1109/RTCSA.2011.32