DocumentCode
3498547
Title
Congestion estimation for 3D routing
Author
Cheng, Lerong ; Hung, William N N ; Yang, Guowu ; Song, Xiaoyu
Author_Institution
Dept. of Electr. & Comput. Eng., Portland State Univ., OR, USA
fYear
2004
fDate
19-20 Feb. 2004
Firstpage
239
Lastpage
240
Abstract
Three-dimensional (3D) routing is an important step in deep sub-micron VLSI design. Given a 3D grid graph and a set of two-terminal nets to be routed, we propose a probabilistic model to calculate the routing density (congestion) on each edge of the grid graph. The routing density provides direct congestion estimation. Our experimental results demonstrate the effectiveness of the method on routing benchmarks.
Keywords
VLSI; estimation theory; graphs; probability; routing protocols; 3D grid graph; 3D routing; congestion estimation; deep sub-micron VLSI design; probabilistic model; routing benchmarks; routing density; two-terminal nets; Joining processes; Law; Legal factors; Process design; Routing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI, 2004. Proceedings. IEEE Computer society Annual Symposium on
Print_ISBN
0-7695-2097-9
Type
conf
DOI
10.1109/ISVLSI.2004.1339541
Filename
1339541
Link To Document