2026-07-23T05:17:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12368 2024-03-06T10:49:48Z ddc:004 open_access

Improving the Accuracy of Cache-Aware Response Time Analysis Using Preemption Partitioning Marković, Filip Carlson, Jan Altmeyer, Sebastian Dobrin, Radu Real-time systems Fixed-Priority Preemptive Scheduling Preemption delay Schedulability analyses for preemptive real-time systems need to take into account cache-related preemption delays (CRPD) caused by preemptions between the tasks. The estimation of the CRPD values must be sound, i.e. it must not be lower than the worst-case CRPD that may occur at runtime, but also should minimise the pessimism of estimation. The existing methods over-approximate the computed CRPD upper bounds by accounting for multiple preemption combinations which cannot occur simultaneously during runtime. This over-approximation may further lead to the over-approximation of the worst-case response times of the tasks, and therefore a false-negative estimation of the system’s schedulability. In this paper, we propose a more precise cache-aware response time analysis for sporadic real-time systems under fully-preemptive fixed priority scheduling. The evaluation shows a significant improvement over the existing state of the art approaches. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Filip Marković and Jan Carlson and Sebastian Altmeyer and Radu Dobrin 2020 Is Part Of LIPIcs, Volume 165, 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2020.5 urn:nbn:de:0030-drops-123682 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2020.5 eng https://creativecommons.org/licenses/by/3.0/legalcode