Metraipolis › archive › dc_db6c679b0f9a
Validity-Preserving Hierarchical RL for Joint Routing and Switch Placement in EDA — arXiv:2609.39749
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39749
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T13:46:33.167Z
- SHA-256 of the archived text
98b3c3a28ed5b0c00fef1727febcba2ad40587b1fb16d234ce9c9f82128b99d0- Stable URL of this page
https://metraipolis.com/documento/dc_db6c679b0f9a
How to cite
Validity-Preserving Hierarchical RL for Joint Routing and Switch Placement in EDA — arXiv:2609.39749 — arXiv (en), https://arxiv.org/abs/2609.39749 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db6c679b0f9a (Metraipolis archive dc_db6c679b0f9a, sha256 98b3c3a28ed5b0c00fef1727febcba2ad40587b1fb16d234ce9c9f82128b99d0)
BibTeX
@misc{dcdb6c679b0f9a,
title = {Validity-Preserving Hierarchical RL for Joint Routing and Switch Placement in EDA — arXiv:2609.39749},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39749},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db6c679b0f9a; sha256 98b3c3a28ed5b0c00fef1727febcba2ad40587b1fb16d234ce9c9f82128b99d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39749. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Routing and switch placement are fundamental combinatorial optimization problems in chip design, requiring the joint optimization of routing topology and physical placement under strict structural, geometric and logical constraints. Existing approaches typically rely on carefully engineered heuristics that incorporate strong problem-specific biases to navigate the enormous space of possible designs. In this work, we introduce a hierarchical reinforcement learning framework for joint routing and switch placement at the level of logical communication routes. Starting from a minimal routing graph, our method progressively constructs increasingly expressive solutions through three coupled operations: switch expansion, switch placement, and route refinement. These operations preserve routing validity by construction, restricting exploration to feasible configurations where every communicating initiator-target pair has one assigned loop-free route. We explore the induced solution space using Gumbel Monte Carlo Tree Search, showing that neural-guided search substantially improves solution quality over non-learning optimization methods. Furthermore, pretraining across floorplans provides a strong initialization for fine-tuning on unseen instances. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.39749 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T13:18:10.442Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).