Optimal Three-Layer Channel Routing

Authors:
Franco P. Preparata;Witold Lipski, Jr.
Affiliations:
Univ. of Illinois at Urbana-Champaign, Urbana;Polish Academy of Sciences, Warsaw, Poland
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 12

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Optimal wiring between rectangles

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures

DAC '71 Proceedings of the 8th Design Automation Workshop
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Routing through a rectangle

Journal of the ACM (JACM) - The MIT Press scientific computation series
Optimal Rotation Problems in Channel Routing

IEEE Transactions on Computers
On improving channel routability

ACM SIGDA Newsletter
Stretching a Knock-Knee Layout for Multilayer Wiring

IEEE Transactions on Computers
Routing through a dense channel with minimum total wire length

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
New models for four- and five-layer channel routing

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Channel routing of multiterminal nets

Journal of the ACM (JACM)
Nearly optimal algorithms and bounds for multilayer channel routing

Journal of the ACM (JACM)
An animated library of combinatorial VLSI-routing algorithms

Proceedings of the eleventh annual symposium on Computational geometry
Wiring Knock-Knee Layouts: A Global Approach

IEEE Transactions on Computers
Channel routing of multiterminal nets

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Planar subset of multi-terminal nets

Integration, the VLSI Journal

Quantified Score

Hi-index	14.99

Visualization

Abstract

In this paper we show that any channel routing problem of density d involving only two-terminal nets can always be solved in the knock-knee mode in a channel of width equal to the density d with three conducting layers. An algorithm is described which produces in time O(n log n) (in its simplest implementation) a layout of n nets with the following properties: 1) it has minimal width d; 2) it can be realized with three layers; 3) it has at most 3n vias; 4) any two wires share at most four grid points. Without sacrificing any of the above properties (but possibly obtaining slightly longer wires), the layout algorithm can be modified to run in time ?(n).