On the Compatibility of Exact Schedulability Tests for Global Fixed Priority Preemptive Scheduling with Audsley’s Optimal Priority Assignment Algorithm

Robert Ian Davis, Marko Bertogna, Vincenzo Bonifaci

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalReal-Time Systems
Early online date25 Sept 2015
Publication statusPublished - 2015


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

Cite this