Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

Authors:
Friedrich Eisenbrand;Thomas Rothvoβ
Affiliations:
-;-
Venue:
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Year:
2008

Citing 0
Cited 10

Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems
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
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
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"

Information Processing Letters
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

Real-Time Systems
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
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that response time computation for Rate-monotonic,preemptive scheduling of periodic tasks is NP-hard under Turingreductions. More precisely, we show that the response time of a taskcannot be approximated within any constant factor, unless P=NP.