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

Authors:
Shinpei Kato;Hidenori Kobayashi;Nobuyuki Yamasaki
Affiliations:
Keio University;Keio University;Keio University
Venue:
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2005

Citing 0
Cited 2

Fixed-priority scheduling on prioritized SMT processor

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
A predictable simultaneous multithreading scheme for hard real-time

ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.