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 language | English |
---|---|
Title of host publication | 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 12-15 September, Limassol, Cyprus |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1-4 |
Number of pages | 4 |
ISBN (Electronic) | 978-1-5090-6505-9 |
ISBN (Print) | 978-1-5090-6506-6 |
DOIs | |
Publication status | Published - 2017 |
Event | 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017) - Limassol, Cyprus Duration: 12 Sept 2017 → 15 Sept 2017 Conference number: 22 https://etfa2017.org/ |
Conference
Conference | 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2017) |
---|---|
Abbreviated title | ETFA 2017 |
Country/Territory | Cyprus |
City | Limassol |
Period | 12/09/17 → 15/09/17 |
Internet address |