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 a direct congestion estimation. Our experimental results demonstrate the effectiveness of the method on routing benchmarks.
Citation:
Lerong Cheng, William N. N. Hung, Guowu Yang, Xiaoyu Song, "Congestion Estimation for 3D Routing," isvlsi, pp.239, IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04), 2004