Annals of Operations Research
The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science
Computational Complexity
Algorithmic number theory
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Eliminating migration in multi-processor scheduling
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Schedulability analysis of global EDF
Real-Time Systems
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Proceedings of the 1982 conference on Cryptography
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no pseudopolynomial-time algorithm can test the feasibility of a task system within a constant speedup bound, unless P = NP. This result contrasts with recent results for sporadic task systems. For two special cases, synchronous task systems and systems with a constant number of different task types, we provide the first polynomial-time constant-speedup feasibility tests for multiprocessor platforms. Furthermore, we show that the problem of testing feasibility is coNP-hard for synchronous multiprocessor task systems. The complexity of some of these problems has been open for a long time. We also propose a weight maximization variant of the feasibility problem, where every task has a nonnegative weight, and the goal is to find a subset of tasks that can be scheduled feasibly and has maximum weight. We give the first constant-speed, constant-approximation algorithm for the case of synchronous task systems, together with related hardness results.