The computational complexity of simultaneous diophantine approximation problems
SIAM Journal on Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Approximation algorithms
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Complexity Theory: Exploring the Limits of Efficient Algorithms
Complexity Theory: Exploring the Limits of Efficient Algorithms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An improved lower bound for approximating Shortest Integer Relation in l∞ norm (SIR∞)
Information Processing Letters
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
New Hardness Results for Diophantine Approximation
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Open problems in real-time scheduling
Journal of Scheduling
Improved multiprocessor global schedulability analysis
Real-Time Systems
Algorithms and complexity for periodic real-time scheduling
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
Open problems in real-time scheduling
Journal of Scheduling
Processing data streams with hard real-time constraints on heterogeneous systems
Proceedings of the international conference on Supercomputing
Analysis and redesign of the 'TTC' and 'TTH' schedulers
Journal of Systems Architecture: the EUROMICRO Journal
Feasibility analysis of real-time transactions
Real-Time Systems
Assigning sporadic tasks to unrelated parallel machines
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In the synchronous periodic task model, a set τ1, ..., τn of tasks is given, each releasing jobs of running time ci with relative deadline di, at each integer multiple of the period pi. It is a classical result that Earliest Deadline First (EDF) is an optimal preemptive uniprocessor scheduling policy. For constrained deadlines, i.e. di ≤ pi, the EDF-schedule is feasible if and only if [EQUATION] Though an enormous amount of literature deals with this topic, the complexity status of this test has remained unknown. We prove that testing EDF-schedulability of such a task system is (weakly) coNP-hard. This solves Problem 2 from the survey "Open Problems in Real-time Scheduling" by Baruah & Pruhs. The hardness result is achieved by applying recent results on inapproximability of Diophantine approximation.