Effective and Efficient Detailed Routing with Adaptive Rip-up Scheme and Pin Access Refinement-Reference-Cited by-同舟云学术

Effective and Efficient Detailed Routing with Adaptive Rip-up Scheme and Pin Access Refinement

Published:2022-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Great Lakes Symposium on VLSI 2022
language:
Short-container-title:

Author:

Qi Zhongdong¹,Zhang Jingchong²,Chen Gengjie³,You Hailong¹

Affiliation:

1. Xidian University, Xi'an, China

2. Giga Design Automation, Shenzhen, China

3. The Chinese University of Hong Kong, Hong Kong SAR, China

Funder

The Fundamental Research Funds for the Central Universities

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3526241.3530361

Reference11 articles.

1. VLSI Physical Design: From Graph Partitioning to Timing Closure

2. Detailed Routing Algorithms for Advanced Technology Nodes

3. MCFRoute: A detailed router based on multi-commodity flow method

4. S. Mantik , G. Posser , W.-K. Chow , Y. Ding and W.-H. Liu , "ISPD 2018 initial detailed routing contest and benchmarks," in Proc . ISPD , 2018, pp. 140 -- 143 . S. Mantik, G. Posser, W.-K. Chow, Y. Ding and W.-H. Liu, "ISPD 2018 initial detailed routing contest and benchmarks," in Proc. ISPD, 2018, pp. 140--143.

5. W.-H. Liu , S. Mantik , W.-K. Chow , Y. Ding , A. Farshidi and G. Posser , " ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules," in Proc . ISPD , 2019 , pp. 147 -- 151 . W.-H. Liu, S. Mantik, W.-K. Chow, Y. Ding, A. Farshidi and G. Posser, "ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules," in Proc. ISPD, 2019, pp. 147--151.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Applying reinforcement learning to learn best net to rip and re-route in global routing;ACM Transactions on Design Automation of Electronic Systems;2024-07-09