Semi-partitioned scheduling of sporadic task systems on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki, Yutaka Ishikawa

研究成果: Conference contribution

75 被引用数 (Scopus)

抄録

This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-ofthe- art, with a smaller number of context switches.

本文言語English
ホスト出版物のタイトル2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09
ページ249-258
ページ数10
DOI
出版ステータスPublished - 2009
イベント2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09 - Dublin, Ireland
継続期間: 2009 7 12009 7 3

出版物シリーズ

名前Proceedings - Euromicro Conference on Real-Time Systems
ISSN(印刷版)1068-3070

Other

Other2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09
CountryIreland
CityDublin
Period09/7/109/7/3

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

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

引用スタイル