On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm.
Robert I. DavisMarko BertognaVincenzo BonifaciPublished in: Real Time Syst. (2016)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- cost function
- learning algorithm
- detection algorithm
- k means
- np hard
- scheduling policies
- globally optimal
- exhaustive search
- search space
- preprocessing
- computational complexity
- probabilistic model
- simulated annealing
- optimal scheduling
- scheduling algorithm
- higher priority
- priority scheduling
- exact solution
- segmentation algorithm
- objective function