Table of Contents
VLSI Design
Volume 2, Issue 2, Pages 171-183

Channel Density Minimization by Pin Permutation

1Department of Computer Sciences, University of Texas at Austin, Austin TX 78712, USA
2Department of Computer Science, University of California, Los Angeles 90024, CA, USA

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We present in this paper a linear time optimal algorithm for minimizing the density of a channel (with exits) by permuting the terminals on the two sides of the channel. This compares favorably with the previously known near-optimal algorithm presented in [6] that runs in superlinear time. Our algorithm has important applications in hierarchical layout design of intergrated circuits. We also show that the problem of minimizing wire length by permuting terminals is NP-hard in the strong sense.