Congestion estimation for 3D routing

被引：25

作者：

Cheng, LR ^{[1
]}

Hung, WNN ^{[1
]}

Yang, GW ^{[1
]}

Song, XY ^{[1
]}

机构：

[1] Portland State Univ, Dept Elect & Comp Engn, Portland, OR 97207 USA

来源：

VLSI 2004: IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/ISVLSI.2004.1339541

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Three-dimensional (3D) routing is an important step in deep sub-micron VLS1 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.

引用

页码：239 / 240

页数：2