Advertisement

Memory Allocation and Assignment

  • Francky Catthoor
  • Sven Wuytack
  • Eddy De Greef
  • Florin Balasa
  • Lode Nachtergaele
  • Arnout Vandecappelle
Chapter

Abstract

In embedded systems the memory architecture can be more or less freely chosen. Different choices can lead to solutions with a very different cost, which means that it is important to make the right choice. Therefore, we have introduced a memory allocation and assignment step in our design flow, where trade-offs are made to arrive to an optimal memory architecture. In this step we take into account both the bandwidth constraints defined in chapter 10, and the target implementation technology.

This chapter defines the memory architecture problem in detail (section 11.1). Next, in section 11.2 it gives an overview of the complete memory allocation and assignment step, followed by four sections detailing each of the four sub steps. Finally, section 11.8 illustrates the methodology with an example.

Keywords

Basic Group Assignment Scheme Memory Allocation Memory Architecture Conflict Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Francky Catthoor
    • 1
    • 2
  • Sven Wuytack
    • 1
  • Eddy De Greef
    • 1
  • Florin Balasa
    • 3
  • Lode Nachtergaele
    • 1
  • Arnout Vandecappelle
    • 1
  1. 1.IMECLeuvenBelgium
  2. 2.Katholieke Universiteit LeuvenBelgium
  3. 3.Rockwell Intnl. Corp.Newport BeachUSA

Personalised recommendations