2019 IEEE/AIAA 38th Digital Avionics Systems Conference (DASC) 2019
DOI: 10.1109/dasc43569.2019.9081787
|View full text |Cite
|
Sign up to set email alerts
|

Empirical Bounds of Multicore Cache Interference for Real-Time Schedulability Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…This is especially true for a hard real-time system, where accurately computing the Worst-Case Execution Time of the tasks is critical to ensure predictability and increase the platforms' usage rate. Main Memory Fixed priority Isolation technique SRT [22], [71] Main Memory Partitioned fixed-priority Isolation technique SRT [72] Main Memory Partitioned non-preemptive scheduling Memory Contention Analysis SRT [73], [210]- [212] Main Memory Algorithm optimization/Statistical analysis Memory Contention Analysis HRT/SRT [213] Main Memory ILP formulation Interference-Aware Allocation HRT/SRT [214] Memory Bus Partition-based Isolation technique HRT/SRT [43] Memory Bus Global fixed-priority Problem window SRT [215] Memory Bus Deadline-Aware memory Scheduler Memory scheduling SRT [44] Memory Bus Partitioned, time-triggered and non-preemptive Estimate contentions SRT [45] Cache Memory Global Earliest Deadline First Problem window SRT [216] Cache Memory Global Preemptive Fixed-Priority Isolation technique SRT [217] Cache Memory Non-preemptive global scheduling Problem window HRT [47] Cache Memory Non-preemptive global scheduling Problem window HRT [49] Cache Memory Partitioned scheduling Isolation technique SRT [50] Cache Memory Partitioned scheduling Problem window/Isolation SRT [46] Cache Memory Schedulability Analysis Empirical Bounds SRT [219] Cache Memory Non-preemptive partitioned Reuse of the cache SRT [220] Cache Memory Energy-efficient Scheduling Energy minimization SRT [221] Multiple resource Fixed priority Problem window SRT [209] Multiple resource Fixed priority preemptive Symmetric analysis SRT [51] Multiple resource Symbolic model checking Isolation technique SRT [54] Multiple resource Resource-Oriented Partitioned Task partitioning SRT [224] Multiple resource Fixed-priority preemptive partitioned Static analysis HRT [55] Multiple resource Partitioned fixed-priority Resource-aware partitioning SRT [52] Multiple resource Partitioned scheduling Task partitioning SRT [56] Multiple resource Global sche...…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This is especially true for a hard real-time system, where accurately computing the Worst-Case Execution Time of the tasks is critical to ensure predictability and increase the platforms' usage rate. Main Memory Fixed priority Isolation technique SRT [22], [71] Main Memory Partitioned fixed-priority Isolation technique SRT [72] Main Memory Partitioned non-preemptive scheduling Memory Contention Analysis SRT [73], [210]- [212] Main Memory Algorithm optimization/Statistical analysis Memory Contention Analysis HRT/SRT [213] Main Memory ILP formulation Interference-Aware Allocation HRT/SRT [214] Memory Bus Partition-based Isolation technique HRT/SRT [43] Memory Bus Global fixed-priority Problem window SRT [215] Memory Bus Deadline-Aware memory Scheduler Memory scheduling SRT [44] Memory Bus Partitioned, time-triggered and non-preemptive Estimate contentions SRT [45] Cache Memory Global Earliest Deadline First Problem window SRT [216] Cache Memory Global Preemptive Fixed-Priority Isolation technique SRT [217] Cache Memory Non-preemptive global scheduling Problem window HRT [47] Cache Memory Non-preemptive global scheduling Problem window HRT [49] Cache Memory Partitioned scheduling Isolation technique SRT [50] Cache Memory Partitioned scheduling Problem window/Isolation SRT [46] Cache Memory Schedulability Analysis Empirical Bounds SRT [219] Cache Memory Non-preemptive partitioned Reuse of the cache SRT [220] Cache Memory Energy-efficient Scheduling Energy minimization SRT [221] Multiple resource Fixed priority Problem window SRT [209] Multiple resource Fixed priority preemptive Symmetric analysis SRT [51] Multiple resource Symbolic model checking Isolation technique SRT [54] Multiple resource Resource-Oriented Partitioned Task partitioning SRT [224] Multiple resource Fixed-priority preemptive partitioned Static analysis HRT [55] Multiple resource Partitioned fixed-priority Resource-aware partitioning SRT [52] Multiple resource Partitioned scheduling Task partitioning SRT [56] Multiple resource Global sche...…”
Section: Discussionmentioning
confidence: 99%
“…Using an iterative algorithm obtains the upper limit of cache interference in executing a task and later integrates it in the schedulability analysis. In this aspect, Srinivasan et al [46] presented an interesting paper trying to define empirical bounds of multicore cache interference for real-time schedulability analysis.…”
Section: ) Cache Interferencementioning
confidence: 99%