A SimPLR method for routability-driven placement
Authors:
- 1 November 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10923152,p. 67-73
Abstract
Highly-optimized placements may lead to irreparable routing congestion due to inadequate models of modern interconnect stacks and the impact of partial routing obstacles. Additional challenges in routability-driven placement include scalability to large netlists and limiting the complexity of software integration. Addressing these challenges, we develop lookahead routing to give the placer advance, firsthand knowledge of trouble spots, not distorted by crude congestion models. We also extend global placement to (i) spread cells apart in congested areas, and (ii) move cells together in less-congested areas to ensure short, routable interconnects and moderate runtime. While previous work adds isolated steps to global placement, our SIMultaneous PLace-and-Route tool SimPLR integrates a layer- and via-aware global router into a leading-edge, force-directed placer. The complexity of integration is mitigated by careful design of simple yet effective optimizations. On the ISPD 2011 Contest Benchmark Suite, with the official evaluation protocol, SimPLR outperforms every contestant on every benchmark.Keywords
This publication has 33 references indexed in Scilit:
- VLSI Physical Design: From Graph Partitioning to Timing Closure2011
- SimPL: An effective placement algorithm2010
- Completing high-quality global routes2010
- Routability-driven analytical placement by net overlapping removal for large-scale mixed-size designs2008
- RBI: Simultaneous Placement and Routing Optimization TechniqueIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
- Is probabilistic congestion estimation worthwhile?2005
- Probabilistic congestion prediction2004
- Accurate pseudo-constructive wirelength and congestion estimation2003
- Multi-center congestion estimation and minimization during placement2000
- Modeling and minimization of routing congestion2000