Congestion estimation for 3D routing

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.

[1]  Naveed A. Sherwani,et al.  Routing in the Third Dimension , 1995 .

[2]  Shankar Krishnamoorthy,et al.  Estimating routing congestion using probabilistic analysis , 2001, ISPD '01.

[3]  Guowu Yang,et al.  A fast congestion estimator for routing with bounded detours , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

[4]  Naveed A. Sherwani,et al.  Routing in the third dimension : from VLSI chips to MCMs , 1995 .