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

被引:0
|
作者
Fischer, Thilo L. [1 ]
Falk, Heiko [1 ]
机构
[1] Hamburg Univ Technol, Inst Embedded Syst, Schwarzenberg Campus 1, D-21073 Hamburg, Germany
关键词
Shared cache; WCET analysis; Multi-core; Event-arrival curve; PREEMPTION DELAY; PERFORMANCE;
D O I
10.1007/s11241-024-09430-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:55
相关论文
共 50 条
  • [1] Simulating Preemptive Scheduling with Timing-aware Blocks in Simulink
    Naderlinger, Andreas
    [J]. PROCEEDINGS OF THE 2017 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2017, : 758 - 763
  • [2] Design and Timing Guarantee for Non-Preemptive Gang Scheduling
    Lee, Seongtae
    Guan, Nan
    Lee, Jinkyu
    [J]. 2022 IEEE 43RD REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2022), 2022, : 132 - 144
  • [3] An Exact and Sustainable Analysis of Non-Preemptive Scheduling
    Nasri, Mitra
    Brandenburg, Bjoern B.
    [J]. 2017 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS), 2017, : 12 - 23
  • [4] Learning and backtracking in non-preemptive scheduling of tasks under timing constraints
    Laalaoui, Yacine
    Drias, Habiba
    [J]. SOFT COMPUTING, 2011, 15 (06) : 1071 - 1086
  • [5] Cache Interference-aware Task Partitioning for Non-preemptive Real-time Multi-core Systems
    Xiao, Jun
    Shen, Yixian
    Pimentel, Andy D.
    [J]. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2022, 21 (03)
  • [6] Schedulability Analysis of Non-preemptive Real-time Scheduling for Multicore Processors with Shared Caches
    Xiao, Jun
    Altmeyer, Sebastian
    Pimentel, Andy
    [J]. 2017 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS), 2017, : 199 - 208
  • [7] Non-preemptive scheduling of optical switches
    Kesselman, A
    Kogan, K
    [J]. GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 1840 - 1844
  • [8] NON-PREEMPTIVE PRIORITIES IN MACHINE INTERFERENCE
    HODGSON, V
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (05): : 1600 - &
  • [9] Non-preemptive Coflow Scheduling and Routing
    Yu, Ruozhou
    Xue, Guoliang
    Zhang, Xiang
    Tang, Jian
    [J]. 2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [10] From Preemptive to Non-preemptive Scheduling Using Rejections
    Lucarelli, Giorgio
    Srivastav, Abhinav
    Trystram, Denis
    [J]. COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 510 - 519