TY - GEN
T1 - Strategic Rip-Up and Reroute
AU - Devereux-Smith, Rowan
AU - Madden, Patrick H.
N1 - Publisher Copyright: © 2025 Copyright held by the owner/author(s).
PY - 2025/6/29
Y1 - 2025/6/29
N2 - Iterative rip-up and reroute (RR), coupled with maze routing, is a standard approach in many global and detail routers. Lacking a clear indication for which connections to modify, nets in both congested and uncongested regions are ripped up and rerouted until solution quality no longer improves. Conventional approaches can expend a great deal of effort in exploring routing changes that have no meaningful benefit. In this paper, we present a new strategic approach: the impact of potential routing changes are determined precisely prior to being implemented, resulting in rapid convergence to high quality solutions with little wasted effort.Preliminary results of our prototype tool are exceptionally promising. On recently released global routing benchmarks, the new approach obtains results comparable to the best-performing massively parallel tools, but does so using only a single processor core. Our primary contribution is a new computationally efficient approach to the RR paradigm. We also find that in many cases, pattern routing alone is sufficient, and that maze routing is not required.
AB - Iterative rip-up and reroute (RR), coupled with maze routing, is a standard approach in many global and detail routers. Lacking a clear indication for which connections to modify, nets in both congested and uncongested regions are ripped up and rerouted until solution quality no longer improves. Conventional approaches can expend a great deal of effort in exploring routing changes that have no meaningful benefit. In this paper, we present a new strategic approach: the impact of potential routing changes are determined precisely prior to being implemented, resulting in rapid convergence to high quality solutions with little wasted effort.Preliminary results of our prototype tool are exceptionally promising. On recently released global routing benchmarks, the new approach obtains results comparable to the best-performing massively parallel tools, but does so using only a single processor core. Our primary contribution is a new computationally efficient approach to the RR paradigm. We also find that in many cases, pattern routing alone is sufficient, and that maze routing is not required.
KW - Global Routing
KW - Integrated Circuit Design
KW - Maze Routing
KW - Pattern Routing
UR - https://www.scopus.com/pages/publications/105017655216
U2 - 10.1145/3716368.3735162
DO - 10.1145/3716368.3735162
M3 - Conference contribution
T3 - Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI
SP - 770
EP - 776
BT - GLSVLSI 2025 - Proceedings of the Great Lakes Symposium on VLSI 2025
PB - Association for Computing Machinery
T2 - 35th Edition of the Great Lakes Symposium on VLSI 2025, GLSVLSI 2025
Y2 - 30 June 2025 through 2 July 2025
ER -