InstantGR: Scalable GPU Parallelization for Global Routing

Global routing plays a crucial role in electronic design automation (EDA), serving not only as a means of optimizing routing but also as a tool for estimating routability in earlier stages such as logic synthesis and physical planning. However, these scenarios often require global routing on unpartitioned large designs, posing unique challenges in scalability, both in terms of runtime and design size. To tackle this issue, this paper introduces useful techniques for parallelizing large-scale global routing that can significantly increase parallelism and thus reduce runtime. Building upon these techniques, we have developed an open-source GPU-based global router that achieves the state-of-the-art results in the latest ISPD'24 Contest benchmarks, thereby showcasing the effectiveness of our methods. The source code of this work is available at https://github.com/cuhk-eda/InstantGR.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1145/3676536.3676787
Citations
10
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
2.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

InstantGR: Scalable GPU Parallelization for Global Routing

Shiju Lin, Jinwei Liu, Evangeline F. Y. Young, Liang Xiao
10 citations
Graph Theory and Algorithms
2.49
article

InstantGR: Scalable GPU Parallelization for Global Routing

Shiju Lin, Jinwei Liu, Evangeline F. Y. Young, Liang Xiao
article en
10 citations

Abstract

Global routing plays a crucial role in electronic design automation (EDA), serving not only as a means of optimizing routing but also as a tool for estimating routability in earlier stages such as logic synthesis and physical planning. However, these scenarios often require global routing on unpartitioned large designs, posing unique challenges in scalability, both in terms of runtime and design size. To tackle this issue, this paper introduces useful techniques for parallelizing large-scale global routing that can significantly increase parallelism and thus reduce runtime. Building upon these techniques, we have developed an open-source GPU-based global router that achieves the state-of-the-art results in the latest ISPD'24 Contest benchmarks, thereby showcasing the effectiveness of our methods. The source code of this work is available at https://github.com/cuhk-eda/InstantGR.

Chinese University of Hong Kong (HK)
Chinese University of Hong Kong
Affordable and clean energy
Openalex Percentile: Top 9%
Graph Theory and Algorithms
2.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.