Optimal Wiring of Movable Terminals
- 1 September 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (9) , 845-858
- https://doi.org/10.1109/tc.1983.1676333
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- An optimum channel-routing algorithm for polycell layouts of integrated circuitsPublished by Association for Computing Machinery (ACM) ,1988
- An Optimal Solution for the Channel-Assignment ProblemIEEE Transactions on Computers, 1979
- The Minimum Width Routing of a 2-Row 2-Layer Polycell-LayoutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971