Skip to main content
SpringerLink
Log in

Open problems in real-time scheduling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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).

  • 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 

  • 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.

    Chapter  Google Scholar 

  • 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.

  • 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).

  • Dertouzos, M. (1974). Control robotics: the procedural control of physical processors. In Proceedings of the IFIP congress (pp. 807–813).

  • 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).

  • 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).

  • Eisenbrand, F., & Rothvoss, T. (2010). EDF-schedulability of synchronous periodic task systems is coNP-hard. In ACM-SIAM symposium on algorithms.

  • 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.

  • Karrenbauer, A., & Rothvoss, T. (2009). A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit deadline tasks. Unpublished.

  • Karrenbauer, A., & Rothvoss, T. (2009). An average-case analysis for rate-monotonic multiprocessor real-time scheduling. In European symposium on algorithms.

  • Liu, C., & Layland, J. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1), 46–61.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, NC, USA

    Sanjoy Baruah

  2. Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA

    Kirk Pruhs

Authors
  1. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirk Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kirk Pruhs.

Additional information

S. Baruah was supported in part by NSF Grant Nos. CNS-0408996, CCF-0541056, and CCR-0615197, ARO Grant No. W911NF-06-1-0425, and funding from IBM and the Intel Corporation.

K. Pruhs was supported in part by NSF grants CNS-0325353, CCF-0514058, IIS-0534531, and CCF-0830558, and an IBM Faculty Award.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baruah, S., Pruhs, K. Open problems in real-time scheduling. J Sched 13, 577–582 (2010). https://doi.org/10.1007/s10951-009-0137-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-009-0137-5

Keywords

Search

Navigation