NTHU-Route 2.0: A fast and stable global router
Authors:
- 1 November 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10923152,p. 338-343
Abstract
We present in this paper a fast and stable global router called NTHU-Route 2.0 that improves the solution quality and runtime of a state-of-the-art router, NTHU-Route, by the following enhancements: (1) a new history based cost function, (2) new ordering methods for congested region identification and rip-up and reroute, and (3) two implementation techniques. The experimental results show that NTHU-Router 2.0 solves all ISPD98 benchmarks with very good quality. Moreover, it routes 7 of 8 ISPD07 benchmarks without any overflow. In particular, for one of the ISPD07 benchmarks which are thought to be difficult cases previously, NTHU-Route 2.0 can completely eliminate its total overflow. NTHU-Route 2.0 also successfully solves 12 of 16 ISPD08 benchmarks without causing any overflow.Keywords
This publication has 10 references indexed in Scilit:
- MaizeRouter: Engineering an effective global router2008
- Archer: a history-driven global routing algorithm2006 IEEE/ACM International Conference on Computer Aided Design, 2007
- High-performance routing at the nanometer scale2007
- FastRoute 2.0: A High-quality and Efficient Global Router2007
- DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm2007
- FastRoute: A Step to Integrate Global Routing into Placement2006 IEEE/ACM International Conference on Computer Aided Design, 2006
- BoxRouter2006
- Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design2005
- Improved global routing through congestion estimation2003
- PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs1995