Towards optimal priority assignment for probabilistic real-time systems with variable execution times

Dorin Maxim 1 Liliana Cucu-Grosjean 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we deal with fixed-priority scheduling of synchronous periodic task systems with variable execution times. The tasks have variable execution times given by independent discrete random variables (that we consider known) and we study the existence of an optimal priority assignment algorithm for such tasks. We provide a first result indicating that Rate Monotonic is not optimal and we prove that optimal priority assignment al- gorithms do exist. Moreover a first intuitive algorithm, that orders the tasks according to their probability of meeting the deadlines, is proved not optimal.
Type de document :
Communication dans un congrès
3rd Junior Researcher Workshop on Real-Time Computing - JRWRTC 2009, Oct 2009, Paris, France. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00433897
Contributeur : Liliana Cucu-Grosjean <>
Soumis le : vendredi 20 novembre 2009 - 14:32:46
Dernière modification le : jeudi 6 septembre 2018 - 11:32:01

Identifiants

  • HAL Id : inria-00433897, version 1

Collections

Citation

Dorin Maxim, Liliana Cucu-Grosjean. Towards optimal priority assignment for probabilistic real-time systems with variable execution times. 3rd Junior Researcher Workshop on Real-Time Computing - JRWRTC 2009, Oct 2009, Paris, France. 2009. 〈inria-00433897〉

Partager

Métriques

Consultations de la notice

233