On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

Real-Time Systems, Volume 52, Issue 1, 2015, Pages 113.0-122.0.

Cited by: 1|Views16
EI

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,...More

Code:

Data:

Your rating :
0

 

Tags
Comments