Optimizing resource utilization using transformations
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A transformational approach aimed at improving the resource utilization in high level synthesis is introduced. The current implementation combines retiming and associativity in a single framework. This combination of transformations results in considerable area improvements, as is amply demonstrated by benchmark examples. A novel learning while searching iterative improvement probabilistic algorithm has been developed and is used to resolve the associated NP-complete combinatorial optimization problem. The effectiveness of the proposed algorithms and the transformations is demonstrated using standard benchmark examples, with the aid of statistical analysis, and through a comparison with estimated minimal bounds. The proposed algorithm has proven to be very effective in reaching the optimal solution as well as in runtime.Keywords
This publication has 15 references indexed in Scilit:
- Resource driven synthesis in the HYPER systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Retiming and resynthesis: optimizing sequential networks with combinational techniquesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- The high-level synthesis of digital systemsProceedings of the IEEE, 1990
- Architectural synthesis for DSP silicon compilersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic CircuitsSIAM Journal on Computing, 1988
- Sehwa: a software package for synthesis of pipelines from behavioral specificationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Breaking the Recursive BottleneckPublished by Springer Nature ,1988
- Flamel: A High-Level Hardware CompilerIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Fast Parallel Computation of Polynomials Using Few ProcessorsSIAM Journal on Computing, 1983
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970