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

Robert Davis 1, 2 Marko Bertogna 3 Vincenzo Bonifaci 4
2 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-01231694
Contributor : Robert Davis <>
Submitted on : Friday, November 20, 2015 - 3:14:04 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

Links full text

Identifiers

Collections

Citation

Robert Davis, Marko Bertogna, Vincenzo Bonifaci. On the Compatibility of Exact Schedulability Tests for Global Fixed Priority Preemptive Scheduling with Audsley’s Optimal Priority Assignment Algorithm. Real-Time Systems, Springer Verlag, 2015, ⟨10.1007/s11241-015-9241-0⟩. ⟨hal-01231694⟩

Share

Metrics

Record views

340