The Community for Technology Leaders
2013 IEEE 34th Real-Time Systems Symposium (2008)
Nov. 30, 2008 to Dec. 3, 2008
ISSN: 1052-8725
ISBN: 978-0-7695-3477-0
pp: 397-406
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.
INDEX TERMS
response time analysis, intractability
CITATION
Thomas Rothvoß, Friedrich Eisenbrand, "Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard", 2013 IEEE 34th Real-Time Systems Symposium, vol. 00, no. , pp. 397-406, 2008, doi:10.1109/RTSS.2008.25
89 ms
(Ver 3.3 (11022016))