JUCS - Journal of Universal Computer Science 11(6): 916-925, doi: 10.3217/jucs-011-06-0916
On Theoretical Upper Bound for Routing Estimation
expand article infoFei He‡, Lerong Cheng§, Guowu Yang§, Xiaoyu Song§, Ming Gu|, Jiaguang Sun|
‡ Dept. CS&T and School of Software, Tsinghua University, China§ Dept. ECE, Portland State University, United States of America| School of Software, Tsinghua University, China

Corresponding author: Fei He ( hef02@mails.tsinghua.edu.cn )

© Fei He, Lerong Cheng, Guowu Yang, Xiaoyu Song, Ming Gu, Jiaguang Sun.
This article is freely available under the J.UCS Open Content License.
Citation: He F, Cheng L, Yang G, Song X, Gu M, Sun J (2005) On Theoretical Upper Bound for Routing Estimation. JUCS - Journal of Universal Computer Science 11(6): 916-925. https://doi.org/10.3217/jucs-011-06-0916
Open Access
Abstract
Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of two-terminal nets in two-dimensional arrays. We show the soundness of the bounds for both wiring space and total wire-length estimation.
Keywords
global routing, algorithms, CAD, integrated circuits