Generalized resource sharing
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Resource sharing is one of the main tasks in high-level synthesis, and although many algorithms have addressed the problem there are still several limitations which restrict the generality and applicability of current algorithms. Most clique-partitioning-based algorithms use local and inaccurate cost-functions which result in inefficient results. This paper presents algorithms for the resource sharing problem on registers and functional units, and shows how they overcome the limitations of existing algorithms. The main characteristics of this work are: interleaved register and functional unit merging in a global clique partitioning based framework, accurate merging cost estimation, accurate interconnect cost estimation, relative control cost taken into account and efficient false loop elimination. The results obtained show significant improvements in the delay of designs, while also minimizing area, specially for large designs with many sharing possibilities.Keywords
This publication has 7 references indexed in Scilit:
- Redesign using state splittingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quadratic zero-one programming-based synthesis of application-specific data pathsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- High-level synthesis in an industrial environmentIBM Journal of Research and Development, 1995
- Allocation algorithms based on path analysisIntegration, 1992
- False loops through resource sharing (logic CAD)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Automated Synthesis of Data Paths in Digital SystemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- A Method of Automatic Data Path SynthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983