Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913629355376640 |
|---|---|
| author | Choi, Heejin Lee, Minji Lee, Chang Hyeong Yang, Jaeho Seong, Rak-Kyeong |
| author_facet | Choi, Heejin Lee, Minji Lee, Chang Hyeong Yang, Jaeho Seong, Rak-Kyeong |
| contents | In this work, we propose a new method for ordering nets during the process of layer assignment in global routing problems. The global routing problems that we focus on in this work are based on routing problems that occur in the design of substrates in multilayered semiconductor packages. The proposed new method is based on machine learning techniques and we show that the proposed method supersedes conventional net ordering techniques based on heuristic score functions. We perform global routing experiments in multilayered semiconductor package environments in order to illustrate that the routing order based on our new proposed technique outperforms previous methods based on heuristics. Our approach of using machine learning for global routing targets specifically the net ordering step which we show in this work can be significantly improved by deep learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_21035 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors Choi, Heejin Lee, Minji Lee, Chang Hyeong Yang, Jaeho Seong, Rak-Kyeong Machine Learning Discrete Mathematics In this work, we propose a new method for ordering nets during the process of layer assignment in global routing problems. The global routing problems that we focus on in this work are based on routing problems that occur in the design of substrates in multilayered semiconductor packages. The proposed new method is based on machine learning techniques and we show that the proposed method supersedes conventional net ordering techniques based on heuristic score functions. We perform global routing experiments in multilayered semiconductor package environments in order to illustrate that the routing order based on our new proposed technique outperforms previous methods based on heuristics. Our approach of using machine learning for global routing targets specifically the net ordering step which we show in this work can be significantly improved by deep learning. |
| title | Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors |
| topic | Machine Learning Discrete Mathematics |
| url | https://arxiv.org/abs/2412.21035 |