Acceleration of detailed VLSI routing using machine learning methods

Cover Page

Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription or Fee Access

Abstract

A hybrid approach for accelerating detailed routing of very large-scale integration (VLSI) circuits is proposed. The method combines a neural network model based on the U-Net architecture enhanced with Self-Attention and the classical Rip-Up and Reroute (R&R) algorithm. Experimental results demonstrate a significant acceleration of the routing process without loss of quality. The proposed solution illustrates the practical efficiency of machine learning methods in the field of physical design automation. The proposed approach represents the detailed routing task in a tensor form that preserves complete spatial information required for constructing routing paths. А modified deep learning segmentation model is developed to predict routing patterns for multiple nets simultaneously within a shared topological region. The predictions of the neural network serve as an initial approximation for the heuristic R&R algorithm, which substantially reduces the number of iterations needed to reach convergence. The neural network is trained on data derived from the results of global routing and physical design parameters extracted from LEF/DEF and Guide files. А new data decomposition method is introduced that allows the neural model to be adapted to any process design kit (PDK) by partitioning the routing layers into independent stacks. Tests on real integrated circuits show that the proposed method achieves up to a fivefold speedup compared to the open-source router OpenLane, particularly for large-scale designs. The study highlights the potential of deep learning in reducing the computational cost of detailed routing, one of the most time-consuming stages in VLSI physical synthesis. The approach demonstrates scalability, adaptability to different design rules, and opportunities for further performance gains through model optimization and integration into existing EDA workflows.

Full Text

Restricted Access

About the authors

A. L. Stempkovsky

AlphaChip LLC

Author for correspondence.
Email: stempkovsky@alphachip.ru

Academician of RAS, Ph.D., General Director

Russian Federation, Zelenograd, Moscow

D. V. Telpuhkov

AlphaChip LLC

Email: telpukhov@alphachip.ru

Ph.D., Deputy General Director for Research

Russian Federation, Zelenograd, Moscow

R. A. Solovyev

AlphaChip LLC

Email: roman.solovyev.zf@gmail.com

Corr. Member of RAS, Ph.D., Deputy General Director for Innovation

Russian Federation, Zelenograd, Moscow

I. A. Mkrtychan

AlphaChip LLC; National Research University of Electronic Technology (MIET)

Email: mkrtychan@alphachip.ru

Postgraduate Student, Head of the Design Systems Division

Russian Federation, Zelenograd, Moscow; Zelenograd, Moscow

I. I. Shafeev

AlphaChip LLC; National Research University of Electronic Technology (MIET)

Email: shafeev@alphachip.ru

Postgraduate Student, Senior Design Engineer

Russian Federation, Zelenograd, Moscow; Zelenograd, Moscow

