Paper Info
Title
Shedding the Shackles of Time-Division Multiplexing
Abstract
Multi-core architectures pose many challenges in real-time systems, which arise from contention between concurrent accesses to shared memory. Among the available memory arbitration policies, Time Division Multiplexing (TDM) ensures a predictable behavior by bounding access latencies and guaranteed bandwidth to tasks independently from the other tasks. To do so, TDM guarantees exclusive access to the shared memory in a fixed time window. TDM, however, provides a low resource utilization as it is non-work-conserving. Besides, it is very inefficient for resources having highly variable latencies, such as sharing the access to a DRAM memory. The constant length of a TDM slot is, hence, highly pessimistic and causes an underutilization of the memory. To address these limitations, we present dynamic arbitration schemes that are based on TDM. However, instead of arbitrating at the level of TDM slots, our approach operates at the granularity of clock cycles by exploiting slack time accumulated from preceding requests. This allows the arbiter to reorder memory requests, exploit the actual access latencies of requests, and thus improve memory utilization. We demonstrate that our policies are analyzable as they preserve the guarantees of TDM in the worst case, while our experiments show an improved memory utilization on average.
Year
DOI
Venue
2018
10.1109/RTSS.2018.00059
2018 IEEE Real-Time Systems Symposium (RTSS)
Keywords
Field
DocType
Time-Division Multiplexing, Dynamic Arbitration, Predictable Computing, Mixed-Criticality Systems
Arbiter,Shared memory,Computer science,Exploit,Bandwidth (signal processing),Schedule,Least slack time scheduling,Arbitration,Time-division multiplexing,Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
978-1-5386-7909-8
3
PageRank 
References 
Authors
0.38
11
4
Name
Order
Citations
PageRank
Farouk Hebbache140.75
Mathieu Jan240225.92
Florian Brandner320214.97
Laurent Pautet446152.73