Journal of Scheduling

, Volume 13, Issue 6, pp 577–582 | Cite as

Open problems in real-time scheduling



We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling seminar.


Real-time scheduling Open problems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baruah, S., Bonifaci, V., Marchetti-Spaccamela, A., & Stiller, S. (2009). Implementation of a speedup-optimal global EDF schedulability test. In Euromicro conference on real-time systems (pp. 259–268). Google Scholar
  2. Baruah, S., Howell, R., & Rosier, L. (1990). Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems: The International Journal of Time-Critical Computing, 2, 301–324. Google Scholar
  3. Baruah, S., Mok, A., & Rosier, L. (1990). Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th real-time systems symposium (pp. 182–190). Orlando, Florida, 1990. New York: IEEE Computer Society Press. CrossRefGoogle Scholar
  4. Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A., & Megow, N. (2010). Algorithms and complexity for periodic real-time scheduling. In AMC-SIAM symposium on discrete algorithms. Google Scholar
  5. Bonifaci, V., Marchetti-Spaccamela, A., & Stiller, S. (2008). A constant-approximate feasibility test for multiprocessor real-time scheduling. In European symposium on algorithms (pp. 210–221). Google Scholar
  6. Dertouzos, M. (1974). Control robotics: the procedural control of physical processors. In Proceedings of the IFIP congress (pp. 807–813). Google Scholar
  7. Eisenbrand, F., & Rothvoss, T. (2008). A pats for static priority real-time scheduling with resource augmentation. In International colloquium on automata, languages and programming (pp. 246–257). Google Scholar
  8. Eisenbrand, F., & Rothvoss, T. (2008). Static-priority real-time scheduling: Response time computation is NP-hard. In Real-time systems symposium, IEEE international (pp. 397–406). Google Scholar
  9. Eisenbrand, F., & Rothvoss, T. (2010). EDF-schedulability of synchronous periodic task systems is coNP-hard. In ACM-SIAM symposium on algorithms. Google Scholar
  10. George, L., Rivierre, N., & Spuri, M. (1996). Preemptive and non-preemptive real-time uniprocessor scheduling (Technical Report RR-2966). INRIA: Institut National de Recherche en Informatique et en Automatique. Google Scholar
  11. Karrenbauer, A., & Rothvoss, T. (2009). A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit deadline tasks. Unpublished. Google Scholar
  12. Karrenbauer, A., & Rothvoss, T. (2009). An average-case analysis for rate-monotonic multiprocessor real-time scheduling. In European symposium on algorithms. Google Scholar
  13. Liu, C., & Layland, J. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1), 46–61. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Computer ScienceThe University of North Carolina at Chapel HillChapel HillUSA
  2. 2.Computer Science DepartmentUniversity of PittsburghPittsburghUSA

Personalised recommendations