Sciweavers

3 search results - page 1 / 1
» An Efficient Hierarchical Timing-Driven Steiner Tree Algorit...
Sort
View
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 7 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
TCAD
2002
73views more  TCAD 2002»
13 years 7 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
13 years 11 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh