A quadrisection-based combined place and route scheme for standard cells
- 1 March 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (3), 234-244
- https://doi.org/10.1109/43.21843
Abstract
A description is given of a placement technique based on hypergraph quadrisection. The authors have developed a standard cell placement procedure based on recursively dividing the netlist into four parts, while minimizing the division cost. They have combined two ideas for placement. One is the extension of the min-cut bisection algorithm to handle quadrisection. The second idea is the simultaneous calculation of min-cut quadrisection and hierarchical global routing. The implementation details are discussed. The results show the implementation to be competitive with simulated annealingKeywords
This publication has 12 references indexed in Scilit:
- An algorithm for quadrisection and its application to standard cell placementIEEE Transactions on Circuits and Systems, 1988
- Hierarchical Loose Routing for Gate ArraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A Simple Yet Effective Technique for Global WiringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Optimization by Simulated AnnealingScience, 1983
- A "Greedy" Channel RouterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- A proper model for the partitioning of electrical circuitsPublished by Association for Computing Machinery (ACM) ,1972
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970