Bounding cache persistence reload overheads for set-associative caches

Syed Aftab Rashid, Geoffrey Nelissen, Eduardo Tovar

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Cache memories have a strong impact on the response time of tasks executed on modern computing platforms. For tasks scheduled under fixed-priority preemptive scheduling (FPPS), the worst-case response time (WCRT) analyses that account for cache persistence between jobs along with cache related preemption delays (CRPDs) have been shown to dominate analyses that only consider CRPDs. Yet, the existing approaches that analyze cache persistence in the context of WCRT analysis can only support direct-mapped caches. In this work, we analyze cache persistence in the context of WCRT analysis for set-associative caches. The main contributions of this work are: (i) to propose a solution to find persistent cache blocks (PCBs) of tasks considering set-associative caches, (ii) to present three different approaches to calculate cache persistence reload overheads (CPROs), i.e., the memory overhead due to eviction of PCBs of tasks, under set-associative caches, and (iii) an experimental evaluation showing that our proposed approaches result in up to 22 percentage points higher task set schedulability than the state-of-the-art approaches.

Original languageEnglish
Title of host publication2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2020
PublisherInstitute of Electrical and Electronics Engineers
ISBN (Electronic)9781728144030
DOIs
Publication statusPublished - Aug 2020
Event26th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2020 - Virtual, Gangnueng, Korea, Republic of
Duration: 19 Aug 202021 Aug 2020

Conference

Conference26th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2020
CountryKorea, Republic of
CityVirtual, Gangnueng
Period19/08/2021/08/20

Fingerprint Dive into the research topics of 'Bounding cache persistence reload overheads for set-associative caches'. Together they form a unique fingerprint.

Cite this