<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Informacionnye Tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Informacionnye Tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Информационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1684-6400</issn><publisher><publisher-name xml:lang="en">New Technologies Publishing House</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">702930</article-id><article-id pub-id-type="doi">10.17587/it.32.67-76</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Cad-systems</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Системы автоматизированного проектирования</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Acceleration of detailed VLSI routing using machine learning methods</article-title><trans-title-group xml:lang="ru"><trans-title>Ускорение детальной трассировки СБИС с помощью методов машинного обучения</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Stempkovsky</surname><given-names>A. L.</given-names></name><name xml:lang="ru"><surname>Стемпковский</surname><given-names>А. Л.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Academician of RAS,<bold> </bold>Ph.D., General Director</p></bio><bio xml:lang="ru"><p>акад. РАН,<bold> </bold>д-р техн. наук, генеральный директор</p></bio><email>stempkovsky@alphachip.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Telpuhkov</surname><given-names>D. V.</given-names></name><name xml:lang="ru"><surname>Тельпухов</surname><given-names>Д. В.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Ph.D., Deputy General Director for Research</p></bio><bio xml:lang="ru"><p>д-р техн. наук, зам. генерального директора по научной работе</p></bio><email>telpukhov@alphachip.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Solovyev</surname><given-names>R. A.</given-names></name><name xml:lang="ru"><surname>Соловьев</surname><given-names>Р. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Corr. Member of RAS, Ph.D., Deputy General Director for Innovation</p></bio><bio xml:lang="ru"><p>чл.-кор. РАН, д-р техн. наук, зам. генерального директора по инновационной деятельности</p></bio><email>roman.solovyev.zf@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Mkrtychan</surname><given-names>I. A.</given-names></name><name xml:lang="ru"><surname>Мкртычан</surname><given-names>И. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Postgraduate Student, Head of the Design Systems Division</p></bio><bio xml:lang="ru"><p>аспирант, нач. отдела</p></bio><email>mkrtychan@alphachip.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Shafeev</surname><given-names>I. I.</given-names></name><name xml:lang="ru"><surname>Шафеев</surname><given-names>И. И.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Postgraduate Student, Senior Design Engineer</p></bio><bio xml:lang="ru"><p>аспирант, ст. инженер</p></bio><email>shafeev@alphachip.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">AlphaChip LLC</institution></aff><aff><institution xml:lang="ru">ООО "Альфачип"</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">National Research University of Electronic Technology (MIET)</institution></aff><aff><institution xml:lang="ru">Национальный исследовательский университет "МИЭТ"</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2026-02-18" publication-format="electronic"><day>18</day><month>02</month><year>2026</year></pub-date><volume>32</volume><issue>2</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>67</fpage><lpage>76</lpage><history><date date-type="received" iso-8601-date="2026-02-17"><day>17</day><month>02</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-02-17"><day>17</day><month>02</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2026, Informacionnye Tehnologii</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2026, Информационные технологии</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="en">Informacionnye Tehnologii</copyright-holder><copyright-holder xml:lang="ru">Информационные технологии</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/1684-6400/article/view/702930">https://journals.eco-vector.com/1684-6400/article/view/702930</self-uri><abstract xml:lang="en"><p>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&amp;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&amp;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.</p></abstract><trans-abstract xml:lang="ru"><p>Предложен гибридный подход для ускорения детальной трассировки СБИС, объединяющий модель нейронной сети на основе U-Net с Self-Attention и классический подход на основе алгоритма Rip-Up and Reroute. Эксперименты показали значительное ускорение трассировки. Предложенное решение демонстрирует эффективность применения методов машинного обучения в задаче физического синтеза.</p></trans-abstract><kwd-group xml:lang="en"><kwd>VLSI</kwd><kwd>detailed routing</kwd><kwd>optimization algorithms</kwd><kwd>machine learning</kwd><kwd>design automation</kwd><kwd>heuristic methods</kwd><kwd>routing acceleration</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>сверхбольшие интегральные схемы</kwd><kwd>детальная трассировка</kwd><kwd>алгоритмы оптимизации</kwd><kwd>машинное обучение</kwd><kwd>автоматизация проектирования</kwd><kwd>эвристические методы</kwd><kwd>сокращение времени трассировки</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Rehfeldt D., Koch T. Implications, conflicts, and reductions for Steiner trees // Mathematical Programming. 2023. N. 2 (197). P. 903—966. DOI: 10.1007/s10107-021-01757-5.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Kahng A. B., Wang L., Xu В. TritonRoute: The Open-Source Detailed Router // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2021. Vol. 40, N. 3. P. 547—559. DOI: 10.1109/TCAD.2021.3079268.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">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: ACM, 2011. P. 45—52. DOI: 10.1145/1960397.1960410.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Chen H. et al. Reinforcement Learning Guided Detailed Routing for Custom Circuits // Proceedings of the International Symposium on Physical Design (ISPD’23). New York: ACM, 2023. P. 26—34. DOI: 10.1145/3569052.3571874.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Csurka G., Volpi R., Chidlovskii В. Semantic Image Segmentation: Two Decades of Research // Foundations and Trends in Computer Graphics and Vision. 2023. Vol. 15, N. 2—3. P. 73—279. DOI: 10.1561/0600000095.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Hafiz A. M., Bhat G. M. А Survey on Instance Segmentation: State of the art // International Journal of Multimedia Information Retrieval. 2020. Vol. 9, N. 3. P. 171—189. DOI: 10.1007/s13735-020-00195-x.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Thisanke H. et al. Semantic Segmentation using Vision Transformers: А survey // Engineering Applications of Artificial Intelligence. 2023. DOI: 10.1016/j.engappai.2023.106669.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Zhou T. et al. Image Segmentation in Foundation Model Era: А Survey [Электронный ресурс]. 2024. URL: https://doi.org/10.48550/arXiv.2408.12957.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Sherwani N. A. Algorithms for VLSI Physical Design Automation, Boston, MA, Kluwer Academic Publishers, 1999, DOI: 10.1007/b116436</mixed-citation><mixed-citation xml:lang="ru">Sherwani N. A. Algorithms for VLSI Physical Design Automation. USA: Kluwer Academic Publishers, 1999. 572 p. DOI: 10.1007/b116436.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Kahng A. B., Lienig J., Markov I. L., Hu J. VLSI Physical Design: From Graph Partitioning to Timing Closure. Dordrecht: Springer Netherlands, 2011. DOI: 10.1007/978-90-481-9591-6.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Kahng A. B., Wang L., Xu В. The Tao of PAO: Anatomy of a Pin Access Oracle for Detailed Routing // Proceedings of the DAC 2020. San Francisco: IEEE, 2020. P. 1—6. DOI: 10.1109/DAC18072.2020.9218532.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Xu X. et al. Concurrent Pin Access Optimization for Unidirectional Routing // Proceedings of the DAC ’17. New York: ACM, 2017. P. 1—6. DOI: 10.1145/3061639.3062214.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Zeng W., Church R. L. Finding shortest paths on real road networks: the case for А* // International Journal of Geographical Information Science. 2009. Vol. 23, N. 4. P. 531—543. DOI: 10.1080/13658810801949850.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Zhan F. B., Noon C. E. Shortest Path Algorithms: An Evaluation Using Real Road Networks // Transportation Science. 1998. Vol. 32, N. 1. P. 65—73. DOI: 10.1287/trsc.32.1.65.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Deisenroth M. P., Faisal A. A., Ong C. S. Mathematics for Machine Learning, Cambridge, Cambridge University Press, 2020, DOI: 10.1017/9781108679930</mixed-citation><mixed-citation xml:lang="ru">Deisenroth M. P., Faisal A. A., Ong C. S. Mathematics for Machine Learning. Cambridge: Cambridge University Press, 2020. DOI: 10.1017/9781108679930.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Shalev-Shwartz S., Ben-David S. Understanding Machine Learning: From Theory to Algorithms, Cambridge, Cambridge University Press, 2014, DOI: 10.1017/CBO9781107298019</mixed-citation><mixed-citation xml:lang="ru">Shalev-Shwartz S., Ben-David S. Understanding Machine Learning: From Theory to Algorithms. Cambridge: Cambridge University Press, 2014. DOI: 10.1017/CBO9781107298019.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Mohri M., Rostamizadeh A., Talwalkar А. Foundations of Machine Learning, Cambridge, MA, MIT Press, 2018.</mixed-citation><mixed-citation xml:lang="ru">Mohri M., Rostamizadeh A., Talwalkar А. Foundations of Machine Learning. Cambridge, Mass.; London: The MIT Press, 2018. 412 p.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Stone M. Cross-Validatory Choice and Assessment of Statistical Predictions // Journal of the Royal Statistical Society. Series В (Methodological). 1974. Vol. 36, N. 2. P. 111—133. DOI: 10.1111/j.2517-6161.1974.tb00994.x.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">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. Vol. 2. P. e49023. DOI: 10.2196/49023.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Cooper A. et al. Cross-validatory model selection for Bayesian autoregressions with exogenous regressors // Bayesian Analysis. 2024. DOI: 10.1214/23-BA1409.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">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</mixed-citation><mixed-citation xml:lang="ru">Mendel F., Nad T., Schläffer M. Improving Local Collisions: New Attacks on Reduced SHA-256 // Advances in Cryptology — EUROCRYPT 2013. LNCS. Berlin: Springer, 2013. P. 262—283. DOI: 10.1007/978-3-642-38348-9_16</mixed-citation></citation-alternatives></ref></ref-list></back></article>
