Timing-aware analysis of shared cache interference for non-preemptive scheduling

Abstract In multi-core architectures, the last-level cache (LLC) is often shared between cores. Sharing the LLC leads to inter-core interference, which impacts system performance and predictability. This means that tasks running in parallel on different cores may experience additional LLC misses as they compete for cache space. To compute a task’s worst-case execution time (WCET), a safe bound on the inter-core cache interference has to be determined. We propose an interference analysis for set-associative shared least-recently-used caches. The analysis leverages timing information to establish tight bounds on the worst-case interference and classifies individual accesses as either cache hits or potential cache misses. We evaluated the analysis performance for systems containing 2 and 4 cores using shared caches up to 64 KB. The evaluation shows an average WCET reduction of up to 23.3% for dual-core systems and 8.5% for quad-core systems.

Authors

Institutions

Publication Details

Journal
Real-Time Systems
Published
2024-09-30
DOI
https://doi.org/10.1007/s11241-024-09430-8
Citations
1
Primary Topic
Real-Time Systems Scheduling
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Timing-aware analysis of shared cache interference for non-preemptive scheduling

Heiko Falk, Thilo L. Fischer
1 citations
Real-Time Systems
Real-Time Systems Scheduling
0.49
article

Timing-aware analysis of shared cache interference for non-preemptive scheduling

Heiko Falk, Thilo L. Fischer
article en
1 citations

Abstract

Abstract In multi-core architectures, the last-level cache (LLC) is often shared between cores. Sharing the LLC leads to inter-core interference, which impacts system performance and predictability. This means that tasks running in parallel on different cores may experience additional LLC misses as they compete for cache space. To compute a task’s worst-case execution time (WCET), a safe bound on the inter-core cache interference has to be determined. We propose an interference analysis for set-associative shared least-recently-used caches. The analysis leverages timing information to establish tight bounds on the worst-case interference and classifies individual accesses as either cache hits or potential cache misses. We evaluated the analysis performance for systems containing 2 and 4 cores using shared caches up to 64 KB. The evaluation shows an average WCET reduction of up to 23.3% for dual-core systems and 8.5% for quad-core systems.

Real-Time SystemsVol. 60(4)
Universität Hamburg (DE), Hamburg University of Technology (DE)
Openalex Percentile: Top 37%
Real-Time Systems Scheduling
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Timing-aware analysis of shared cache interference for non-preemptive scheduling — Heiko Falk, Thilo L. Fischer · Real-Time Systems (2024) | TGRS Research Map | TGRS