Towards optimal priority assignment for probabilistic real-time systems with variable execution times - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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

Dorin Maxim
  • Function : Author
  • PersonId : 864858
Liliana Cucu-Grosjean
  • Function : Author
  • PersonId : 844766

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.
No file

Dates and versions

inria-00433897 , version 1 (20-11-2009)

Identifiers

  • HAL Id : inria-00433897 , version 1

Cite

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. ⟨inria-00433897⟩
107 View
0 Download

Share

Gmail Facebook X LinkedIn More