Towards machine learning for placement and routing in chip design: a methodological overview

J Yan, X Lyu, R Cheng, Y Lin - arxiv preprint arxiv:2202.13564, 2022 - arxiv.org
Placement and routing are two indispensable and challenging (NP-hard) tasks in modern
chip design flows. Compared with traditional solvers using heuristics or expert-well …

2019 cad contest: Lef/def based global routing

S Dolgov, A Volkov, L Wang… - 2019 IEEE/ACM …, 2019 - ieeexplore.ieee.org
In advanced nodes, routing has become more and more complicated. The ISPD-2018 and
ISPD-2019 Initial Detailed Routing Contests [10][11] were held to bridge the detailed routing …

New placement prediction and mitigation techniques for local routing congestion

T Taghavi, Z Li, C Alpert, GJ Nam… - 2010 IEEE/ACM …, 2010 - ieeexplore.ieee.org
Local routing congestion is becoming increasingly important as complex design rules make
local pin access the bottleneck for modern designs and routers. Since congestion analysis …

BeGAN: Power grid benchmark generation using a process-portable GAN-based methodology

VA Chhabria, K Kunal, M Zabihi… - 2021 IEEE/ACM …, 2021 - ieeexplore.ieee.org
Evaluating CAD solutions to physical implementation problems has been extremely
challenging due to the unavailability of modern benchmarks in the public domain. This work …

TritonRoute-WXL: The open-source router with integrated DRC engine

AB Kahng, L Wang, B Xu - IEEE Transactions on Computer …, 2021 - ieeexplore.ieee.org
Routing is a crucial stage in a modern design automation tool flow for advanced technology
nodes. Works in the recent open literature tend to divide routing into separate global routing …

What makes a design difficult to route

CJ Alpert, Z Li, MD Moffitt, GJ Nam, JA Roy… - Proceedings of the 19th …, 2010 - dl.acm.org
Traditionally, the goal of physical synthesis has been to produce a physical realization of the
input netlist that meets its timing constraints with minimum area. However, design routability …

NCTU-GR: Efficient simulated evolution-based rerouting and congestion-relaxed layer assignment on 3-D global routing

KR Dai, WH Liu, YL Li - IEEE Transactions on very large scale …, 2011 - ieeexplore.ieee.org
The increasing complexity of interconnection designs has enhanced the importance of
research into global routing when seeking high-routability (low overflow) results or rapid …

Machine learning optimal ordering in global routing problems in semiconductors

H Choi, M Lee, CH Lee, J Yang, RK Seong - Scientific Reports, 2024 - nature.com
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 …

CRISP: Congestion reduction by iterated spreading during placement

JA Roy, N Viswanathan, GJ Nam, CJ Alpert… - Proceedings of the …, 2009 - dl.acm.org
Dramatic progress has been made in algorithms for placement and routing over the last 5
years, with improvements in both speed and quality. Combining placement and routing into …

TILA-S: Timing-driven incremental layer assignment avoiding slew violations

D Liu, B Yu, S Chowdhury… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
As very large scale integration technology scales to deep submicrometer and beyond,
interconnect delay greatly limits the circuit performance. The traditional 2-D global routing …