Open problems in real-time scheduling
- 20 October 2009
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 13 (6) , 577-582
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Algorithms and Complexity for Periodic Real-Time Scheduling2010
- EDF-schedulability of synchronous periodic task systems is coNP-hard2010
- Implementation of a Speedup-Optimal Global EDF Schedulability Test2009
- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time SchedulingLecture Notes in Computer Science, 2009
- Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard2008
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling2008
- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation2008
- Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processorReal-Time Systems, 1990
- Preemptively scheduling hard-real-time sporadic tasks on one processor1990
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973