Skip to main content
SpringerLink
Log in
Book cover

Handbook of Real-Time Computing pp 1–18Cite as

Complexity of Uniprocessor Scheduling Analysis

  • Living reference work entry
  • First Online:

Abstract

When designing a real-time system, a schedulability problem must be solved in order to show that it will meet all timing constraints at runtime. These are decision problems that, given a model of the system as input, answer whether all timing constraints will be met using a particular combination of scheduling algorithm and computer platform. Creating efficient algorithms for solving schedulability problems is a major focus of real-time systems research, but many of these problems are computationally intractable to varying degrees. Here we will review what is currently known about the computational complexity of schedulability problems for some common task models and scheduling algorithms on uniprocessors.

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

References

  • K. Albers, F. Slomka, An event stream driven approximation for the analysis of real-time systems, in Proceedings of the 16th Euromicro Conference on Real-Time Systems (ECRTS), June 2004, pp. 187–195

    Google Scholar 

  • N. Audsley, Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report, University of York, England, 1991

    Google Scholar 

  • S.K. Baruah, Feasibility analysis of recurring branching tasks, in Proceedings of the 10th Euromicro Workshop on Real-Time Systems (EWRTS), 1998, pp. 138–145

    Google Scholar 

  • S.K. Baruah, Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst. 24(1), 93–128 (2003)

    Article  Google Scholar 

  • S.K. Baruah, The non-cyclic recurring real-time task model, in Proceedings of the 31st Real-Time Systems Symposium (RTSS), 2010, pp. 173–182

    Google Scholar 

  • S. Baruah, A.K. Mok, L.E. Rosier, Preemptively scheduling hard-real-time sporadic tasks on one processor, in Proceedings of the 11th Real-Time Systems Symposium (RTSS), 1990a, pp. 182–190

    Google Scholar 

  • S. Baruah, L.E. Rosier, R.R. Howell, Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst. 2(4), 301–324 (1990b)

    Article  Google Scholar 

  • S. Baruah, D. Chen, S. Gorinsky, A.K. Mok, Generalized multiframe tasks. Real-Time Syst. 17, 5–22 (1999)

    Article  Google Scholar 

  • V. Bonifaci, A. Marchetti-Spaccamela, N. Megow, A. Wiese, Polynomial-time exact schedulability tests for harmonic real-time tasks, in Proceedings of the 34th Real-Time Systems Symposium (RTSS), Dec 2013, pp. 236–245

    Google Scholar 

  • M.L. Dertouzos, Control robotics: the procedural control of physical processes, in Proceedings of the IFIP Congress, vol 74, 1974, pp. 807–813

    Google Scholar 

  • F. Eisenbrand, T. Rothvoß, Static-priority real-time scheduling: response time computation is NP-hard, in Proceedings of the 29th Real-Time Systems Symposium (RTSS) (IEEE Computer Society, 2008), pp. 397–406

    Google Scholar 

  • F. Eisenbrand, T. Rothvoß, EDF-schedulability of synchronous periodic task systems is coNP-hard, in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, pp. 1029–1034

    Google Scholar 

  • P. Ekberg, W. Yi, Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization, in Proceedings of the 36th Real-Time Systems Symposium (RTSS), 2015a, pp. 87–95. https://doi.org/10.1109/RTSS.2015.16

  • P. Ekberg, W. Yi, Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete, in Proceedings of the 27th Euromicro Conference on Real-Time Systems (ECRTS), 2015b, pp. 281–286

    Google Scholar 

  • P. Ekberg, W. Yi, Fixed-priority schedulability of sporadic tasks on uniprocessors is NP-hard, in Proceedings of the 38th Real-Time Systems Symposium (RTSS), 2017, pp. 139–146. https://doi.org/10.1109/RTSS.2017.00020

  • N. Fisher, S. Baruah, A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines, in Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS), July 2005, pp. 117–126

    Google Scholar 

  • M.R. Garey, D.S. Johnson, Strong NP-completeness results: motivation, examples, and implications. J. ACM 25(3), 499–508 (1978)

    Article  MathSciNet  Google Scholar 

  • J. Goossens, Scheduling of Hard Real-Time Periodic Systems with Various Kinds of Deadline and Offset Constraints. PhD thesis, Université libre de Bruxelles, 1999

    Google Scholar 

  • M. Joseph, P. Pandya, Finding response times in a real-time system. Comput. J. 29(5), 390–395 (1986)

    Article  MathSciNet  Google Scholar 

  • J.P. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, in Proceedings of the 11th Real-Time Systems Symposium (RTSS), Dec 1990, pp. 201–209

    Google Scholar 

  • J.Y.-T. Leung, M. Merrill, A note on preemptive scheduling of periodic, real-time tasks. Inf. Process. Lett. 11(3), 115–118 (1980)

    Article  MathSciNet  Google Scholar 

  • J.Y.-T. Leung, J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2(4), 237–250 (1982)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • A.K. Mok, D. Chen, A multiframe model for real-time tasks. IEEE Trans. Softw. Eng. 23(10), 635–645 (1997)

    Article  Google Scholar 

  • B. Sprunt, L. Sha, J. Lehoczky, Aperiodic task scheduling for hard-real-time systems. Real-Time Syst. 1(1), 27–60 (1989)

    Article  Google Scholar 

  • M. Stigge, Real-Time Workload Models: Expressiveness vs. Analysis Efficiency. PhD thesis, Uppsala University, Department of Information Technology, 2014

    Google Scholar 

  • M. Stigge, W. Yi, Combinatorial abstraction refinement for feasibility analysis, in Proceedings of the 34th Real-Time Systems Symposium (RTSS), 2013, pp. 340–349

    Google Scholar 

  • M. Stigge, W. Yi, Graph-based models for real-time workload: a survey. Real-Time Syst. 51(5), 602–636 (2015)

    Article  Google Scholar 

  • M. Stigge, P. Ekberg, N. Guan, W. Yi, On the tractability of digraph-based task models, in Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS), July 2011a, pp. 162–171

    Google Scholar 

  • M. Stigge, P. Ekberg, N. Guan, W. Yi, The digraph real-time task model, in Proceedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2011b, pp. 71–80

    Google Scholar 

  • N. Tchidjo Moyo, E. Nicollet, F. Lafaye, C. Moy, On schedulability analysis of non-cyclic generalized multiframe tasks, in Proceedings of the 22nd Euromicro Conference on Real-Time Systems (ECRTS), 2010, pp. 271–278

    Google Scholar 

Download references

Acknowledgements

The authors want to thank Martin Stigge for helpful discussions on this topic.

Author information

Authors and Affiliations

  1. Department of Information Technology, Uppsala University, Uppsala, Sweden

    Pontus Ekberg & Wang Yi

Authors
  1. Pontus Ekberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wang Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pontus Ekberg .

Editor information

Editors and Affiliations

  1. School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, QLD, Australia

    Yu-Chu Tian

  2. School of Electrical and Information Engineering, The University of Sydney, Sydney, NSW, Australia

    David Charles Levy

Section Editor information

  1. School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore

    Arvind Easwaran

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Ekberg, P., Yi, W. (2019). Complexity of Uniprocessor Scheduling Analysis. In: Tian, YC., Levy, D. (eds) Handbook of Real-Time Computing. Springer, Singapore. https://doi.org/10.1007/978-981-4585-87-3_35-1

Download citation

  • DOI: https://doi.org/10.1007/978-981-4585-87-3_35-1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4585-87-3

  • Online ISBN: 978-981-4585-87-3

  • eBook Packages: Springer Reference EngineeringReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation