Skip to main content
SpringerLink
Log in

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

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

Abstract

Audsley’s optimal priority assignment (OPA) algorithm can be applied to multiprocessor scheduling provided that three conditions hold with respect to the schedulability tests used. In this short paper, we prove that no exact test for global fixed priority pre-emptive scheduling of sporadic tasks can be compatible with Audsley’s algorithm, and hence the OPA algorithm cannot be used to obtain an optimal priority assignment for such systems.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Note all exact tests give the same result.

  2. Or task C, since they have the same parameters and so are interchangeable.

References

  • Andersson B, Jonsson J (2000) Some insights on fixed-priority pre-emptive non-partitioned multiprocessor scheduling. In: Proceedings real-time systems symposium (RTSS)—work-in-progress session

  • Audsley NC (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report YCS 164. Deptartment of Computer Science, University of York, UK

  • Audsley NC (2001) On priority assignment in fixed priority scheduling. Inf Process Lett 79(1):39–44

    Article  MATH  Google Scholar 

  • Baker TP, Cirinei M (2007) Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In: Proceedings of the 11th international conference on principles of distributed systems (OPODIS). Lecture Notes in Computer Science (LNCS), vol 4878. Springer, Berlin, Heidelberg, p 62–75

  • Bonifaci V, Marchetti-Spaccamela A (2012) Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63(4):763–780

    Article  MathSciNet  MATH  Google Scholar 

  • Cucu L, Goossens J (2006) Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors. In: Proceedings emerging technologies and factory automation (ETFA), p 397–405

  • Cucu L, Goossens J (2007) Feasibility intervals for multiprocessor fixed-priority scheduling of arbitrary deadline periodic systems. In: Proceedings design automation and test in Europe (DATE), p 1635–1640

  • Bertogna M, Cirinei M (2007) Response time analysis for global scheduled symmetric multiprocessor platforms. In: Proceedings real-time systems symposium (RTSS), p 149–158

  • Bertogna M, Cirinei M, Lipari G (2009) Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans Parallel Distrib Syst 20(4):553–566

    Article  Google Scholar 

  • Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Proceedings 30th IEEE real-time systems symposium (RTSS’09), p 398–409

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

    Article  MATH  Google Scholar 

  • Davis RI, Burns A (2011b) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):35

    Article  Google Scholar 

  • Guan N, Stigge M, Yi W, Yu G (2009) New response time bounds for fixed priority multiprocessor scheduling. In: Proceedings of the real-time systems symposium, p 388–397

  • Ha R, Liu JWS (1994) Validating timing constraints in multiprocessor and distributed real-time systems. In: Proceedings of the international conference on distributed computing systems, p 162–171

  • Lauzac S, Melhem R, Mosse D (1998) Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor. In: Proceedings of the euromicro workshop on real-time systems, p 188–195

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was partially funded by the UK EPSRC MCC Project (EP/K011626/1), and the Inria International Chair program.

Author information

Authors and Affiliations

  1. Real-Time Systems Research Group, Department of Computer Science, University of York, York, UK

    Robert I. Davis

  2. INRIA, Paris-Rocquencourt, Paris, France

    Robert I. Davis

  3. University of Modena and Reggio Emilia, Modena, Italy

    Marko Bertogna

  4. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti” (IASI-CNR), Rome, Italy

    Vincenzo Bonifaci

Authors
  1. Robert I. Davis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marko Bertogna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincenzo Bonifaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert I. Davis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Davis, R.I., Bertogna, M. & Bonifaci, V. On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm. Real-Time Syst 52, 113–122 (2016). https://doi.org/10.1007/s11241-015-9241-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-015-9241-0

Keywords

Search

Navigation