Skip to Main content Skip to Navigation
Conference papers

On the Optimality of Priority Assignment for Probabilistic Real-Time Systems

Dorin Maxim 1 Olivier Buffet 2 Luca Santinelli 1 Liliana Cucu-Grosjean 1 Rob Davis 3
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we have identified three sub-problems re- lated to the optimal priority assignment for real-time sys- tems with probabilistic execution times when scheduled preemptively on one processor according to fixed prior- ities. For each sub-problem we propose an algorithm that is proved optimal. The first two algorithms are inspired from an existing priority assignment known as Audsley's algorithm which is a greedy (lowest priority first) algo- rithm. Since we prove that such greedy algorithm is not suitable for the third problem, we propose a tree search algorithm in this case.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00614480
Contributor : Liliana Cucu-Grosjean <>
Submitted on : Thursday, August 11, 2011 - 4:41:57 PM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM

Identifiers

  • HAL Id : inria-00614480, version 1

Collections

Citation

Dorin Maxim, Olivier Buffet, Luca Santinelli, Liliana Cucu-Grosjean, Rob Davis. On the Optimality of Priority Assignment for Probabilistic Real-Time Systems. 19th International Conference on Real-Time and Network Systems - RTNS 2011, Sep 2011, Nantes, France. ⟨inria-00614480⟩

Share

Metrics

Record views

312