The policy-gradient placement and generative routing neural networks for chip design
Placement and routing are two critical yet time-consuming steps of chip design in modern
VLSI systems. Distinct from traditional heuristic solvers, this paper on one hand proposes an …
VLSI systems. Distinct from traditional heuristic solvers, this paper on one hand proposes an …
A survey of swarm intelligence techniques in VLSI routing problems
Routing is a complex and critical stage in the physical design of Very Large Scale
Integration (VLSI), minimizing interconnect length and delay to optimize overall chip …
Integration (VLSI), minimizing interconnect length and delay to optimize overall chip …
A survey on steiner tree construction and global routing for vlsi design
Global Routing (GR) is a crucial and complex stage in the Very Large-Scale Integration
(VLSI) design, which minimizes interconnect wirelength and delay to optimize the overall …
(VLSI) design, which minimizes interconnect wirelength and delay to optimize the overall …
Dr. CU: Detailed routing by sparse grid graph and minimum-area-captured path search
Different from global routing, detailed routing takes care of many detailed design rules and is
performed on a significantly larger routing grid graph. In advanced technology nodes, it …
performed on a significantly larger routing grid graph. In advanced technology nodes, it …
XGRouter: high-quality global router in X-architecture with particle swarm optimization
G Liu, W Guo, R Li, Y Niu, G Chen - Frontiers of Computer Science, 2015 - Springer
This paper presents a high-quality very large scale integration (VLSI) global router in X-
architecture, called XGRouter, that heavily relies on integer linear programming (ILP) …
architecture, called XGRouter, that heavily relies on integer linear programming (ILP) …
NTHU-Route 2.0: a robust global router for modern designs
This paper presents a robust global router called NTHU-Route 2.0 that improves the solution
quality and runtime of NTHU-Route by the following enhancements: 1) a new history based …
quality and runtime of NTHU-Route by the following enhancements: 1) a new history based …
Detailed routing by sparse grid graph and minimum-area-captured path search
Different from global routing, detailed routing takes care of many detailed design rules and is
performed on a significantly larger routing grid graph. In advanced technology nodes, it …
performed on a significantly larger routing grid graph. In advanced technology nodes, it …
BonnRoute: Algorithms and data structures for fast and good VLSI routing
M Gester, D Müller, T Nieberg, C Panten… - ACM Transactions on …, 2013 - dl.acm.org
We present the core elements of BonnRoute: advanced data structures and algorithms for
fast and high-quality routing in modern technologies. Global routing is based on a …
fast and high-quality routing in modern technologies. Global routing is based on a …
Machine learning based effective linear regression model for TSV layer assignment in 3DIC
On the integration of 3D IC design, thermal management issues play a significant role. So, it
is required to implement an effective approaches and solutions for integrating 3DIC. The …
is required to implement an effective approaches and solutions for integrating 3DIC. The …
GRIP: Global routing via integer programming
TH Wu, A Davoodi, JT Linderoth - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
This paper introduces GRIP, a global routing technique via integer programming. GRIP
optimizes wirelength and via cost directly without going through a traditional layer …
optimizes wirelength and via cost directly without going through a traditional layer …