Exact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Exact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines

Reinder Bril
  • Fonction : Auteur
  • PersonId : 864764
Liliana Cucu-Grosjean
  • Fonction : Auteur
  • PersonId : 844766
Joël Goossens
  • Fonction : Auteur
  • PersonId : 830909

Résumé

In this paper, we present a conjecture for exact best-case response times of periodic released, independent real-time tasks with arbitrary deadlines that are scheduled by means of fixed-priority pre-emptive scheduling (FPPS). We illustrate the analysis by means of an example. Apart from having a value on its own whenever timing constraints include lower bounds on response times of a system to events, the novel analysis allows for an improvement of existing end-to- end response time analysis in distributed systems, i.e. where the finalization of one task on a processor activates another task on another processor.
Fichier non déposé

Dates et versions

inria-00432968 , version 1 (17-11-2009)

Identifiants

  • HAL Id : inria-00432968 , version 1

Citer

Reinder Bril, Liliana Cucu-Grosjean, Joël Goossens. Exact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines. the 21st Euromicro Conference on Real-Time Systems - ECRTS'09, WIP session, Jul 2009, Dublin, Ireland. ⟨inria-00432968⟩
106 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More