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

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.
Type de document :
Article dans une revue
Real-Time Systems, Springer Verlag, 2015, <10.1007/s11241-015-9241-0>
Liste complète des métadonnées

https://hal.inria.fr/hal-01231694
Contributeur : Robert Davis <>
Soumis le : vendredi 20 novembre 2015 - 15:14:04
Dernière modification le : samedi 21 novembre 2015 - 01:06:09

Identifiants

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>

Partager

Métriques

Consultations de la notice

82