Loading...
Please wait, while we are loading the content...
Similar Documents
U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kato, Shinpei Kobayashi, Hidenori Yamasaki, Nobuyuki |
| Description | The goal of this paper is to achieve hard real-time pro-cessing with admitting as many tasks as possible on Simul-taneous 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. 1 |
| File Format | |
| Language | English |
| Publisher Date | 2005-01-01 |
| Publisher Institution | In Proc. of Intl. Conf. on Embedded and RealTime Systems and Applications |
| Access Restriction | Open |
| Subject Keyword | Co-scheduled Set Bounding Execution Time Conventional Scheduling Algorithm Rr-dup Outperforms Simul-taneous Multithreaded Present Practical Algorithm Task Rejection Ratio Co-scheduled Task U-link Scheduling Scheme Hard Real-time Pro-cessing Task Execution Time Execution Time Stability Real-time Task Multi-case Execution Time Performance Evaluation Smt Processor U-link Scheduling Task Scheduling Fixed Combination Many Task |
| Content Type | Text |
| Resource Type | Article |
