Algorithms and complexity for periodic real-time scheduling

Authors:
Vincenzo Bonifaci;Ho-Leung Chan;Alberto Marchetti-Spaccamela;Nicole Megow
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany and Università dell'Aquila, Italy;The University of Hong Kong, Hong Kong;Sapienza Università di Roma, Italy;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 16
Cited 1

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
Algorithmic number theory

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)
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)
Schedulability analysis of global EDF

Real-Time Systems
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On Lagrangian Relaxation and Subset Selection Problems

Approximation and Online Algorithms
How to share a secret

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

Open problems in real-time scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial 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 profit maximization variant of the feasibility problem, where every task has a non-negative profit, and the goal is to find a subset of tasks that can be scheduled feasibly with maximum profit. We give the first constant-speed, constant-approximation algorithm for the case of synchronous task systems, together with related hardness results.