Towards Predictable Multi-core Platforms for Safety Critical Real-Time Systems

Funder

Organizational Unit

Publications

Bounding Cache Persistence Reload Overheads for Set-Associative Caches

Publication . Rashid, Syed Aftab; Nelissen, Geoffrey; Tovar, Eduardo

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.

2020Conference object

Restricted access

Funding agency

Fundação para a Ciência e a Tecnologia

Funding programme

POR_NORTE

Funding Award Number

SFRH/BD/119150/2016