Access Restriction

Author Berger, Bonnie ♦ Brady, Martin ♦ Brown, Donna ♦ Leighton, Tom
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword VLSI layout ♦ Channel routing ♦ Multilayer routing
Abstract This paper presents algorithms for routing channels with <?Pub Fmt italic>L<?Pub Fmt /italic>≥2 layers. For the unit vertical overlap model, we describe a two-layer channel routing algorithm that uses at most d+O<fen lp="par">d<rp post="par"> . We demonstrate the generality of our routing strategy by showing that it can be used to duplicate some of the best previous upper bounds for other models (two-layer Manhattan routing and two and three-layer knock-knee routing of two-terminal, two-sided nets), and gives a new upper bound for rotuing with 45-degree diagonal wires.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 2
Page Count 43
Starting Page 500
Ending Page 542

Open content in new tab

   Open content in new tab
Source: ACM Digital Library