Dynamic overlay of scratchpad memory for energy minimization

  • Authors:

  • Manish Verma;Lars Wehmeyer;Peter Marwedel

  • Affiliations:

  • University of Dortmund, Dortmund, Germany;University of Dortmund, Dortmund, Germany;University of Dortmund, Dortmund, Germany

  • Venue:
  • Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing the energy consumption of the memory subsystem. Consequently, novel memories as well as novel algorithms for their efficient utilization are being designed. Scratchpads are known to perform better than caches in terms of power, performance, area and predictability. However, unlike caches they depend upon software allocation techniques for their utilization. In this paper, we present an allocation technique which analyzes the application and inserts instructions to dynamically copy both code segments and variables onto the scratchpad at runtime. We demonstrate that the problem of dynamically overlaying scratchpad is an extension of the Global Register Allocation problem. The overlay problem is solved optimally using ILP formulation techniques. Our approach improves upon the only previously known allocation technique for statically allocating both variables and code segments onto the scratchpad. Experiments report an average reduction of 34% and 18% in the energy consumption and the runtime of the applications, respectively. A minimal increase in code size is also reported.