An efficient hierarchical timing-driven Steiner tree algorithm for global routing

Authors:
Jingyu Xu;Xianlong Hong;Tong Jing;Yici Cai;Jun Gu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China
Venue:
Integration, the VLSI Journal
Year:
2003

Citing 11
Cited 2

Performance-driven Steiner tree algorithm for global routing

DAC '93 Proceedings of the 30th international Design Automation Conference
Minimal delay interconnect design using alphabetic trees

DAC '94 Proceedings of the 31st annual Design Automation Conference
The Elmore delay as bound for RC trees with generalized input signals

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Optimal wiresizing for interconnects with multiple sources

ACM Transactions on Design Automation of Electronic Systems (TODAES)
New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Buffered Steiner trees for difficult instances

Proceedings of the 2001 international symposium on Physical design
A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Timing optimization for multisource nets: characterization and optimal repeater insertion

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient and optimal algorithm for simultaneous buffer and wire sizing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithms for non-Hanan-based optimization for VLSI interconnect under a higher-order AWE model

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimal wiresizing under Elmore delay model

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

The polygonal contraction heuristic for rectilinear Steiner tree construction

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A routing paradigm with novel resources estimation and routability models for x-architecture based physical design

SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the goal. The algorithm uses heuristic approach to decompose the problem of minimum delay Steiner tree into hierarchy and construct the sub-trees, respectively, based on dynamic programming technique. Taking the net topology into consideration, we build the final routing tree by reconnecting the sub-trees at each level recursively and then improve the connection with the objective of minimizing the delay from source to sink pins on the critical path. Meanwhile, some efficient strategies have been proposed to speed up the solving process. Experimental results are given to demonstrate the efficiency of our algorithm.