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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publication2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 12-15 September, Limassol, Cyprus
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages1-4
Number of pages4
ISBN (Electronic)978-1-5090-6505-9
ISBN (Print)978-1-5090-6506-6
DOIs
Publication statusPublished - 2017
Event22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017) - Limassol, Cyprus
Duration: 12 Sep 201715 Sep 2017
Conference number: 22
https://etfa2017.org/

Conference

Conference22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017)
Abbreviated titleETFA 2017
CountryCyprus
CityLimassol
Period12/09/1715/09/17
Internet address

Fingerprint Dive into the research topics of 'Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds'. Together they form a unique fingerprint.

  • Cite this

    Rivera Verduzco, H. J., & Bril, R. J. (2017). Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds. In 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 12-15 September, Limassol, Cyprus (pp. 1-4). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ETFA.2017.8247732