Dynamic Arbitration of Memory Requests with TDM-like Guarantees

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.

Complete list of metadatas

Contributor : Telecomparis Hal <>
Submitted on : Friday, September 13, 2019 - 5:17:56 PM
Last modification on : Friday, October 18, 2019 - 1:50:02 PM


  • HAL Id : hal-02287739, version 1


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⟩



Record views