Minimizing the required memory bandwidth in VLSI systemrealizations
Wuytack, S.; Catthoor, F.; De Jong, G.; De Man, H.J.
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Volume 7, Issue 4, Dec 1999 Page(s):433 - 441
Digital Object Identifier 10.1109/92.805750
Summary:In this paper, we present the problem of storage bandwidth
optimization (SBO) in VLSI system realizations. 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 importance and the
effect of SBO is shown on realistic examples both in the video and
asynchronous transfer-mode (ATM) domains. 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. Our
problem formulation leads to the optimization of a conflict (hyper)
graph. For the target domain of ATM, only flat graphs without loops have
to be treated. For this subproblem, a prototype tool has been
implemented to demonstrate the feasibility of automating this important
system design step
View citation and abstract |
Cart
