|
ABSTRACT
In this paper, we present FastPlace -- a fast, iterative, flat placement algorithm for large-scale standard cell designs. FastPlace is based on the quadratic placement approach. The quadratic approach formulates the wirelength minimization problem as a convex quadratic program, which can be solved efficiently by some analytical techniques. However it suffers from some drawbacks. First, the resulting placement has a lot of overlap among cells. Second, the resulting total wirelength may be long as the quadratic wirelength objective is only an indirect measure of the linear wirelength. Third, existing net models tend to create a lot of non-zero entries in the connectivity matrix, which slows down the quadratic program solver. To handle the above problems we propose: (1) An efficient Cell Shifting technique to remove cell overlap from the quadratic program solution and produce a global placement with even cell distribution. (2) An Iterative Local Refinement technique, to reduce the wirelength according to the half-perimeter measure. (3) A Hybrid Net Model which is a combination of the traditional clique and star models. This net model greatly reduces the number of non-zero entries in the connectivity matrix and results in a significant speedup of the solver. Experimental results show that FastPlace is on average 13.0 and 97.4 times faster than Capo and Dragon respectively. Correspondingly, the average wirelength is just 1.0% and 1.6% higher.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
R. Barrett, M. Berry, and et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods SIAM, 1994.
|
 |
3
|
Andrew E. Caldwell , Andrew B. Kahng , Igor L. Markov, Can recursive bisection alone produce routable placements?, Proceedings of the 37th conference on Design automation, p.477-482, June 05-09, 2000, Los Angeles, California, United States
[doi> 10.1145/337292.337549]
|
| |
4
|
|
 |
5
|
Hongyu Chen , Chung-Kuan Cheng , Nan-Chi Chou , Andrew B. Kahng , John F. MacDonald , Peter Suaris , Bo Yao , Zhengyong Zhu, An algebraic multigrid solver for analytical placement with layout based clustering, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA
[doi> 10.1145/775832.776034]
|
 |
6
|
|
| |
7
|
Hussein Etawil , Shawki Areibi , Anthony Vannelli, Attractor-repeller approach for global placement, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.20-24, November 07-11, 1999, San Jose, California, United States
|
| |
8
|
|
| |
9
|
K. M. Hall. An r-dimensional quadratic placement algorithm.Management Science 17:219--229, 1970.
|
 |
10
|
|
 |
11
|
|
| |
12
|
D. S. Kershaw. The incomplete cholesky-conjugate gradient method for the iterative solution of systems of linear equations. Journal of Computational Physics 26:43--65, 1978.
|
| |
13
|
J. Kleinhans, G. Sigl, F. Johannes, and K. Antreich. Gordian: VLSI placement byquadratic programming and slicing optimization. IEEE Trans. Computer-Aided Design 10(3):356--365, 1991.
|
| |
14
|
|
| |
15
|
|
 |
16
|
Georg Sigl , Konrad Doll , Frank M. Johannes, Analytical placement: A linear or a quadratic objective function?, Proceedings of the 28th conference on ACM/IEEE design automation, p.427-432, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127707]
|
 |
17
|
|
 |
18
|
|
| |
19
|
|
 |
20
|
|
CITED BY 42
|
|
|
|
|
|
|
|
Bo Yao , Hongyu Chen , Chung-Kuan Cheng , Nan-Chi Chou , Lung-Tien Liu , Peter Suaris, Unified quadratic programming approach for mixed mode placement, Proceedings of the 2005 international symposium on Physical design, April 03-06, 2005, San Francisco, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Gi-Joon Nam , Charles J. Alpert , Paul Villarrubia , Bruce Winter , Mehmet Yildiz, The ISPD2005 placement contest and benchmark suite, Proceedings of the 2005 international symposium on Physical design, April 03-06, 2005, San Francisco, California, USA
|
|
|
Yongqiang Lu , C. N. Sze , Xianlong Hong , Qiang Zhou , Yici Cai , Liang Huang , Jiang Hu, Navigating registers in placement for clock network minimization, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Aaron N. Ng , Igor L. Markov , Rajat Aggarwal , Venky Ramachandran, Solving hard instances of floorplacement, Proceedings of the 2006 international symposium on Physical design, April 09-12, 2006, San Jose, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. B. Kahng , S. Reda , Qinke Wang, Architecture and details of a high quality, large-scale analytical placer, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.891-898, November 06-10, 2005, San Jose, CA
|
|
|
|
|
|
T. Luo , H. Ren , C. J. Alpert , D. Z. Pan, Computational geometry based placement migration, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.41-47, November 06-10, 2005, San Jose, CA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tung-Chieh Chen , Ping-Hung Yuh , Yao-Wen Chang , Fwu-Juh Huang , Denny Liu, MP-trees: a packing-based macro placement algorithm for mixed-size designs, Proceedings of the 44th annual conference on Design automation, June 04-08, 2007, San Diego, California
|
|
|
|
|
|
|
|
|
|
|