Towards optimal priority assignments for real-time tasks with probabilistic arrivals and execution times
Dorin Maxim · HAL (Le Centre pour la Communication Scientifique Directe) · 2012
In this paper we present the problem of optimal priority assignments in fixed priority preemptive single processor systems where tasks have probabilistic arrivals and execution times.We show that Rate Monotic is not optimal for our problem.