On the Compatibility of Exact Schedulability Tests for Global Fixed Priority Preemptive Scheduling with Audsley’s Optimal Priority Assignment Algorithm
R.I. Davis, M. Bertogna and V. Bonifaci
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.
BibTex Entry
@article{Davis2015c,
author = {R.I. Davis and M. Bertogna and V. Bonifaci,},
journal = {Real-Time Systems},
month = {Sept},
title = {On the Compatibility of Exact Schedulability Tests for Global Fixed Priority Preemptive Scheduling with Audsley’s Optimal Priority Assignment Algorithm},
year = {2015}
}