EDF-schedulability of synchronous periodic task systems is coNP-hard

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1029-1034

  Eisenbrand, Friedrich ^a   Rothvoß, Thomas ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; SCHEDULING ALGORITHMS;

DIOPHANTINE APPROXIMATION; EARLIEST DEADLINE FIRST; HARDNESS RESULT; INAPPROXIMABILITY; PERIODIC TASK SYSTEMS; REAL - TIME SCHEDULING; RELATIVE DEADLINES; SCHEDULING POLICIES;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 77951682300     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.83     Document Type: Conference Paper

References (24)

1. K. ALBERS AND F. SLOMKA, An event stream driven approximation for the analysis of real-time systems, in ECRTS, IEEE Computer Society, 2004, pp. 187-195.
2. -, Efficient feasibility analysis for real-time systems with EDF scheduling, in DATE, IEEE Computer Society, 2005, pp. 492-497.
3. S. K. BARUAH, D. CHEN, S. GORINSKY, AND A. K. MOK, Generalized multiframe tasks, Real-Time Systems, 17 (1999), pp. 5-22.
4. S. K. BARUAH AND J. GOOSSENS, Scheduling real-time tasks: Algorithms and complexity, in Handbook of Scheduling - Algorithms, Models, and Performance Analysis, J. Y.-T. Leung, ed., Chapman & Hall/CRC, 2004, ch. 28.
5. S. K. BARUAH, A. K. MOK, AND L. E. ROSIER, Preemptively scheduling hard-real-time sporadic tasks on one processor, in IEEE Real-Time Systems Symposium, 1990, pp. 182-190.
6. S. K. BARUAH AND K. PRUHS, Open problems in real-time scheduling, To appear in: Journal of Scheduling, (2009).
7. V. BONIFACI, A. MARCHETTI-SPACCAMELA, AND S. STILLER, A constant-approximate feasibility test for multiprocessor real-time scheduling, in ESA, D. Halperin and K. Mehlhorn, eds., vol. 5193 of Lecture Notes in Computer Science, Springer, 2008, pp. 210-221.
8. G. BUTTAZZO, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Kluwer Academic Publishers, Boston, USA, 2000.
9. S. CHAKRABORTY, S. KÜNZLI, AND L. THIELE, Approximate schedulability analysis, in IEEE Real-Time Systems Symposium, 2002, pp. 159-168.
10. ∞), Information Processing Letters, 101 (2007), pp. 174-179.
11. M. L. DERTOUZOS, Control robotics: The procedural control of physical processes, in IFIP Congress, 1974, pp. 807-813.
12. U. C. DEVI, An improved schedulability test for uniprocessor periodic task systems, in ECRTS, IEEE Computer Society, 2003, p. 23.
13. F. EISENBRAND AND T. ROTHVOSS, Static-priority Real-time Scheduling: Response Time Computation is NP-hard, in IEEE Real-Time Systems Symposium (RTSS), 2008.
14. F. EISENBRAND AND T. ROTHVOSS, New hardness results for diophantine approximation, in 12-th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009), LNCS, Springer, 2009.
15. N. FISHER AND S. K. BARUAH, A fully polynomial-time 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), Washington, DC, USA, 2005, IEEE Computer Society, pp. 117-126.
16. J. C. LAGARIAS, The computational complexity of simultaneous Diophantine approximation problems, SIAM Journal on Computing, 14 (1985), pp. 196-209. (Pubitemid 15494396)
17. J. LEUNG, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Inc., Boca Raton, FL, USA, 2004.
18. J. Y.-T. LEUNG AND M. L. MERRILL, A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, 11 (1980), pp. 115-118.
19. C. L. LIU AND J. W. LAYLAND, Scheduling algorithms for multiprogramming in a hard-real-time environment, Journal of the Association for Computing Machinery, 20 (1973), pp. 46-61.
20. I. NIVEN, H. S. ZUCKERMAN, AND H. L. MONTGOMERY, An introduction to the theory of numbers, John Wiley & Sons Inc., New York, fifth ed., 1991.
21. R. PELLIZZONI AND G. LIPARI, A new sufficient feasibility test for asynchronous real-time periodic task sets, in ECRTS, IEEE Computer Society, 2004, pp. 204-211.
22. C. RÖSSNER AND J. P. SEIFERT, Approximating good simultaneous Diophantine approximations is almost NP-hard, in Mathematical foundations of computer science 1996 (Cracow), vol. 1113 of Lecture Notes in Comput. Sci., Springer, Berlin, 1996, pp. 494-505.
23. V. V. VAZIRANI, Approximation algorithms, Springer-Verlag, Berlin, 2001.
24. I. WEGENER, Complexity theory, Springer-Verlag, Berlin, 2005. Exploring the limits of efficient algorithms, Translated from the German by Randall Pruim.