Minimizing the required memory bandwidth in VLSI system realizations

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.

[1]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Emile H. L. Aarts,et al.  Improved force-directed scheduling in high-throughput digital signal processing , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  H. De Man,et al.  Dataflow-driven Memory Allocation For Multi-dimensional Signal Processing Systems , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[4]  Hugo De Man,et al.  Global Communication and Memory Optimizing Transformations for Low Power Systems , 1994 .

[5]  Michael J. Flynn,et al.  An area model for on-chip memories and its application , 1991 .

[6]  Viraphol Chaiyakul,et al.  An algorithm for array variable clustering , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[7]  Shlomit S. Pinter,et al.  Register allocation with instruction scheduling: a new approach , 1996, Journal of Programming Languages.

[8]  N.L. Passos,et al.  Push-up scheduling: optimal polynomial-time resource constrained scheduling for multi-dimensional applications , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[9]  John A. Robinson.  Efficient general-purpose image compression with binary tree predictive coding , 1997, IEEE Trans. Image Process..

[10]  Francky Catthoor,et al.  Fast and extensive system-level memory exploration for ATM applications , 1997, Proceedings. Tenth International Symposium on System Synthesis (Cat. No.97TB100114).

[11]  Teresa H. Meng,et al.  Portable video-on-demand in wireless communication , 1995, Proc. IEEE.

[12]  Wfj Wim Verhaegh,et al.  Multidimensional periodic scheduling , 1995 .

[13]  B. Lin,et al.  Background memory management for dynamic data structure intensive processing systems , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[14]  Francky Catthoor,et al.  Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design , 1998 .

[15]  Hugo De Man,et al.  Loop transformation methodology for fixed-rate video, image and telecom processing applications , 1994, Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94).

[16]  Chantal Ykman-Couvreur,et al.  Memory management for embedded network applications , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  W.F.J. Verhaegh,et al.  Allocation of multiport memories for hierarchical data streams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[18]  Leon Stok,et al.  Data path synthesis , 1994, Integr..