Paper Info
Title
U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors
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.
Year
DOI
Venue
2005
10.1109/RTCSA.2005.100
RTCSA
Keywords
Field
DocType
co-scheduled task,execution time stability,multi-case execution time,task rejection ratio,fixed combination,smt processors,u-link scheduling scheme,u-link scheduling,co-scheduled set,real-time tasks,conventional scheduling algorithm,task scheduling,task execution time,simultaneous multithreaded,bounding execution time,multi threading,scheduling algorithm,real time systems,real time
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Parallel computing,Real-time computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling
Conference
ISBN
Citations 
PageRank 
0-7695-2346-3
3
0.54
References 
Authors
6
3
Name
Order
Citations
PageRank
Shinpei Kato195162.18
Hidenori Kobayashi230.54
Nobuyuki Yamasaki333830.45