Integrated Analysis of Cache Related Preemption Delays and Cache Persistence Reload Overheads

Research output: Contribution to conferencePaper

Author(s)

  • Syed Aftab Rashid
  • Geoffrey Nelissen
  • Sebastian Altmeyer
  • Robert Ian Davis
  • Eduardo Tovar

Department/unit(s)

Conference

Conference38th IEEE Real-Time Systems Symposium (RTSS 2017)
Conference date(s)6/12/178/12/17

Publication details

DatePublished - 6 Dec 2017
Number of pages11
Original languageEnglish

Abstract

Schedulability analysis for tasks running on microprocessors
with cache memory is incomplete without a treatment
of Cache Related Preemption Delays (CRPD) and Cache
Persistence Reload Overheads (CPRO). State-of-the-art analyses
compute CRPD and CPRO independently, which might result in
counting the same overhead more than once.
In this paper, we analyze the pessimism associated with the
independent calculation of CRPD and CPRO in comparison to
an integrated approach. We answer two main questions: (1) Is it beneficial to integrate the calculation of CRPD and CPRO? (2) When and to what extent can we gain in terms of schedulability by integrating the calculation of CRPD and CPRO? To achieve this, we (i) identify situations where considering CRPD and CPRO separately might result in overestimating the total memory overhead suffered by tasks, (ii) derive new analyses that integrate the calculation of CRPD and CPRO; and (iii) perform a thorough experimental evaluation using benchmarks to compare the performance of the integrated analysis against the separate calculation of CRPD and CPRO.

    Research areas

  • cache related preemption delays, real-time, scheduling, cache persistence reload overheads

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations