Worst-Case Communication Overhead in a Many-Core based Shared-Memory Model - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Worst-Case Communication Overhead in a Many-Core based Shared-Memory Model

Résumé

With emerging many-core architectures, using on-chip shared memories is an interesting approach because it provides high bandwidth and high throughput data exchange. Such a feature is usually implemented as a multi-bus multi-banked memory. Since predicting timing behavior is key to efficient design and verification of embedded real-time systems, the question that arises is how to evaluate the access time for one memory access of a given task while others may concurrently access the same memory-bank at t the same time. In this paper, we give the answers for a subset of streaming applications modeled like CSDF Model of Computation and implemented in Kalray’s MPPA chip.
Fichier principal
Vignette du fichier
dkhil_12711.pdf (277.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01239714 , version 1 (09-12-2015)

Identifiants

  • HAL Id : hal-01239714 , version 1
  • OATAO : 12711

Citer

Amira Dkhil, Stéphane Louise, Christine Rochange. Worst-Case Communication Overhead in a Many-Core based Shared-Memory Model. 7th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2013), Oct 2013, Sophia Antipolis, France. pp.53-56. ⟨hal-01239714⟩
143 Consultations
108 Téléchargements

Partager

Gmail Facebook X LinkedIn More