Improving CRPD analysis for EDF scheduling
Fabien Bouquillon, Giuseppe Lipari, Smaïl Niar · Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing · 2022
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.