HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Improving CRPD Analysis for EDF Scheduling: Trading Speed for Precision

Abstract : Cache Related Preemption Delay (CRPD) analysis is a methodology for bounding the cost of cache reloads due to preemptions. Many techniques have been proposed to estimate upper bounds to the CRPD for Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling. Given the complexity of the problem, existing methods make simplifying assumptions to speed up the analysis, but they also introduce large amounts of pessimism. In this paper we present two contributions for reducing the pessimism in the CRPD analysis of real-time systems that use setassociative cache memories. First, we present a new way to compute a bound on the number of preemptions on a task under EDF scheduling. Second, we propose a novel algorithm that trades off speed for precision in state-of-the-art analysis in the literature. We show improvements in the schedulability ratio on classical benchmarks in comparison with the state-of-the-art.
Complete list of metadata

Contributor : Giuseppe Lipari Connect in order to contact the contributor
Submitted on : Tuesday, January 18, 2022 - 11:03:31 AM
Last modification on : Wednesday, March 23, 2022 - 3:51:35 PM


Files produced by the author(s)



Giuseppe Lipari, Fabien Bouquillon, Smail Niar. Improving CRPD Analysis for EDF Scheduling: Trading Speed for Precision. The 37th ACM/SIGAPP Symposium On Applied Computing, Apr 2022, Brno, Czech Republic. ⟨10.1145/3477314.3507027⟩. ⟨hal-03531143⟩



Record views


Files downloads