skip to main content
10.1145/3508352.3549421acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article

A Robust Global Routing Engine with High-Accuracy Cell Movement under Advanced Constraints

Published: 22 December 2022 Publication History

Abstract

Placement and routing are typically defined as two separate problems to reduce the design complexity. However, such a divide-and-conquer approach inevitably incurs the degradation of solution quality due to the correlation/objectives of placement and routing are not entirely consistent. Besides, with various constraints (e.g., timing, R/C characteristic, voltage area, etc.) imposed by advanced circuit designs, bridging the gap between placement and routing while satisfying the advanced constraints has become more challenging. In this paper, we develop a robust global routing engine with high-accuracy cell movement under advanced constraints to narrow the gap and improve the routing solution. We first present a routing refinement technique to obtain the convergent routing result based on fixed placement, which provides more accurate information for subsequent cell movement. To achieve fast and high-accuracy position prediction for cell movement, we construct a lookup table (LUT) considering complex constraints/objectives (e.g., routing direction and layer-based power consumption), and generate a timing-driven gain map for each cell based on the LUT. Finally, based on the prediction, we propose an alternating cell movement and cluster movement scheme followed by partial rip-up and reroute to optimize the routing solution. Experimental results on the ICCAD 2020 contest benchmarks show that our algorithm achieves the best total scores among all published works. Compared with the champion of the ICCAD 2021 contest, experimental results on the ICCAD 2021 contest benchmarks show that our algorithm achieves better solution quality in shorter runtime.

References

[1]
K.-S. Hu, M.-J. Yang, T.-C. Yu, and G.-C. Chen, "ICCAD-2020 CAD contest in routing with cell movement," in Proceedings of the 39th International Conference on Computer-Aided Design, pp. 1--4, 2020.
[2]
K.-S. Hu, T.-C. Yu, M.-J. Yang, and C.-F. C. Shen, "2021 ICCAD CAD Contest Problem B: Routing with Cell Movement Advanced: Invited Paper," in 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), pp. 1--5, 2021.
[3]
W.-H. Liu, W.-C. Kao, Y.-L. Li, and K.-Y. Chao, "NCTU-GR 2.0: multithreaded collision-aware global routing with bounded-length maze routing," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 32, no. 5, pp. 709--722, 2013.
[4]
C.-K. Cheng, A. B. Kahng, I. Kang, and L. Wang, "Replace: Advancing solution quality and routability validation in global placement," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 38, no. 9, pp. 1717--1730, 2018.
[5]
C.-C. Huang, H.-Y. Lee, B.-Q. Lin, S.-W. Yang, C.-H. Chang, S.-T. Chen, Y.-W. Chang, T.-C. Chen, and I. Bustany, "NTUplace4dr: a detailed-routing-driven placer for mixed-size circuit designs with technology and region constraints," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 37, no. 3, pp. 669--681, 2017.
[6]
M. Pan and C. Chu, "IPR: an integrated placement and routing algorithm," in Proceedings of the 44th IEEE/ACM Design Automation Conference (DAC), pp. 59--62, 2007.
[7]
X. He, W.-K. Chow, and E. F. Young, "SRP: Simultaneous routing and placement for congestion refinement," in Proceedings of the 2013 ACM International Symposium on Physical Design (ISPD), pp. 108--113, 2013.
[8]
T. A. Fontana, E. Aghaeekiasaraee, R. Netto, S. F. Almeida, U. Gandh, A. F. Tabrizi, D. Westwick, L. Behjat, and J. L. Güntzel, "ILP-based global routing optimization with cell movements," in 2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 25--30, IEEE, 2021.
[9]
M. Pan and C. Chu, "FastRoute: A step to integrate global routing into placement," in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 464--471, 2006.
[10]
P. Zou, Z. Lin, C. Ma, J. Yu, and J. Chen, "Late Breaking Results: Incremental 3D global routing considering cell movement," in Proceedings of 58th IEEE/ACM Design Automation Conference (DAC), pp. 1366--1367, IEEE, 2021.
[11]
F. Wang, L. Liu, J. Chen, J. Liu, X. Zang, and M. D. Wong, "Starfish: An efficient P&R co-optimization engine with A*-based partial rerouting," in 2021 IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 1--9, IEEE, 2021.
[12]
Z. Huang, H. Huang, R. Shi, X. Li, X. Zhang, W. Chen, J. Wang, and Z. Zhu, "Detailed placement and global routing co-optimization with complex constraints," Electronics, vol. 11, no. 1, p. 51, 2021.
[13]
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 IEEE/ACM Design Automation Conference (DAC), pp. 1--6, IEEE, 2020.
[14]
C. Chu and Y.-C. Wong, "FLUTE: Fast lookup table based rectilinear steiner minimal tree algorithm for vlsi design," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 27, no. 1, pp. 70--83, 2008.
[15]
Y.-J. Chang, Y.-T. Lee, and T.-C. Wang, "NTHU-Route 2.0: a fast and stable global router," in Proceedings of 2008 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 338--343, IEEE, 2008.
[16]
J. Bhasker and R. Chadha, Static timing analysis for nanometer designs: A practical approach. Springer Science & Business Media, 2009.
[17]
M. Pan and C. Chu, "Fastroute 2.0: A high-quality and efficient global router," in Proceedings of 2007 Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 250--255, IEEE, 2007.
[18]
P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100--107, 1968.

Cited By

View all
  • (2023)ILPGRC: ILP-Based Global Routing Optimization With Cell MovementsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.330557943:1(352-365)Online publication date: 15-Aug-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '22: Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design
October 2022
1467 pages
ISBN:9781450392174
DOI:10.1145/3508352
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 ACM 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

  • IEEE-EDS: Electronic Devices Society
  • IEEE CAS
  • IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 December 2022

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Conference

ICCAD '22
Sponsor:
ICCAD '22: IEEE/ACM International Conference on Computer-Aided Design
October 30 - November 3, 2022
California, San Diego

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)45
  • Downloads (Last 6 weeks)5
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)ILPGRC: ILP-Based Global Routing Optimization With Cell MovementsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.330557943:1(352-365)Online publication date: 15-Aug-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media