FastGR: Global Routing on CPU-GPU With Heterogeneous Task Graph Scheduler

Published: 01 Jan 2023, Last Modified: 16 May 2025IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Running time is a key metric across the standard physical design flow stages. However, with the rapid growth in design sizes, routing runtime has become the runtime bottleneck in the physical design flow. As a result, speeding routing becomes a critical and pressing task for IC design automation. Aside from the running time, we need to evaluate the quality of the global routing solution since a poor global routing engine degrades the solution performance after the entire routing stage. This work takes both of them into consideration. We propose a global routing framework with GPU-accelerated routing algorithms and a heterogeneous task graph scheduler, called FastGR, to accelerate the procedure of the modern global router and improve its effectiveness. Its runtime-oriented version $\text {FastGR}^{\text {L}}$ achieves $2.489\times $ speedup compared with the state-of-the-art global router. Furthermore, the GPU-accelerated L-shape pattern routing algorithm used in $\text {FastGR}^{\text {L}}$ can contribute to $9.324\times $ speedup over the sequential algorithm on CPU. Its quality-oriented version $\text {FastGR}^{\text {H}}$ offers a 27.855% improvement of the number of shorts over the runtime-oriented version and still gets $1.970\times $ faster than the most advanced global router.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview