A new approach to sea-of-gates global routing
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors integrate the concepts and techniques of two existing complementary approaches, namely, the rerouting approach and the top-down hierarchical approach based on linear assignment. This combines and enhances the advantages of the two approaches and results in a fast and high-quality router which can handle large sea-of-gates designs. In addition, it solves the problems of routing interdependence and routing resource estimation which heretofore have not been well addressed yet. The method has been implemented and successfully tested on three real gate-arrays chips: Primary 1, Primary 2, and a channelless industrial example with 100 K gates.Keywords
This publication has 7 references indexed in Scilit:
- PROUD: a sea-of-gates placement algorithmIEEE Design & Test of Computers, 1988
- A Simple Yet Effective Technique for Global WiringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Routing Techniques for Gate ArrayIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Global Wiring on a Wire Routing MachinePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980
- An extension of the Munkres algorithm for the assignment problem to rectangular matricesCommunications of the ACM, 1971