Static-priority real-time scheduling: Response time computation is NP-hard

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 397-406

  Eisenbrand, Friedrich ^a   Rothvoß, Thomas ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; NP-HARD; PERIODIC TASKS; PRE-EMPTIVE SCHEDULING; RATE-MONOTONIC; REAL TIME SCHEDULING; RESPONSE TIME; RESPONSE TIME COMPUTATION;

COMPUTATIONAL COMPLEXITY; SCHEDULING;

REAL TIME SYSTEMS;

EID: 67249084364     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.25     Document Type: Conference Paper

References (20)

1. [ABD+95] N. C. Audsley, A. Burns, R. I. Davis, K. Tindell, and A. J. Wellings. Fixed priority preemptive scheduling: An historical perspective. Real-Time Systems, 8(2-3):173-198, 1995.
2. ∞). Information Processing Letters, 101(4):174-179, 2007. (Pubitemid 44914143)
3. [FB05] N. Fisher and S. Baruah. A fully polynomialtime approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In ECRTS '05: Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS'05), pages 117-126, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 44458424)
4. [Fei98] U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998. (Pubitemid 128488790)
5. [HB88] D. R. Heath-Brown. The number of primes in a short interval. J. Reine Angew. Math., 389:22-63, 1988.
6. [HBI79] D. R. Heath-Brown and H. Iwaniec. On the difference between consecutive primes. Bull. Amer. Math. Soc. (N.S.), 1(5):758-760, 1979.
7. [HW97] M. Henk and R. Weismantel. Test sets of the knapsack problem and simultaneous diophantine approximation. In ESA: Annual European Symposium on Algorithms, 1997.
8. [HW02] M. Henk and R. Weismantel. Diophantine approximations and integer points of cones. Combinatorica, 22(3):401-407, 2002.
9. [JP86] M. Joseph and P. K. Pandya. Finding response times in a real-time system. Computer Journal, 29(5):390-395, 1986. (Pubitemid 17463568)
10. [Kan83] R. Kannan. Polynomial-time aggregation of integer programming problems. Journal of the ACM, 30(1):133-145, January 1983. (Pubitemid 13504811)
11. [Kha79] L.G. Khachiyan. A polynomial algorithm for linear programming. Soviet Math. Doklady, 20:191-194, 1979. (Russian original in Doklady Akademiia Nauk SSSR, 244:1093-1096).
12. [Lag85] J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SICOMP: SIAM Journal on Computing, 14, 1985.
13. [LL73] C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-realtime environment. J. ACM, 20(1):46-61, 1973.
14. [LLL82] A. K. Lenstra, H.W. Lenstra Jr., and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.
15. [LSD89] J. P. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In IEEE Real-Time Systems Symposium, pages 166-171, 1989. (Pubitemid 20714278)
16. [MA78] K. L. Manders and L. Adleman. NPcomplete decision problems for binary quadratics. Journal of Computer and System Sciences, 16(2):168-184, April 1978.
17. [NZM91] I. Niven, H. S. Zuckerman, and H. L. Montgomery. An Introduction to the Theory of Numbers, fifth edition. Wiley, 1991.
18. [RS96] C. Rössner and J.P. Seifert. Approximating good simultaneous Diophantine approximations is almost NP-hard. In Mathematical foundations of computer science 1996 (Cracow), volume 1113 of Lecture Notes in Comput. Sci., pages 494-505. Springer, Berlin, 1996. (Pubitemid 126117917)
19. [Tre01] L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In STOC: ACM Symposium on Theory of Computing (STOC), 2001.
20. [Vaz01] V. V. Vazirani. Approximation algorithms. Springer-Verlag, Berlin, 2001.