Paper Info
Title
Schedulability Analysis of Non-preemptive Real-Time Scheduling for Multicore Processors with Shared Caches
Abstract
Shared caches in multicore processors introduce serious difficulties in providing guarantees on the real-time properties of embedded software due to the interaction and the resulting contention in the shared caches. To address this problem, we develop a new schedulability analysis for real-time multicore systems with shared caches. To the best of our knowledge, this is the first work that addresses the schedulability problem with inter-core cache interference. We construct an integer programming formulation, which can be transformed to an integer linear programming formulation, to calculate an upper bound on cache interference exhibited by a task within a given execution window. Using the integer programming formulation, an iterative algorithm is presented to obtain the upper bound on cache interference a task may exhibit during one job execution. The upper bound on cache interference is subsequently integrated into the schedulability analysis to derive a new schedulability condition. A range of experiments is performed to investigate how the schedulability is degraded by shared cache interference.
Year
DOI
Venue
2017
10.1109/RTSS.2017.00026
2017 IEEE Real-Time Systems Symposium (RTSS)
Keywords
Field
DocType
Scheduling,Multi-Core-Systems,Shared-Caches
Embedded software,Shared memory,Upper and lower bounds,Computer science,Iterative method,Scheduling (computing),Integer programming,Interference (wave propagation),Multi-core processor,Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
978-1-5386-1416-7
2
PageRank 
References 
Authors
0.35
19
3
Name
Order
Citations
PageRank
Jun Xiao1207.68
Sebastian Altmeyer244229.75
Andy D. Pimentel392465.66