Thumbnail
Access Restriction
Subscribed

Author Gao, Shaodi ♦ Kaufmann, Michael
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword VLSI layout ♦ Channel routing
Abstract This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density <?Pub Fmt italic>d<?Pub Fmt /italic> into a so-called extended simple channel routing problem (ESCRP) of density 3d/2+O<fen lp="par">dlog d<rp post="par"> in the Manhattan model, where $\textit{f}$ is the flux of the problem. In all three cases, we improve the best-known upper bounds.
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 1994-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 4
Page Count 28
Starting Page 791
Ending Page 818


Open content in new tab

   Open content in new tab
Source: ACM Digital Library