Algorithms for detailed placement of standard cells
Proceedings of the conference on Design, automation and test in Europe
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
On structure and suboptimality in placement
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Optimal placement by branch-and-price
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
An efficient and effective detailed placement algorithm
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Guiding global placement with wire density
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
A parallel branch-and-cut approach for detailed placement
ACM Transactions on Design Automation of Electronic Systems (TODAES)
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
Mixed integer programming models for detailed placement
Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design
The DAC 2012 routability-driven placement contest and benchmark suite
Proceedings of the 49th Annual Design Automation Conference
Routability-driven white space allocation for fixed-die standard-cell placement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Routability-Driven Placement and White Space Allocation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ICCAD-2012 CAD contest in design hierarchy aware routability-driven placement and benchmark suite
Proceedings of the International Conference on Computer-Aided Design
Case study for placement solutions in ispd11 and dac12 routability-driven placement contests
Proceedings of the 2013 ACM international symposium on International symposium on physical design
Optimization of placement solutions for routability
Proceedings of the 50th Annual Design Automation Conference
Hi-index | 0.00 |
By modifying an existing Mixed Integer Programming (MIP) model for optimizing the placement of cells in sliding windows, we develop a detailed placer for large-scale mixed-size circuits. To make it possible to optimize the placement of larger sliding windows in reasonable time, we reduce the number of integer variables in the modified MIP model such that when compared with the original complete MIP model, the solution time is shortened greatly while the solution quality does not degrade much. Experimental results on DAC12 benchmark circuits show that our detailed placer manages to further reduce half-perimeter wirelength (HPWL) of the placement results generated by many other existing detailed placement techniques. Moreover, by making use of a commercial router, we also evaluate the routability of the placement results before and after the application of our detailed placer. Both the routed wirelength and the number of vias in routing solutions are reduced, while the number of design rule violations does not change much for most circuits, implying the routablity of placement results are not perturbed.