By the same authors

From the same journal

From the same journal

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

Research output: Contribution to journalArticle



Publication details

JournalReal-Time Systems
DateE-pub ahead of print - 25 Sep 2015
DatePublished (current) - 2015
Number of pages10
Pages (from-to)1-10
Early online date25/09/15
Original languageEnglish


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.

    Research areas

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


Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations