Exploiting multi-level scratchpad memories for time-predictable multicore computing

In modern multicore processor architectures, caches are widely used to shorten the speed gap between the processor and the memory. However, caches are time unpredictable, especially the shared L2 cache used by different cores in a multicore processor. This paper studies several time-predictable scratchpad memory (SPM) based architectures for multicore processors. We propose the dynamic memory objects allocation-based partition, the static allocation-based partition, and the static allocation-based priority L2 SPM strategy to retain the characteristic of time predictability of SPMs while trying to maximize the performance and energy efficiency. Our experimental results indicate the strengths and weaknesses of each proposed architecture and allocation method, which offers interesting memory design options to enable real-time multicore computing.

[1]  Kanad Ghose,et al.  Analytical energy dissipation models for low-power caches , 1997, ISLPED '97.

[2]  Peter Marwedel,et al.  Overlay techniques for scratchpad memories in low power embedded processors , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Vincenzo Catania,et al.  EPIC-Explorer: A Parameterized VLIW-based Platform Framework for Design Space Exploration , 2003, ESTImedia.

[4]  Peter Marwedel,et al.  Assigning program and data objects to scratchpad for energy reduction , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[5]  K. Ghose,et al.  Analytical energy dissipation models for low power caches , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

[6]  Rajeev Barua,et al.  An optimal memory allocation scheme for scratch-pad-based embedded systems , 2002, TECS.

[7]  Wei Zhang,et al.  Exploiting time predictable two-level scratchpad memory for real-time systems , 2011, SAC '11.