<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">trudyniisi</journal-id><journal-title-group><journal-title xml:lang="ru">Труды НИИСИ</journal-title><trans-title-group xml:lang="en"><trans-title>SRISA Proceedings</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2225-7349</issn><issn pub-type="epub">3033-6422</issn><publisher><publisher-name>НИЦ «КУРЧАТОВСКИЙ ИНСТИТУТ» - НИИСИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">trudyniisi-64</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ПРОЕКТИРОВАНИЕ И МОДЕЛИРОВАНИЕ СБИС</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>DESIGN AND MODELING OF VLSI</subject></subj-group></article-categories><title-group><article-title>Оценка карты разводимости при проектировании цифровых блоков СБИС с помощью графовых нейронных сетей</article-title><trans-title-group xml:lang="en"><trans-title>Estimation of Congestion Map in the VLSI Design of Digital Blocks with Graph Neural Network</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Желудков</surname><given-names>Н. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Zheludkov</surname><given-names>N. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">nvgel@cs.niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Карандашев</surname><given-names>Я. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Karandashev</surname><given-names>I. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">karandashev@niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кочева</surname><given-names>Е. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Kocheva</surname><given-names>E. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">nvgel@cs.niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Сайбодалов</surname><given-names>М. Х.</given-names></name><name name-style="western" xml:lang="en"><surname>Saibodalov</surname><given-names>M. K.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">nvgel@cs.niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Сохова</surname><given-names>З. Б.</given-names></name><name name-style="western" xml:lang="en"><surname>Sokhova</surname><given-names>Z. B.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">nvgel@cs.niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Умнова</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Umnova</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">nvgel@cs.niisi.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">ФГУ ФНЦ НИИСИ РАН<country>Россия</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>21</day><month>10</month><year>2025</year></pub-date><volume>13</volume><issue>4</issue><fpage>91</fpage><lpage>96</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Желудков Н.В., Карандашев Я.М., Кочева Е.С., Сайбодалов М.Х., Сохова З.Б., Умнова А.А., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Желудков Н.В., Карандашев Я.М., Кочева Е.С., Сайбодалов М.Х., Сохова З.Б., Умнова А.А.</copyright-holder><copyright-holder xml:lang="en">Zheludkov N.V., Karandashev I.M., Kocheva E.S., Saibodalov M.K., Sokhova Z.B., Umnova A.A.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.t-niisi.ru/jour/article/view/64">https://www.t-niisi.ru/jour/article/view/64</self-uri><abstract><p>В рамках данной работы рассматривается решение задачи оценки карты разводимости на ранних этапах топологического проектирования цифровых блоков СБИС с помощью применения нейросетевой модели машинного обучения, основанной на графовой нейронной сети. Раннее предсказание проблемных мест с разводкой позволит разработчику топологии изменить такие характеристики проектируемого блока, как план размещения, расположение макроблоков, а также входных и выходных портов таким образом, чтобы предотвратить возникновение проблем с трассировкой соединений на поздних этапах, тем самым сократив число запусков САПР и общее время проектирования схемы. Применение графовых нейронных сетей позволяет учитывать дополнительную информацию о связях элементов в нетлисте, для более точного предсказания.</p></abstract><trans-abstract xml:lang="en"><p>This paper considers a solution to the problem of estimating the congestion map in the early stages of VLSI layout design of digital blocks by applying a neural network model of machine learning based on a graph neural network. Early prediction of congestion problems will allow the layout engineer to modify design block characteristics such as floorplan, IP-block`s placement and input-output ports to prevent interconnect routing issues at later stages, thereby reducing the number of CAD runs and overall circuit design runtime. The application of graph neural networks allows to take into account additional information about the connections of elements in the netlist for more accurate prediction.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>СБИС</kwd><kwd>топологическое проектирование</kwd><kwd>карта разводимости</kwd><kwd>машинное обучение</kwd><kwd>графовые нейронные сети</kwd></kwd-group><kwd-group xml:lang="en"><kwd>VLSI</kwd><kwd>layout design</kwd><kwd>congestion map</kwd><kwd>machine learning</kwd><kwd>graph neural networks</kwd></kwd-group><funding-group xml:lang="ru"><funding-statement>Публикация выполнена в рамках государственного задания ФГУ ФНЦ НИИСИ РАН по теме № FNEF-2022-0008.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">[Электронный ресурс]. URL: https://theopenroadproject.org/ (дата обращения: 10.11.2023)</mixed-citation><mixed-citation xml:lang="en">[Электронный ресурс]. URL: https://theopenroadproject.org/ (дата обращения: 10.11.2023)</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">A.B. Chowdhury, B. Tan, R. Karri, S. Garg. OpenABC-D: A Large-Scale Dataset for Machine Learning Guided Integrated Circuit Synthesis. (2021). ArXiv preprint (2021) arXiv:2110.11292.</mixed-citation><mixed-citation xml:lang="en">A.B. Chowdhury, B. Tan, R. Karri, S. Garg. OpenABC-D: A Large-Scale Dataset for Machine Learning Guided Integrated Circuit Synthesis. (2021). ArXiv preprint (2021) arXiv:2110.11292.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">R. Kirby, S. Godil, R. Roy, B. Catanzaro. Congestionnet: Routing congestion prediction using deep graph neural networks. «2019 IFIP/IEEE 27th International Conference on Very Large Scale Integration (VLSI-SoC)», 2019, pp. 217–222.</mixed-citation><mixed-citation xml:lang="en">R. Kirby, S. Godil, R. Roy, B. Catanzaro. Congestionnet: Routing congestion prediction using deep graph neural networks. «2019 IFIP/IEEE 27th International Conference on Very Large Scale Integration (VLSI-SoC)», 2019, pp. 217–222.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">A. Ghose, V. Zhang, Y. Zhang, D. Li, W. Liu, M. Coates. Generalizable cross-graph embedding for GNN-based congestion prediction. «2021 IEEE/ACM International Conference on Computer Aided Design (ICCAD)», 2021, pp. 1–9.</mixed-citation><mixed-citation xml:lang="en">A. Ghose, V. Zhang, Y. Zhang, D. Li, W. Liu, M. Coates. Generalizable cross-graph embedding for GNN-based congestion prediction. «2021 IEEE/ACM International Conference on Computer Aided Design (ICCAD)», 2021, pp. 1–9.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, Y. Bengio. Graph attention networks. ArXiv preprint (2017) arXiv:1710.10903.</mixed-citation><mixed-citation xml:lang="en">P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, Y. Bengio. Graph attention networks. ArXiv preprint (2017) arXiv:1710.10903.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">W.L. Hamilton, Z. Ying, J. Leskovec. Inductive representation learning on large graphs. «Neural Information Processing Systems», 2017.</mixed-citation><mixed-citation xml:lang="en">W.L. Hamilton, Z. Ying, J. Leskovec. Inductive representation learning on large graphs. «Neural Information Processing Systems», 2017.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">M. Fey, J.E. Lenssen. Fast Graph Representation Learning with PyTorch Geometric. «ICLR Work-shop on Representation Learning on Graphs and Manifolds», 2019.</mixed-citation><mixed-citation xml:lang="en">M. Fey, J.E. Lenssen. Fast Graph Representation Learning with PyTorch Geometric. «ICLR Work-shop on Representation Learning on Graphs and Manifolds», 2019.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">P. Kudva, A. Sullivan, W. Dougherty. Metrics for structural logic synthesis. «IEEE/ACM International Conference on Computer Aided Design», 2002, pp. 551−556.</mixed-citation><mixed-citation xml:lang="en">P. Kudva, A. Sullivan, W. Dougherty. Metrics for structural logic synthesis. «IEEE/ACM International Conference on Computer Aided Design», 2002, pp. 551−556.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
