Title :
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
Author :
Eisenbrand, Friedrich ; Rothvoß, Thomas
Author_Institution :
Inst. of Math. EPFL, Lausanne
Abstract :
We show that response time computation for rate-monotonic,preemptive scheduling of periodic tasks is NP-hard under Turing reductions. More precisely, we show that the response time of a task cannot be approximated within any constant factor, unless P=NP.
Keywords :
computational complexity; scheduling; NP-hard; Turing reductions; response time computation; static-priority real-time scheduling; Approximation algorithms; Delay; Mathematics; Optimal scheduling; Piecewise linear approximation; Polynomials; Processor scheduling; Real time systems; Scheduling algorithm; Testing; intractability; response time analysis;
Conference_Titel :
Real-Time Systems Symposium, 2008
Conference_Location :
Barcelona
Print_ISBN :
978-0-7695-3477-0
DOI :
10.1109/RTSS.2008.25
