On the Compatibility of Exact Schedulability Tests for Global Fixed Priority Preemptive Scheduling with Audsley’s Optimal Priority Assignment Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Real-Time Systems Année : 2015

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

Résumé

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.

Dates et versions

hal-01231694 , version 1 (20-11-2015)

Identifiants

Citer

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, 2015, ⟨10.1007/s11241-015-9241-0⟩. ⟨hal-01231694⟩
147 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More