Skip to main content
Springer Nature Link
Log in

Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Fixed-priority multiprocessor schedulers are often preferable to dynamic-priority ones because they entail less overhead, are easier to implement, and enable certain tasks to be favored over others. Under global fixed-priority (G-FP) scheduling, as applied to the standard sporadic task model, response times for low-priority tasks may be unbounded, even if the total task system utilization is low. In this paper, it is shown that this negative result can be circumvented if different jobs of the same task are allowed to execute in parallel. In particular, a response-time bound is presented for task systems that allow intra-task parallelism. This bound merely requires that the total utilization does not exceed the overall processing capacity—individual task utilizations need not be further restricted. This result implies that G-FP is optimal for scheduling soft real-time tasks that require bounded tardiness, if intra-task parallelism is allowed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Audsley N (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Citeseer

  • Baker T (2005) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech. Rep. TR-050601, Department of Computer Science, Florida State University

  • Baker T, Baruah S (2009) An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems. Real Time Syst 43(1):3–24

    Article  Google Scholar 

  • Baruah S, Baker T (2008) Schedulability analysis of global EDF. Real Time Syst 38(3):223–235

    Article  Google Scholar 

  • Baruah S, Fisher N (2008) Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In: Proceedings of the 9th international conference on distributed computing and networking, pp 215–226

  • Bertogna M, Cirinei M, Lipari G (2005) Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the 17th Euromicro conference on real-time systems, pp 209–218

  • Bril R, Altmeyer S, van den Heuvel M, Davis R, Behnam M (2017) Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation. Real Time Syst 53:403–466

    Article  Google Scholar 

  • Davis R, Burns A (2009) Priority assignment for global fixed-priority preemptive scheduling in multiprocessor real-time systems. In: Proceedings of the 30th IEEE real-time systems symposium, pp 398–409

  • Davis R, Burns A (2011) Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real Time Syst 47(1):1–40

    Article  Google Scholar 

  • Devi U (2006) Soft real-time scheduling on multiprocessors. Ph.D. thesis, University of North Carolina at Chapel Hill

  • Devi U, Anderson J (2005) Tardiness bounds for global EDF scheduling on a multiprocessor. In: Proceedings of the 26th IEEE real-time systems symposium, pp 330–341

  • Devi U, Anderson J (2008) Tardiness bounds under global EDF scheduling on a multiprocessor. Real Time Syst 38(2):133–189

    Article  Google Scholar 

  • Erickson J, Anderson J (2011) Response time bounds for G-EDF without intra-task precedence constraints. In: Proceedings of the 15th international conference on principles of distributed systems, pp 128–142

  • Express Logic Inc.: Threadx (2019). https://rtos.com/solutions/threadx/real-time-operating-system/

  • Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of the 22nd IEEE real-time systems symposium, pp 73–83

  • Ghattas R, Dean A (2007) Preemption threshold scheduling: Stack optimality, enhancements and analysis. In: Proceedings of the 13th IEEE real time and embedded technology and applications symposium, pp 147–157

  • Keskin U, Bril R, Lukkien J (2010) Exact response-time analysis for fixed-priority preemption-threshold scheduling. In: Proceedings of the 15th IEEE conference on emerging technologies & factory automation, pp 1–4. IEEE

  • Leontyev H, Anderson J (2007) Tardiness bounds for EDF scheduling on multi-speed multicore platforms. In: Proceedings of the 13th IEEE international conference on embedded and real-time computing systems and applications, pp 103–110

  • Leung J (1989) A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4(1–4):209

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Li C, Lee C (1997) Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96(3):564–569

    Article  Google Scholar 

  • Regehr J (2002) Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proceedings of the 23rd IEEE real-time systems symposium, pp 315–326

  • Saksena M, Wang Y (2000) Scalable real-time system design using preemption thresholds. In: Proceedings 21st IEEE real-time systems symposium, pp 25–34. IEEE

  • Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615–1635

    Article  Google Scholar 

  • Voronov S, Anderson J, Yang K (2018) Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints. In: Proceedings of the 26th international conference on real-time networks and systems, pp 8–18

  • Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of sixth international conference on real-time computing systems and applications (RTCSA’99) (Cat. No. PR00306), pp 328–335. IEEE

  • Yang K, Anderson J (2014) Optimal GEDF-based schedulers that allow intra-task parallelism on heterogeneous multiprocessors. In: Proceedings of the 12th IEEE symposium on embedded systems for real-time multimedia, pp 30–39

  • Yang K, Yang M, Anderson J (2016) Reducing response-time bounds for DAG-based task systems on heterogeneous multicore platforms. In: Proceedings of the 24th international conference on real-time networks and systems, pp 349–358

  • Yang M, Amert T, Yang K, Otterness N, Anderson J, Smith F, Wang S (2018) Making OpenVX really ‘real time’. In: Proceedings of the 39th IEEE real-time systems symposium, pp 80–93

Download references

Acknowledgements

This work supported by NSF Grants CNS 1409175, CPS 1446631, CNS 1563845, and CNS 1717589, ARO Grant W911NF-17-1-0294, and funding from General Motors

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, 201 S. Columbia St., Chapel Hill, NC, 27599, USA

    Sergey Voronov & James H. Anderson

  2. Department of Computer Science, Texas State University, 601 University Dr., San Marcos, TX, 78666, USA

    Kecheng Yang

Authors
  1. Sergey Voronov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James H. Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kecheng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey Voronov.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Voronov, S., Anderson, J.H. & Yang, K. Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints. Real-Time Syst 57, 4–54 (2021). https://doi.org/10.1007/s11241-020-09360-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-020-09360-1

Keywords