Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Implementation of a Speedup-Optimal Global EDF Schedulability Test
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Feasibility analysis of sporadic real-time multiprocessor task systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Assigning sporadic tasks to unrelated parallel machines
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling seminar.