An algorithm for placement of interconnected elements based on minimum wire length

Authors:
R. A. Rutman
Affiliations:
General Motors Corporation, El Segundo, California
Venue:
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Year:
1964

Citing 1
Cited 2

Formal Procedures for Connecting Terminals with a Minimum Total Wire Length

Journal of the ACM (JACM)

Computer-Aided Preliminary Layout Design of Customized MOS Arrays

IEEE Transactions on Computers
Engineering for systems using large scale integration

AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient placement of components has taken on increased importance because of microminiaturization techniques. Packaging techniques are permitting higher density of components. As the components are mounted closer and closer, less and less room becomes available between components for interconnections. Under these circumstances, the layout of circuitry becomes a difficult and time consuming task for the designer. One approach often used by designers is to group together elements which are functionally related so as to reduce the length of interconnections. If the designer could place the elements in such a way that every element connects only to its nearest neighbors, the problem of routing the interconnections would be somewhat simplified.