Some results on scheduling tasks with self-suspensions
Journal of Embedded Computing - Best Papers of RTS' 2005
A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Towards a simple meta-model for complex real-time and embedded systems
MEDI'11 Proceedings of the First international conference on Model and data engineering
Reducing the gap between design and scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
The scheduling problem of self-suspending periodic real-time tasks
Proceedings of the 20th International Conference on Real-Time and Network Systems
A new technique for analyzing soft real-time self-suspending task systems
ACM SIGBED Review - Special Issue on the 24th Euromicro Conference on Real-Time Systems
| Hi-index | 0.00 |
In most real-time systems, tasks use remote operations that are executed upon dedicated processors. External operations introduce self-suspension delays in the behavior of tasks. This paper presents several negative results concerning scheduling independent hard real-time tasks with self-suspensions. Our main objective is to show that well-known scheduling policies such as fixed-priority or Earliest Deadline First are not efficient to schedule such task systems. We prove the scheduling problem to be NP-hard in the strong sense, even for synchronous task systems with implicit deadlines. We also show that scheduling anomalies can occur at run-time: reducing the execution requirement or the suspension delay of a task can lead the task system to be infeasible under EDF. Lastly, we present negative results on the worst-case performances of well-known scheduling algorithms (EDF, RM, DM, LLF, SRPTF) to maximize tasks completed by their deadlines.