U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors

Shinpei Kato, Hidenori Kobayashi, Nobuyuki Yamasaki

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDF-US, in the point of execution time stability, task rejection ratio and deadline miss ratio.

本文言語English
ホスト出版物のタイトルProceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
ページ193-197
ページ数5
DOI
出版ステータスPublished - 2005 12 1
イベント11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Hong Kong, China
継続期間: 2005 8 17 → 2005 8 19

出版物シリーズ

名前Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Other

Other11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
CountryChina
CityHong Kong
Period05/8/17 → 05/8/19

ASJC Scopus subject areas

  • Engineering(all)

文献へのアクセス

他のファイルとリンク

フィンガープリント 「U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル