U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors

Hong Kong, China August 17-August 19

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/RTCSA.2005.100

11th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Shinpei Kato Articles by Hidenori Kobayashi Articles by Nobuyuki Yamasaki

	ASCII Text	x
	Shinpei Kato, Hidenori Kobayashi, Nobuyuki Yamasaki, "U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors," Real-Time Computing Systems and Applications, International Workshop on, pp. 193-197, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005.

	BibTex	x
	@article{ 10.1109/RTCSA.2005.100, author = {Shinpei Kato and Hidenori Kobayashi and Nobuyuki Yamasaki}, title = {U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {2005}, issn = {1533-2306}, pages = {193-197}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2005.100}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors SN - 1533-2306 SP193 EP197 A1 - Shinpei Kato, A1 - Hidenori Kobayashi, A1 - Nobuyuki Yamasaki, PY - 2005 KW - null VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Shinpei Kato, Keio University

Hidenori Kobayashi, Keio University

Nobuyuki Yamasaki, Keio University

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 EDFUS, in the point of execution time stability, task rejection ratio and deadline miss ratio.

Citation:

Shinpei Kato, Hidenori Kobayashi, Nobuyuki Yamasaki, "U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors," rtcsa, pp.193-197, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.