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

Reinder Bril Liliana Cucu-Grosjean 1 Joël Goossens 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Communication dans un congrès
the 21st Euromicro Conference on Real-Time Systems - ECRTS'09, WIP session, Jul 2009, Dublin, Ireland. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00432968
Contributeur : Liliana Cucu <>
Soumis le : mardi 17 novembre 2009 - 17:04:19
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05

Identifiants

  • HAL Id : inria-00432968, version 1

Collections

Citation

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. 2009. 〈inria-00432968〉

Partager

Métriques

Consultations de la notice

222