An algorithm for array variable clustering
Loganath Ramachandran, Daniel D. Gajski, Viraphol Chaiyakul · 2002
During synthesis of behavioral descriptions array variables are implemented with memory modules. In this paper we show that simple one-to-one mapping between the array variables and the memory modules lead to inefficient designs. We propose a new algorithm, MeSA, which computes for a given set of array variables, (a) the number of memory modules, (b) the size of each module (c) the number of ports on each module and (d) and the grouping of array variables assigned to each memory module. The effects of address translations are incorporated into the algorithm. While most previous research efforts have concentrated on scalar variables, the primary focus in this paper is deriving efficient storage assignment for array variables.>
Cited by 101 works. doi:10.1109/edtc.1994.326867
Authors
References
- Automated Synthesis of Data Paths in Digital Systems
- High — Level Synthesis
- High-Level VLSI Synthesis
- REAL: a program for REgister ALlocation
- Allocation of multiport memories in data path synthesis
- Incorporating bottom-up design into hardware synthesis
- PHIDEO: a silicon compiler for high speed algorithms
- PHIDEO: a silicon compiler for high speed algorithms
- High-Level Synthesis for Real-Time Digital Signal Processing
- Benchmarks for the 1992 high level synthesis workshop