Real-Time Systems

, Volume 52, Issue 1, pp 113–122 | Cite as

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

  • Robert I. Davis
  • Marko Bertogna
  • Vincenzo Bonifaci


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.


Real time scheduling Global fixed priority pre-emptive scheduling Optimal priority assignment Exact schedulability tests Sporadic tasks Periodic tasks 



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


  1. 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 sessionGoogle Scholar
  2. 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, UKGoogle Scholar
  3. Audsley NC (2001) On priority assignment in fixed priority scheduling. Inf Process Lett 79(1):39–44CrossRefzbMATHGoogle Scholar
  4. 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–75Google Scholar
  5. Bonifaci V, Marchetti-Spaccamela A (2012) Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63(4):763–780MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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–405Google Scholar
  7. 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–1640Google Scholar
  8. Bertogna M, Cirinei M (2007) Response time analysis for global scheduled symmetric multiprocessor platforms. In: Proceedings real-time systems symposium (RTSS), p 149–158Google Scholar
  9. Bertogna M, Cirinei M, Lipari G (2009) Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans Parallel Distrib Syst 20(4):553–566CrossRefGoogle Scholar
  10. 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–409Google Scholar
  11. 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–40CrossRefzbMATHGoogle Scholar
  12. Davis RI, Burns A (2011b) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):35CrossRefGoogle Scholar
  13. 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–397Google Scholar
  14. 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–171Google Scholar
  15. 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–195Google Scholar
  16. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Robert I. Davis
    • 1
    • 2
  • Marko Bertogna
    • 3
  • Vincenzo Bonifaci
    • 4
  1. 1.Real-Time Systems Research Group, Department of Computer ScienceUniversity of YorkYorkUK
  2. 2.INRIA, Paris-RocquencourtParisFrance
  3. 3.University of Modena and Reggio EmiliaModenaItaly
  4. 4.Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti” (IASI-CNR)RomeItaly

Personalised recommendations