DGR: Differentiable Global Router
Authors: 
Wei Li, Rongjian Liang, Anthony Agnesina, Haoyu Yang, Chia-Tung Ho, Anand Rajaram, Haoxing RenAuthors Info & Claims
Wei Li, Rongjian Liang, Anthony Agnesina, Haoyu Yang, Chia-Tung Ho, Anand Rajaram, Haoxing RenAuthors Info & ClaimsArticle No.: 303, Pages 1 - 6
Abstract
Modern VLSI design flows necessitate fast and high-quality global routers. In this paper, we introduce DGR, a differentiable global router capable of concurrent optimization for hundreds of thousands of nets 1. Our innovation lies in the development of a routing Directed Acyclic Graph (DAG) forest to represent the 2D pattern routing space for all nets, enabling coordinated selection of Steiner trees and 2-pin routing paths from a global perspective. For efficient search within the DAG forest, we relax the discrete search space to be continuous and develop a differentiable solver accelerated by deep learning toolkits on GPUs. Experimental results demonstrate that DGR substantially mitigates routing overflow while concurrently reducing total wirelengths from 0.95% to 4.08% and via numbers from 1.28% to 2.54% in congested testcases compared to state-of-the-art academic global routers. Additionally, DGR exhibits favorable scalability in both runtime and memory with respect to the number of nets.
References
[1]
M. Pan and C. Chu, "Fastroute: A step to integrate global routing into placement," in Proceedings of the 2006 ICCAD, 2006, pp. 464--471.
[2]
J. Liu and E. F. Young, "EDGE: Efficient DAG-based Global Routing Engine," in 2023 60th DAC, 2023.
[3]
C. Chu and Y.-C. Wong, "FLUTE: Fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design," vol. 27, no. 1, pp. 70--83, 2008.
[4]
C. Albrecht, "Global routing by new approximation algorithms for multicommodity flow," TCAD, vol. 20, no. 5, pp. 622--632, 2001.
[5]
T.-H. Wu, A. Davoodi, and J. T. Linderoth, "GRIP: Scalable 3D global routing using integer programming," in Proceedings of DAC, 2009, pp. 320--325.
[6]
M. Cho, K. Lu, K. Yuan, and D. Z. Pan, "BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router," in 2007 ICCAD, 2007, pp. 503--508.
[7]
J. Hu, J. A. Roy, and I. L. Markov, "Sidewinder: a scalable ILP-based router," in Proceedings of SLIP, 2008, pp. 73--80.
[8]
J. He, U. Agarwal, Y. Yang, R. Manohar, and K. Pingali, "SPRoute 2.0: A detailed-routability-driven deterministic parallel global router with soft capacity," in 2022 27th ASP-DAC, 2022, pp. 586--591.
[9]
J. Liu, C.-W. Pui, F. Wang, and E. F. Young, "Cugr: Detailed-routability-driven 3d global routing with probabilistic resource model," in 2020 57th DAC, 2020, pp. 1--6.
[10]
Z. Guo, F. Gu, and Y. Lin, "GPU-Accelerated Rectilinear Steiner Tree Generation," in Proceedings of the 41st ICCAD, 2022, pp. 1--9.
[11]
S. Liu, Y. Pu, P. Liao, H. Wu, R. Zhang, Z. Chen, W. Lv, Y. Lin, and B. Yu, "Fastgr: Global routing on cpu-gpu with heterogeneous task graph scheduler," TCAD, 2022.
[12]
S. Lin and M. D. Wong, "Superfast Full-Scale CPU-Accelerated Global Routing," in Proceedings of the 41st ICCAD, 2022, pp. 1--8.
[13]
M. Khasawneh and P. H. Madden, "Hydraroute: A novel approach to circuit routing," in Proceedings of the 2019 on Great Lakes Symposium on VLSI (GLSVLSI), 2019, pp. 177--182.
[14]
Y. Pengju, Z. Ping, and Z. Wenxing, "Pathfinding Model and Lagrangian-Based Global Routing," in 2023 60th DAC, 2023.
[15]
G. Chen and E. F. Young, "Salt: provably good routing topology by a novel steiner shallow-light tree algorithm," TCAD, vol. 39, no. 6, pp. 1217--1230, 2019.
[16]
W. Li, Y. Qu, G. Chen, Y. Ma, and B. Yu, "TreeNet: Deep point cloud embedding for routing tree construction," in Proceedings of the 26th ASP-DAC, 2021, pp. 164--169.
[17]
E. Jang, S. Gu, and B. Poole, "Categorical reparameterization with gumbel-softmax," arXiv preprint arXiv:1611.01144, 2016.
[18]
A. Fan, M. Lewis, and Y. Dauphin, "Hierarchical neural story generation," arXiv preprint arXiv:1805.04833, 2018.
[19]
S. Dolgov, A. Volkov, L. Wang, and B. Xu, "2019 cad contest: Lef/def based global routing," in 2019 ICCAD, 2019, pp. 1--4.
[20]
S. Diamond and S. Boyd, "Cvxpy: A python-embedded modeling language for convex optimization," The Journal of Machine Learning Research, vol. 17, no. 1, pp. 2909--2913, 2016.
Index Terms
- DGR: Differentiable Global Router
Index terms have been assigned to the content through auto-classification.
Recommendations
A new global router for modern designs
ASP-DAC '08: Proceedings of the 2008 Asia and South Pacific Design Automation ConferenceIn this paper, we present a new global router, NTHU-Route, for modern designs. NTHU-Route is based on iterative rip-ups and reroutes, and several techniques are proposed to enhance our global router. These techniques include (1) a history based cost ...
A Timing Driven Congestion Aware Global Router
EAIT '11: Proceedings of the 2011 Second International Conference on Emerging Applications of Information TechnologyThe multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject to resources and delay constraints. Many modern routers use FLUTE (Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design) as the basic ...
A scalable routability-driven analytical placer with global router integration for FPGAs (abstract only)
FPGA '14: Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arraysAs the sizes of modern circuits become bigger and bigger, implementing those large circuits into FPGA becomes arduous. The state-of-the-art academic FPGA place-and-route tool, VPR, has good quality but needs around a whole day to complete a placement ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 November 2024
Check for updates
Qualifiers
- Research-article
Conference
DAC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 99Total Downloads
- Downloads (Last 12 months)99
- Downloads (Last 6 weeks)46
Reflects downloads up to 13 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in