Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds

H.J. Rivera Verduzco, R.J. Bril

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

Fixed-priority scheduling with preemption thresholds (FPTS) is supported by the AUTOSAR and OSEK standards as a scheduling policy. Since FPTS is a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority nonpreemptive scheduling (FPNS), it aims to improve schedulability. In this paper, we prove, as an intermediate step towards the exact best-case response time analysis for FPTS, that the best-case computation time of a non-preemptive task scheduled under FPTS or FPNS is a tight lower bound for its response time. In addition, we illustrate by means of an example that the best-case response time analysis for FPTS is most likely not a straight forward extension of the current best-case analysis for FPPS.
Originele taal-2Engels
Titel2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 12-15 September, Limassol, Cyprus
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's1-4
Aantal pagina's4
ISBN van elektronische versie978-1-5090-6505-9
ISBN van geprinte versie978-1-5090-6506-6
DOI's
StatusGepubliceerd - 2017
Evenement22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017) - Limassol, Cyprus
Duur: 12 sep 201715 sep 2017
Congresnummer: 22
https://etfa2017.org/

Congres

Congres22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017)
Verkorte titelETFA 2017
Land/RegioCyprus
StadLimassol
Periode12/09/1715/09/17
Internet adres

Vingerafdruk

Duik in de onderzoeksthema's van 'Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds'. Samen vormen ze een unieke vingerafdruk.

Citeer dit