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.
Type de document :
Communication dans un congrès
19th International Conference on Real-Time and Network Systems - RTNS 2011, Sep 2011, Nantes, France. 2011
Liste complète des métadonnées

https://hal.inria.fr/inria-00614480
Contributeur : Liliana Cucu <>
Soumis le : jeudi 11 août 2011 - 16:41:57
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05

Identifiants

  • 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. 2011. 〈inria-00614480〉

Partager

Métriques

Consultations de la notice

291