A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
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.doi:10.1109/isvlsi.2004.1339541 dblp:conf/isvlsi/ChengHYS04 fatcat:mddmycq7s5cc3baorbcwxod7fy