Fetching the paper…
Reading the bibliography…
Placement and routing are two indispensable and challenging (NP-hard) tasks in modern chip design flows.
An algorithm for path connections and its applications
C. Y. Lee · 1961
Earlier work this paper cites.
A class of min-cut placement algorithms
M. A. Breuer · 1977
Earlier work this paper cites.
A linear-time heuristic for improving network partitions
C. M. Fiduccia and R. M. Mattheyses · 1982
Earlier work this paper cites.
Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)
J. Hartmanis · 1982
Earlier work this paper cites.
Efficient algorithms for channel routing
T. Yoshimura and E. S. Kuh · 1982
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, D. Gelatt, and M. Vecchi · 1983
Earlier work this paper cites.
A detailed router based on incremental routing modifications: Mighty
H. Shin and A. Sangiovanni-Vincentelli · 1987
Earlier work this paper cites.
Speed: Fast and efficient timing driven placement
B. Riess and G. Ettelt · 1995
Earlier work this paper cites.
Optimal partitioners and end-case placers for standard-cell layout
A. E. Caldwell, A. B. Kahng, and I. L. Markov · 2000
Earlier work this paper cites.
Dune-a multilayer gridless routing system
J. Cong, J. Fang, and K.-Y. Khoo · 2001
Earlier work this paper cites.
Track assignment: A desirable intermediate step between global routing and detailed routing
S. Batterywala, N. Shenoy, W. Nicholls, and H. Zhou · 2002
Earlier work this paper cites.
Pattern routing: Use and theory for increasing predictability and avoiding coupling
R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh · 2002
Earlier work this paper cites.
A new fpga detailed routing approach via search-based boolean satisfiability
G.-J. Nam, K. A. Sakallah, and R. A. Rutenbar · 2002
Earlier work this paper cites.
Mr: A new framework for multilevel full-chip routing
Y. Chang and S. Lin · 2004
Earlier work this paper cites.
An orthogonal simulated annealing algorithm for large floorplanning problems
S.-Y. Ho, S.-J. Ho, Y.-K. Lin, and W.-C. Chu · 2004
Earlier work this paper cites.
Recursive bisection placement: Feng shui 5.0 implementation details
A. R. Agnihotri, S. Ono, and P. H. Madden · 2005
Earlier work this paper cites.
Power-aware placement
Y. Cheon, P. Ho, A. Kahng, S. Reda, and Q. Wang · 2005
Earlier work this paper cites.
Implementation and extensibility of an analytic placer
A. Kahng and Q. Wang · 2005
Earlier work this paper cites.
Dragon2005: Large-scale mixed-size placement tool
T. Taghavi, X. Yang, and B. Choi · 2005
Earlier work this paper cites.
A new lp based incremental timing driven placement for high performance designs
T. Luo, D. Newmark, and D. Z. Pan · 2006
Earlier work this paper cites.
Boxrouter: A new global router based on box expansion and progressive ilp
M. Cho and D. Pan · 2007
Earlier work this paper cites.
Flute: Fast lookup table based rectilinear steiner minimal tree algorithm for vlsi design
C. Chu and Y.-C. Wong · 2007
Earlier work this paper cites.
ISPD 2007 Global Routing Contest
G.-J. Nam, M. Yildiz, D. Pan, and P. Madden · 2007
Earlier work this paper cites.
Constraint graph-based macro placement for modern mixed-size circuit designs
H. Chen, Y. Chuang, Y.-W. Chang, and Y. Chang · 2008
Earlier work this paper cites.
Ntuplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints
T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang · 2008
Earlier work this paper cites.
A new global router for modern designs
J.-R. Gao, P.-C. Wu, and T.-C. Wang · 2008
Earlier work this paper cites.
The ispd global routing benchmark suite
G.-J. Nam, C. Sze, and M. Yildiz · 2008
Earlier work this paper cites.
Kraftwerk2-a fast force-directed quadratic placement approach using an accurate net model
P. Spindler, U. Schlichtmann, and F. Johannes · 2008
Earlier work this paper cites.
High-performance global routing with fast overflow reduction
H. Chen, C. Hsu, and Y. Chang · 2009
Earlier work this paper cites.
Archer: A history-based global routing algorithm
M. Ozdal and M. Wong · 2009
Earlier work this paper cites.
Detailed-routing algorithms for dense pin clusters in integrated circuits
M. M. Ozdal · 2009
Earlier work this paper cites.
Grip: Scalable 3d global routing using integer programming
T. Wu, A. Davoodi, and J. Linderoth · 2009
Earlier work this paper cites.
What makes a design difficult to route
C. Alpert, Z. Li, M. Moffitt, G. Nam, J. Roy, and G. Tellez · 2010
Cited alongside, same era.
Nthu-route 2.0: a robust global router for modern designs
Y.-J. Chang, Y.-T. Lee, J.-R. Gao, P.-C. Wu, and T.-C. Wang · 2010
Cited alongside, same era.
A parallel integer programming approach to global routing
T. Wu, A. Davoodi, and J. Linderoth · 2010
Cited alongside, same era.
Routability-driven analytical placement for mixed-size circuit designs
M.-K. Hsu, S. Chou, T.-H. Lin, and Y.-W. Chang · 2011
Cited alongside, same era.
A simplr method for routability-driven placement
M.-C. Kim, J. Hu, D.-J. Lee, and I. Markov · 2011
Cited alongside, same era.
Gridless pin access in detailed routing
T. Nieberg · 2011
Cited alongside, same era.
A machine learning framework to identify detailed routing short violations from a placed netlist
A. F. Tabrizi, L. Rakai, N. K. Darav, I. Bustany, L. Behjat, S. Xu, and A. Kennings · 2018
Later among the works it cites.
Routenet: Routability prediction for mixed-size designs using convolutional neural network
Z. Xie, Y. Huang, G. Fang, H. Ren, S. Fang, Y. Chen, and J. Hu · 2018
Later among the works it cites.
Detailed routing by sparse grid graph and minimum-area-captured path search
G. Chen, C. Pui, H. Li, J. Chen, B. Jiang, and E. Young · 2019
Later among the works it cites.
Routability-driven macro placement with embedded cnn-based prediction model
Y. Huang, Z. Xie, G. Fang, T. Yu, H. Ren, S. Fang, Y. Chen, and J. Hu · 2019
Later among the works it cites.
Dr. cu 2.0: A scalable detailed routing framework with correct-by-construction design rule satisfaction
H. Li, G. Chen, B. Jiang, J. Chen, and E. F. Young · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The ispd-2011 routability-driven placement contest and benchmark suite
N. Viswanathan, C. Alpert, C. Sze, Z. Li, G. Nam, and J. Roy · 2011
Cited alongside, same era.
Regularroute: An efficient detailed router with regular routing patterns
Y. Zhang and C. Chu · 2011
Cited alongside, same era.
Obstacle-aware clock-tree shaping during placement
D. Lee and I. Markov · 2012
Cited alongside, same era.
Fastroute: An efficient and high-quality global router
M. Pan, Y. Xu, Y. Zhang, and C. Chu · 2012
Cited alongside, same era.
Pade: A high-performance placer with automatic datapath extraction and evaluation through high-dimensional data learning
S. Ward, D. Ding, and D. Z. Pan · 2012
Cited alongside, same era.
Nctu-gr 2.0: Multithreaded collision-aware global routing with bounded-length maze routing
W.-H. Liu, W.-C. Kao, Y.-L. Li, and K.-Y. Chao · 2013
Cited alongside, same era.
Ispd 2019 initial detailed routing contest and benchmark with advanced routing rules
W. Liu, S. Mantik, W. Chow, Y. Ding, A. Farshidi, and G. Posser · 2019
Later among the works it cites.
Painting on placement: Forecasting routing congestion using conditional generative adversarial nets
C. Yu and Z. Zhang · 2019
Later among the works it cites.
Supervised-learning congestion predictor for routability-driven global routing
Z. Zhou, S. Chahal, T.-Y. Ho, and A. Ivanov · 2019
Later among the works it cites.
Vlsi placement parameter optimization using deep reinforcement learning
A. Agnesina, K. Chang, and S. K. Lim · 2020
Later among the works it cites.
High-definition routing congestion prediction for large-scale fpgas
M. Alawieh, W. Li, Y. Lin, L. Singhal, M. Iyer, and D. Pan · 2020
Later among the works it cites.
Pros: A plug-in for routability optimization applied in the state-of-the-art commercial eda tool using deep learning
J. Chen, J. Kuang, G. Zhao, D. Huang, and E. Young · 2020
Later among the works it cites.
Circuit routing using monte carlo tree search and deep neural networks
Y. He and F. S. Bao · 2020
Later among the works it cites.
Learn to floorplan through acquisition of effective local search heuristics
Z. He, Y. Ma, L. Zhang, P. Liao, N. Wong, B. Yu, and M. D. Wong · 2020
Later among the works it cites.
Drc hotspot prediction at sub-10nm process nodes using customized convolutional network
R. Liang, H. Xiang, D. Pandey, L. Reddy, S. Ramji, G.-J. Nam, and J. Hu · 2020
Later among the works it cites.
Attention routing: track-assignment detailed routing using attention-based reinforcement learning
H. Liao, Q. Dong, X. Dong, W. Zhang, W. Zhang, W. Qi, E. Fallon, and L. B. Kara · 2020
Later among the works it cites.
A deep reinforcement learning approach for global routing
H. Liao, W. Zhang, X. Dong, B. Poczos, K. Shimada, and L. Burak Kara · 2020
Later among the works it cites.
Dreamplace: Deep learning toolkit-enabled gpu acceleration for modern vlsi placement
Y. Lin, Z. Jiang, J. Gu, W. Li, S. Dhar, H. Ren, B. Khailany, and D. Pan · 2020
Later among the works it cites.
A novel b* tree crossover-based simulated annealing algorithm for combinatorial optimization in vlsi fixed-outline floorplans
M. Shunmugathammal, C. Columbus, and S. Anand · 2020
Later among the works it cites.
Late breaking results: A neural network that routes ics
D. Utyamishev and I. Partin-Vaisband · 2020
Later among the works it cites.
Placement in integrated circuits using cyclic reinforcement learning and simulated annealing
D. Vashisht, H. Rampal, H. Liao, Y. Lu, D. Shanbhag, E. Fallon, and L. B. Kara · 2020
Later among the works it cites.
A deep learning framework to predict routability for fpga circuit placement
A. Al-Hyari, H. Szentimrey, A. Shamli, T. Martin, G. Gréwal, and S. Areibi · 2021
Later among the works it cites.
On joint learning for solving placement and routing in chip design
R. Cheng and J. Yan · 2021
Later among the works it cites.
A survey of machine learning methods and applications in electronic design automation
V. Hamolia and V. Melnyk · 2021
Later among the works it cites.
Machine learning for electronic design automation: A survey
G. Huang, J. Hu, Y. He, J. Liu, M. Ma, Z. Shen, J. Wu, et al · 2021
Later among the works it cites.
Asynchronous reinforcement learning framework and knowledge transfer for net order exploration in detailed routing
Y. Lin, T. Qu, Z. Lu, Y. Su, and Y. Wei · 2021
Later among the works it cites.
Rest: Constructing rectilinear steiner minimum tree via reinforcement learning
J. Liu, G. Chen, and E. F. Young · 2021
Later among the works it cites.
Global placement with deep learning-enabled explicit routability optimization
S. Liu, Q. Sun, P. Liao, Y. Lin, and B. Yu · 2021
Later among the works it cites.
The law of attraction: Affinity-aware placement optimization using graph neural networks
Y.-C. Lu, S. Pentapati, and S. K. Lim · 2021
Later among the works it cites.
A graph placement methodology for fast chip design
A. Mirhoseini, A. Goldie, M. Yazgan, J. W. Jiang, E. Songhori, S. Wang, Y.-J. Lee, E. Johnson, O. Pathak, A. Nazi, et al · 2021
Later among the works it cites.
Mlcad: A survey of research in machine learning for cad keynote paper
M. Rapp, H. Amrouch, Y. Lin, B. Yu, D. Z. Pan, M. Wolf, and J. Henkel · 2021
Later among the works it cites.
Standard cell routing with reinforcement learning and genetic algorithm in advanced technology nodes
H. Ren and M. Fojtik · 2021
Later among the works it cites.