A Placement Capability Based on Partitioning
- 1 January 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 406-413
- https://doi.org/10.1109/dac.1979.1600145
Abstract
Placement is one of the numerous coordinated capabilities of the Hughes Computer-Aided Design (CAD) System. It is applicable to all of the technologies currently used to produce digital electronic assemblies and is particularly well suited to the allocation requirements of LSI and VLSI. The algorithm that is used iteratively selects sequences of module interchanges that minimize the number of signal crossings over a designated partition (line) across the assembly. An orderly succession of horizontal and vertical partitions causes a rearrangement of modules that facilitates routing, distributes wiring density and achieves minimal wirelength. The placement algorithm, its computational efficiency, its robust applicability, and the parts it plays within the Hughes CAD System are presented.Keywords
This publication has 3 references indexed in Scilit:
- Dynamic Allocation Of Arrays In FortranPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- CADMON: Improving the CAD System Human InterfacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970