A Time-predictable Memory Network-on-Chip

Martin Schoeberl, David VH Chong, Wolfgang Puffitsch, Jens Sparsø

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

1401 Downloads (Pure)

Abstract

To derive safe bounds on worst-case execution times (WCETs), all components of a computer system need to be time-predictable: the processor pipeline, the caches, the memory controller, and memory arbitration on a multicore processor. This paper presents a solution for time-predictable memory arbitration and access for chip-multiprocessors. The memory network-on-chip is organized as a tree with time-division multiplexing (TDM) of accesses to the shared memory. The TDM based arbitration completely decouples processor cores and allows WCET analysis of the memory accesses on individual cores without considering the tasks on the other cores. Furthermore, we perform local, distributed arbitration according to the global TDM schedule. This solution avoids a central arbiter and scales to a large number of processors.
Original languageEnglish
Title of host publicationProceedings of the 14th International Workshop on Worst-Case Execution Time Analysis (WCET 2014)
EditorsHeiko Falk
PublisherOASICS
Publication date2014
Pages53-62
ISBN (Electronic)978-3-939897-69-9
DOIs
Publication statusPublished - 2014
Event14th International Workshop on Worst-Case Execution Time Analysis - Madrid, Spain
Duration: 18 Jul 201418 Jul 2014
Conference number: 14
http://www.uni-ulm.de/en/in/wcet2014.html

Conference

Conference14th International Workshop on Worst-Case Execution Time Analysis
Number14
Country/TerritorySpain
CityMadrid
Period18/07/201418/07/2014
Internet address
SeriesOpen Access Series in Informatics
Volume39
ISSN2190-6807

Keywords

  • Real-Time Systems
  • Time-predictable Computer Architecture
  • Networkon- Chip
  • Memory Arbitration

Fingerprint

Dive into the research topics of 'A Time-predictable Memory Network-on-Chip'. Together they form a unique fingerprint.

Cite this