Affiliation:
1. Univ. des Saarlandes, Saarbru¨cken, W. Germany
2. Univ. of Illinois at Urbana-Champaign, Urbana
Abstract
In this paper an
O
(
N
log
N
) algorithm for routing through a rectangle is presented. Consider an
n
-by-
m
rectangular grid and a set of
N
two-terminal nets. A net is a pair of points on the boundary of the rectangle. A layout is a set of edge-disjoint paths, one for each net. Our algorithm constructs a layout, if there is one, in
O
(
N
log
N
) time; this contrasts favorably with the area of the layout that might be as large as
N
2
. The layout constructed can be wired using four layers of interconnect with only
O
(
N
) contact cuts. A partial extension to multiterminal nets is also discussed.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference7 articles.
1. BRADY M. AND BROWN D.J. VLSI routing: Four layers suffice. Adv. Comput. Res. 2: VLS! Theory (1984) 245-257. BRADY M. AND BROWN D.J. VLSI routing: Four layers suffice. Adv. Comput. Res. 2: VLS! Theory (1984) 245-257.
2. Disjoint paths in a rectilinear grid
3. Finding the contour of a union of iso-oriented rectangies
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献