Flow Graph Balancing for Minimizing the Required Memory Bandwidth
Sven Wuytack, Francky Catthoor, Gjalt de Jong, Bill Lin, Hugo De Man · 1996
In this paper we present the problem of flow graph balancing for minimizing the required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cycle budget by adding ordering constraints to the flow graph. This allows the subsequent memory allocation and assignment tasks to come up with a cheaper memory architecture with less memories and memory ports. The effect of flow graph balancing is shown on an example. We show that it is important to take into account which data is being accessed in parallel, instead of only considering the number of simultaneous memory accesses. This leads to the optimization of a conflict graph. 1. Introduction Many important applications deal with large amounts of data. This is the case both in multi-dimensional signal processing applications like video and image processing, which handle indexed signals in the context of loops, and in communication network protocols, which handle large sets of records organized in tables. F...