Semi-partitioned fixed-priority scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki

研究成果: Conference contribution

55 被引用数 (Scopus)

抄録

This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that qualifies a few tasks to migrate across processors, while most tasks are fixed to particular processors. We design the algorithm so that a task is qualified to migrate, only if it cannot be assigned to any individual processors, in such a way that it is never returned to the same processor within the same period, once it is migrated from one processor to another processor. The scheduling policy is then conformed to DeadlineMonotonic. According to the simulation results, the new algorithm significantly outperforms the traditional fixed-priority algorithms in terms of schedulability.

本文言語English
ホスト出版物のタイトルProceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
ページ23-32
ページ数10
DOI
出版ステータスPublished - 2009
イベント15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009 - San Francisco, CA, United States
継続期間: 2009 4 142009 4 16

出版物シリーズ

名前Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
ISSN(印刷版)1545-3421

Other

Other15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
CountryUnited States
CitySan Francisco, CA
Period09/4/1409/4/16

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント 「Semi-partitioned fixed-priority scheduling on multiprocessors」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル