A recursive algorithm for low-power memory partitioning

  • Authors:
  • Luca Benini;Alberto Macii;Massimo Poncino

  • Affiliations:
  • Universita di Bologna, Bologna, Italy;Politecnico di Torino, Torino, Italy;Politecnico di Torino, Torino, Italy

  • Venue:
  • ISLPED '00 Proceedings of the 2000 international symposium on Low power electronics and design
  • Year:
  • 2000

Quantified Score

Hi-index 0.02

Visualization

Abstract

Memory-processor integration offers new opportunities for reducing the energy of a system. In the case of embedded systems, one solution consists of mapping the most frequently accessed addresses onto the on-chip SRAM to guarantee power and performance efficiency. This option is especially effective when memory access patterns can be profiled and studied at design time (as in typical real-time embedded systems).In this work, we propose an algorithm for the automatic partitioning of on-chip SRAM in multiple banks that can be independently accessed. Starting from the dynamic execution profile of an embedded application running on a givenprocessor core, we synthesize a multi-banked SRAM architecture optimally fitted to the execution profile. The algorithm provides a globally optimum solution to the problem under realistic assumptions on the power cost metrics, and with constraints on the number of memory banks.Results, collected on a set of embedded applications for the ARM processor, have shown average energy savings around 42%.