Integrating cache related pre-emption delay analysis into EDF scheduling

  • Authors:

  • Will Lunniss;Robert I. Davis;Claire Maiza;Sebastian Altmeyer

  • Affiliations:

  • Department of Computer Science, University of York, York, UK;Department of Computer Science, University of York, York, UK;Verimag, Grenoble INP, Grenoble, France;Department of Computer Science, Saarland University, Saarbrücken, Germany

  • Venue:
  • RTAS '13 Proceedings of the 2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cache memories have been introduced into embedded systems to prevent memory access times from becoming an unacceptable performance bottleneck. Memory and cache are split into blocks containing instructions and data. During a pre-emption, blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicited blocks, cache related pre-emption delays (CRPD) are introduced which then affect schedulability of the task. In this paper, we show how existing approaches for calculating CRPD for FP scheduling can be adapted and integrated into schedulability analysis for EDF. We then compare the performance of the different approaches against an existing approach for calculating CRPD for EDF. Using a case study and empirical evaluation, we show the benefits of our CRPD analysis.