Dynamic Arbitration of Memory Requests with TDM-like Guarantees - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Dynamic Arbitration of Memory Requests with TDM-like Guarantees

(1, 2, 3) , (1) , (2, 3) , (2, 3)
1
2
3

Abstract

A major challenge with multi-cores in real-time systems is contention between concurrent accesses to shared memory. Dynamic arbitration schemes allow for an optimal utilization of the system's memory, while sacrificing time predictability. Time-Division multiplexing (TDM), on the other hand, sacrifices average-case performance in favor of predictability. In this work, we explore a dynamic arbitration scheme that is essentially based on TDM, and thus preserves many of its guarantees.
Not file

Dates and versions

hal-02287739 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02287739 , version 1

Cite

Farouk Hebbache, Mathieu Jan, Florian Brandner, Laurent Pautet. Dynamic Arbitration of Memory Requests with TDM-like Guarantees. Workshop on Compositional Theory and Technology for Real-Time Embedded Systems, Dec 2017, Paris, France. ⟨hal-02287739⟩
126 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More