Authors
Martin Schoeberl, David Vh Chong, Wolfgang Puffitsch, Jens Sparsø
Publication date
2014
Conference
14th International Workshop on Worst-Case Execution Time Analysis
Publisher
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Description
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.
Total citations
201420152016201720182019202020212022202318105776231
Scholar articles
M Schoeberl, DV Chong, W Puffitsch, J Sparsø - 14th International Workshop on Worst-Case Execution …, 2014