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

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.

[1]  Wenbin Chen,et al.  An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity) , 2007, Inf. Process. Lett..

[2]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[3]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[4]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[5]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[6]  D. R. Heath-Brown,et al.  On the difference between consecutive primes , 1979 .

[7]  Leonard M. Adleman,et al.  NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..

[8]  Robert Weismantel,et al.  Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations , 1997, ESA.

[9]  Jean-Pierre Seifert,et al.  On the Hardness of Approximating Shortest Integer Relations among Rational Numbers , 1998, Theor. Comput. Sci..

[10]  Robert Weismantel,et al.  Diophantine Approximations and Integer Points of Cones , 2002, Comb..

[11]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[12]  Jean-Pierre Seifert,et al.  Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard , 1996, MFCS.

[13]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[14]  D. R. Heath-Brown,et al.  An Introduction to the Theory of Numbers, Sixth Edition , 2008 .

[15]  David Halliday,et al.  ABOUT THE FIFTH EDITION , 2018, Labor Guide to Labor Law.

[16]  Ravi Kannan,et al.  Polynomial-Time Aggregation of Integer Programming Problems , 1983, JACM.

[17]  D. R. Heath-Brown.  The number of primes in a short interval. , 1988 .

[18]  D. R. Heath-Brown.  Prime Numbers in Short Intervals and a Generalized Vaughan Identity , 1982, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[19]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[20]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[21]  Jeffrey C. Lagarias,et al.  The computational complexity of simultaneous Diophantine approximation problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[22]  Alan Burns,et al.  Fixed priority pre-emptive scheduling: An historical perspective , 1995, Real-Time Systems.

[23]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[24]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.