References

  1. Rehfeldt D., Koch T. Implications, conflicts, and reductions for Steiner trees, Mathematical Programming, 2023, no. 2 (197), pp. 903—966, doi: 10.1007/s10107-021-01757-5
  2. Kahng А. В., Wang L., Xu В. TritonRoute: The Open-Source Detailed Router, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2021, vol. 40, no. 3, pp. 547—559, doi: 10.1109/TCAD.2021.3079268
  3. Zhang Y., Chu C. RegularRoute: An efficient detailed router with regular routing patterns, Proceedings of the International Symposium on Physical Design (ISPD ’11), New York, NY, ACM, 2011, pp. 45—52, doi: 10.1145/1960397.1960410
  4. Chen H., Jiang M., Liu C., Ren H., Li Z., Li X., Pan D. Z. Reinforcement Learning Guided Detailed Routing for Custom Circuits, Proceedings of the International Symposium on Physical Design (ISPD ’23), New York, NY, ACM, 2023, pp. 26—34, doi: 10.1145/3569052.3571874
  5. Csurka G., Volpi R., Chidlovskii В. Semantic Image Segmentation: Two Decades of Research, Foundations and Trends in Computer Graphics and Vision, 2023, vol. 15, no. 2—3, pp. 73—279, doi: 10.1561/0600000095
  6. Hafiz A. M., Bhat G. M. А Survey on Instance Segmentation: State of the art, International Journal of Multimedia Information Retrieval, 2020, vol. 9, no. 3, pp. 171—189, doi: 10.1007/s13735-020-00195-x
  7. Thisanke H., Weerakoon S., Wijayasekara N. Semantic Segmentation using Vision Transformers: А survey, Engineering Applications of Artificial Intelligence, 2023, no. 126, doi: 10.1016/j.engappai.2023.106669
  8. Zhou T., Sun J., Li Y., Zhang Q., Zhou Z., Li X. Image Segmentation in Foundation Model Era: А Survey, arXiv preprint arXiv:2408.12957, 2024, doi: 10.48550/arXiv.2408.12957
  9. Sherwani N. A. Algorithms for VLSI Physical Design Automation, Boston, MA, Kluwer Academic Publishers, 1999, doi: 10.1007/b116436
  10. Kahng A. B., Lienig J., Markov I. L., Hu J. VLSI Physical Design: From Graph Partitioning to Timing Closure, Dordrecht, Springer, 2011, doi: 10.1007/978-90-481-9591-6
  11. Kahng A. B., Wang L., Xu В. The Tao of PAO: Anatomy of a Pin Access Oracle for Detailed Routing, Proceedings of the 57th Design Automation Conference (DAC 2020), San Francisco, CA, IEEE, pp. 1—6, doi: 10.1109/DAC18072.2020.9218532
  12. Xu X., Lu Y., Pan D. Z. Concurrent Pin Access Optimization for Unidirectional Routing, Proceedings of the Design Automation Conference (DAC ’17), New York, NY, ACM, 2017, pp. 1—6, doi: 10.1145/3061639.3062214
  13. Zeng W., Church R. L. Finding shortest paths on real road networks: The case for А*, International Journal of Geographical Information Science, 2009, vol. 23, no. 4, pp. 531—543, doi: 10.1080/13658810801949850
  14. Zhan F. B., Noon C. E. Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transportation Science, 1998, vol. 32, no. 1, pp. 65—73, doi: 10.1287/trsc.32.1.65
  15. Deisenroth M. P., Faisal A. A., Ong C. S. Mathematics for Machine Learning, Cambridge, Cambridge University Press, 2020, doi: 10.1017/9781108679930
  16. Shalev-Shwartz S., Ben-David S. Understanding Machine Learning: From Theory to Algorithms, Cambridge, Cambridge University Press, 2014, doi: 10.1017/CBO9781107298019
  17. Mohri M., Rostamizadeh A., Talwalkar А. Foundations of Machine Learning, Cambridge, MA, MIT Press, 2018.
  18. Stone M. Cross-Validatory Choice and Assessment of Statistical Predictions, Journal of the Royal Statistical Society: Series В (Methodological), 1974, vol. 36, no. 2, pp. 111—133, doi: 10.1111/j.2517-6161.1974.tb00994.x
  19. Wilimitis D., Walsh C. G. Practical Considerations and Applied Examples of Cross-Validation for Model Development and Evaluation in Health Care: Tutorial, JMIR AI, 2023, no. 2, e49023, doi: 10.2196/49023
  20. Cooper A., Harrison P. J., Prado R., West M. Cross-validatory model selection for Bayesian autoregressions with exogenous regressors, Bayesian Analysis, 2024, vol. 19, no. 1, pp. 1—25, doi: 10.1214/23-BA1409
  21. Mendel F., Nad T., Schläffer M. Improving Local Collisions: New Attacks on Reduced SHA-256, Advances in Cryptology — EUROCRYPT 2013 (LNCS 7881), Berlin, Springer, 2013, pp. 262—283, doi: 10.1007/978-3-642-38348-9_16

Supplementary files

Supplementary Files
Action
1. JATS XML
2. Рис. 1. Methods of representing a GCell graph: a — 2D GCell graph; b — 3D GCell graph

Download (111KB)
3. Рис. 2. Internal and boundary pins

Download (112KB)
4. Рис. 3. Decomposition of a G-Cell into a stack group

Download (54KB)
5. Рис. 4. Projection of the GCell geometric region onto a tensor: a — direct projection; b — indirect projection

Download (87KB)
6. Рис. 5. Subtensor of a net: a — horizontal metallization layer; b — vertical metallization layer

Download (70KB)
7. Рис. 6. Format of the target tensor representation

Download (44KB)
8. Рис. 7. Architecture of the neural network model

Download (66KB)

Copyright (c) 2026 Informacionnye Tehnologii



СМИ зарегистрировано Федеральной службой по надзору в сфере связи, информационных технологий и массовых коммуникаций (Роскомнадзор).
Регистрационный номер и дата принятия решения о регистрации СМИ: серия ПИ № 77 - 15565 от 02 июня 2003 г.