在這篇論文裡，我們提出一個快速、穩定的全域繞線器–NTHU-Route 2.0。NTHU-Route 2.0採用了三個加強技術來改善NTHU-Route的繞線品質以及運算速度，這三個加強技術分別為 (1) 一個新的以歷史紀錄為基礎之代價函數，(2) 兩個更適合拆除重繞法以及壅塞區域辨識法的排序方式，以及 (3) 兩個實作技術。NTHU-Route 2.0為ISPD98測試電路找出高品質且無溢出狀況的繞線解。另外，NTHU-Route 2.0也為八個ISPD07測試電路的其中七個找出無溢出狀況的繞線解，其中一個電路在過去被認為無法為其找出無溢出狀況的繞線解，NTHU-Route 2.0是目前唯一一個可為其找出無溢出狀況繞線解的全域繞線器。NTHU-Route 2.0也順利的為十六個ISPD08測試電路的其中十二個找出高品質且無溢出狀況之繞線解，與目前其他先進之繞線器相比，NTHU-Route 2.0可為大多數的測試電路產生出最佳的繞線解。從本論文最後所附的實驗結果可看到，NTHU-Route 2.0是個高效率且穩定的全域繞線器。

We present in this thesis 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, NTHURoute, by the following enhancements: (1) a new history based cost function, (2) new ordering methods for rip-up-and-reroute and congested region identification, and (3) two implementation techniques. The experimental results show that our router solves all ISPD98 benchmarks with very good quality. Besides, it routes 7 of 8 ISPD07 benchmarks without inducing any overflow. In particular, for one of the benchmarks which are thought to be difficult cases previously, our router is the only one that can completely eliminate its total overflow. Our router also successfully solves 12 of 16 ISPD08 benchmarks without causing any overflow and efficiently generates the best solutions for almost all benchmarks among all stateof-the-art global routers.

[1] R. T. Hadsell and P. H. Madden, “Improved global routing through congestion estimation,” in Proceedings of Design Automation Conference, Anaheim, CA, 2003, pp. 28–31.
[2] R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, “Pattern routing: use and theory for increasing predictability and avoiding coupling,” IEEE Transactions
on Computer-Adided Design of Integrated Circuits and Systems, vol. 21, no. 7, pp. 777–790, 2002.
[3] Z. Cao, T. Jing, J. Xiong, Y. Hu, L. He, and X. Hong, “Dprouter: A fast and accurate dynamic-pattern-based global routing algorithm,” in Proceedings of Asia and South Pacific Design Automation Conference, Yokohama, Japan,
2007, pp. 256–261.
[4] M. Pan and C. Chu, “Fastroute: a step to integrate global routing into placement,”in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, 2006, pp. 464–471.
[5] ——, “Fastroute 2.0: A high-quality and efficient global router,” in Proceedings of Asia and South Pacific Design Automation Conference, Yokohama, Japan, 2007, pp. 250–255.
[6] M. Cho and D. Z. Pan, “Boxrouter: a new global router based on box expansion and progressive ILP,” in Proceedings of Design Automation Conference,
San Francisco, CA, 2006, pp. 373–378.
[7] ISPD 2007 Global Routing Contest website. [Online]. Available: http://www.sigda.org/ispd2007/contest.html
39
[8] ISPD 2008 Global Routing Contest website. [Online]. Available: http://www.ispd.cc/contests/ispd08rc.html
[9] M. Cho, K. Lu, K. Yuan, and D. Z. Pan, “Boxrouter 2.0: architecture and implementation of a hybrid and robust global router,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, 2007, pp. 503–508.
[10] M. M. Ozdal and M. D. F. Wong, “Archer: a history-driven global routing algorithm,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, 2007, pp. 488–495.
[11] J. A. Roy and I. L. Markov, “High-performance routing at the nanometer scale,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, 2007, pp. 496–502.
[12] M. D. Moffitt, “Maizerouter: engineering an effective global router,” in Proceedings of Asia and South Pacific Design Automation Conference, Seoul, Korea, 2008, pp. 226–231.
[13] J.-R. Gao, P.-C. Wu, and T.-C. Wang, “A new global router for modern designs,” in Proceedings of Asia and South Pacific Design Automation Conference, Seoul, Korea, 2008, pp. 232–237.
[14] L. McMurchie and C. Ebeling, “Pathfinder: a negotiation-based performancedriven router for FPGAs,” in Proceedings of ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, Monterey, CA, 1995, pp. 111–
117.
[15] C. Chu and Y.-C. Wong, “Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design,” in Proceedings of International Symposium on Physical Design, San Francisco, CA, 2005, pp. 28–35.
[16] T.-H. Lee and T.-C. Wang, “Congestion-constrained layer assignment for via minimization in global routing,” IEEE Transactions on Computer-Adided Design of Integrated Circuits and Systems, 2008 (to appear).
[17] Gompertz curve. [Online]. Available: http://en.wikipedia.org/wiki/Gompertz curve
[18] Gompertz curve. [Online]. Available: http://mathworld.wolfram.com/GompertzCurve.html
[19] Labyrinth. [Online]. Available: http://www.ece.ucsb.edu/ kastner/labyrinth
[20] FGR. [Online]. Available: http://vlsicad.eecs.umich.edu/BK/FGR/