In this paper we consider the problem of local wiring in a VLSI chip. The problem is one of interconnecting two sets of terminals, one set on each side of a wiring channel, in accordance with a given interconnection pattern, and to accomplish this while minimizing some objective function. We make the further assumption that the terminals are not rigidly positioned and can be "moved" provided that this does not change the structural intent of the circuit. Several objective functions are considered-channel width, channel length, channel area, channel perimeter, number of via holes, as well as some constrained objective functions. For some of these objective functions, we are able to find polynomial time optimal algorithms while, for others, we prove NP-completeness and suggest efficient heuristics.
[1]
Yoji Kajitani,et al.
The Minimum Width Routing of a 2-Row 2-Layer Polycell-Layout
,
1979,
16th Design Automation Conference.
[2]
Akihiro Hashimoto,et al.
Wire routing by optimizing channel assignment within large apertures
,
1971,
DAC.
[3]
Amir Pnueli,et al.
Permutation Graphs and Transitive Graphs
,
1972,
JACM.
[4]
Joseph Y.-T. Leung,et al.
An Optimal Solution for the Channel-Assignment Problem
,
1979,
IEEE Transactions on Computers.
[5]
Brian W. Kernighan,et al.
An optimum channel-routing algorithm for polycell layouts of integrated circuits
,
1973,
DAC '73.
[6]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.