Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scalable Applications for Energy-Aware Processors
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Real-time scheduling of tasks that contain the external blocking intervals
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Negative Results for Scheduling Independent Hard Real-Time Tasks with Self-Suspensions
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
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 and to minimize the maximum response time of tasks.