Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
NTHU-Route 2.0: a fast and stable global router
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
High-performance global routing with fast overflow reduction
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
GRIP: scalable 3D global routing using integer programming
Proceedings of the 46th Annual Design Automation Conference
Completing high-quality global routes
Proceedings of the 19th international symposium on Physical design
Wire synthesizable global routing for timing closure
Proceedings of the 16th Asia and South Pacific Design Automation Conference
The ISPD-2011 routability-driven placement contest and benchmark suite
Proceedings of the 2011 international symposium on Physical design
A SimPLR method for routability-driven placement
Proceedings of the International Conference on Computer-Aided Design
Ripple: an effective routability-driven placer by iterative cell movement
Proceedings of the International Conference on Computer-Aided Design
Routability-driven analytical placement for mixed-size circuit designs
Proceedings of the International Conference on Computer-Aided Design
MGR: multi-level global router
Proceedings of the International Conference on Computer-Aided Design
Congestion analysis for global routing via integer programming
Proceedings of the International Conference on Computer-Aided Design
GLADE: a modern global router considering layer directives
Proceedings of the International Conference on Computer-Aided Design
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing
Proceedings of the International Conference on Computer-Aided Design
Routing congestion estimation with real design constraints
Proceedings of the 50th Annual Design Automation Conference
Taming the complexity of coordinated place and route
Proceedings of the 50th Annual Design Automation Conference
Ripple 2.0: high quality routability-driven placement via global router integration
Proceedings of the 50th Annual Design Automation Conference
Optimization of placement solutions for routability
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
To avoid producing unroutable placement solutions, many state-of-the-art routability-driven placers iteratively invoke global routers to evaluate their placement solutions and then perform routability optimization. However, using a global router to evaluate hard-to-route placement solutions may spend considerable runtime and it cannot guarantee that a placement is truly unroutable to any router. This paper presents an unroutable placement recognizer based on a window-based layout scanning algorithm, which can confirm some placements that are exactly unroutable among a set of hard-to-route placements. In addition, if a placement is recognized to be unroutable, the recognizer can point out unroutable regions and report a lower bound of total overflow for the placement. The experimental results reveal that the proposed recognizer can find out 16 placements that are definitely unroutable among 23 widely used hard-to-route global routing benchmarks.