Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability. We derive a technique possessing these properties for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.

A response time bound in fixed-priority scheduling with arbitrary deadlines

BINI, Enrico;
2009-01-01

Abstract

Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability. We derive a technique possessing these properties for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.
2009
File in questo prodotto:
File Dimensione Formato  
officialPaper.pdf

non disponibili

Tipologia: Documento in Post-print/Accepted manuscript
Licenza: Non pubblico
Dimensione 727.03 kB
Formato Adobe PDF
727.03 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11382/200352
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 66
social impact