Linear Ordering and Application to Placement
- 1 January 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 457-464
- https://doi.org/10.1109/dac.1983.1585693
Abstract
Given a set of interconnected elements, linear ordering generates a linear sequence of elements of the set, which is the basis for most constructive initial-placement methods. This paper presents a new strategy for linear ordering. The important difference of the new technique from the previous ones is that it starts the ordering process from the most lightly connected seed. It was applied to various placement problems including standard cell and gate array and produced very good results.Keywords
This publication has 13 references indexed in Scilit:
- Automated Layout in ASHLAR: An Approach to the Problems of "General Cell" Layout for VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A “greedy” channel routerPublished by Association for Computing Machinery (ACM) ,1982
- Provably Good Channel Routing AlgorithmsPublished by Springer Nature ,1981
- Placement Algorithm by Partitioning for Optimum Rectangular PlacementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976
- A 2-dimensional placement algorithm for the layout of electrical circuits.Published by Association for Computing Machinery (ACM) ,1976
- Automatic layout of low-cost quick-turnaround random-logic custom LSI devicesPublished by Association for Computing Machinery (ACM) ,1976
- Clustering and linear placementPublished by Association for Computing Machinery (ACM) ,1972
- A high quality, low cost router for MOS/LSIPublished by Association for Computing Machinery (ACM) ,1972
- A proper model for the partitioning of electrical circuitsPublished by Association for Computing Machinery (ACM) ,1972