ACM Home Page
Please provide us with feedback. Feedback
Multilevel generalized force-directed method for circuit placement
Full text PdfPdf (773 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2005 international symposium on Physical design table of contents
San Francisco, California, USA
SESSION: Placement table of contents
Pages: 185 - 192  
Year of Publication: 2005
ISBN:1-59593-021-3
Authors
Tony Chan  UCLA
Jason Cong  UCLA
Kenton Sze  UCLA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1055137.1055177
What is a DOI?

ABSTRACT

Automatic circuit placement has received renewed interest recently given the rapid increase of circuit complexity, increase of interconnect delay, and potential sub-optimality of existing placement algorithms [13]. In this paper we present a generalized force-directed algorithm embedded in mPL2's [12] multilevel framework. Our new algorithm, named mPL5, produces the shortest wirelength among all published placers with very competitive runtime on the IBM circuits used in [29]. The new contributions and enhancements are: (1) We develop a new analytical placement algorithm using a density constrained minimization formulation which can be viewed as a generalization of the force-directed method in [16]; (2) We analyze and identify the advantages of our new algorithm over the force-directed method; (3) We successfully incorporate the generalized force-directed algorithm into a multilevel framework which significantly improves wirelength and speed. Compared to Capo9.0, our algorithm mPL5 produces 8% shorter wirelength and is 2X faster. Compared to Dragon3.01, mPL5 has 3% shorter wirelength and is 12X faster. Compared to Fengshui5.0, it has 5% shorter wirelength and is 2X faster. Compared to the ultra-fast placement algorithm: FastPlace, mPL5 produces 8% shorter wirelength but is 6X slower. A fast mode of mPL5 (mPL5-fast) can produce 1% shorter wirelength than Fast-Place1.0 and is only 2X slower. Moreover, mPL5-fast has demonstrated better scalability than FastPlace1.0.


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
 
3
C. R. Anderson and C. Elion. Accelerated Solutions of Nonlinear Equations Using Stabilized Runge-Kutta Methods, UCLA CAM report, April 2004.
 
4
K. Arrow, L. Huriwicz and H. Uzawa. Studies in Nonlinear Programming. Stanford University Press, Stanford, CA, 1958.
 
5
A. Brandt. Multiscale Scientific Computation: Review 2001. In T. Barth, R. Haimes, and T. Chan, editors, Multiscale and Multiresolution Methods. Springer Verlag, 2001.
 
6
A. Brandt and D. Ron. Multigrid Solvers and Multilevel Optimization Strategies, chapter 1 of Multilevel Optimization and VLSICAD, Kluwer Academic Publishers, Boston, 2002.
7
 
8
R. Chan, T. Chan, M. K. Ng, and A. Yip. Cosine Transform Preconditioner for High Resolution Image Reconstruction. Linear Algebra Appls, 316 (2000), pp. 89--104.
 
9
T. Chan, J. Cong, T. Kong, and J. Shinnerl. Multilevel Circuit Placement, chapter 4 of Multilevel Optimization and VLSICAD, Kluwer Academic Publishers, Boston, 2002.
 
10
L. C. Evans. Partial Differential Equations, American Mathematical Society, 2002.
 
11
 
12
13
14
 
15
J. Cong. An Interconnect-Centric Design Flow for Nanometer Technologies. In Proc. of the IEEE, vol. 89, No. 4, pp. 505--528, April 2001.
16
 
17
18
19
20
 
21
J. Kleinhans, G. Sigl, F. Johannes, and K. Antreich. Gordian: VLSI Placement by Quadratic Programming and Slicing Optimization. IEEE Trans. on Computer-Aided Design, vol. 10, pp. 356--365, March 1991.
22
 
23
C. Li and C.-K. Koh. On Improving Recursive Bipartitioning-based Placement. Technical Report TR-ECE-03-14, Purdue University ECE, 2003.
 
24
I. I. Mahmoud, K. Asakura, T. Nishibu and T. Ohtsuki. Experimental Appraisal of Linear and Quadratic Objective Functions Effect on Force Directed Method for Analog Placement. In IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences 4(E77-A), pp. 710--725, 1994.
 
25
 
26
W. Naylor et al. Non-linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer. US Patent 6301693, Oct. 2001.
 
27
Takuya Ooura. A FFT Package, http://momonga.t.u-tokyo.ac.jp/~ooura/fft.html.
 
28
29
 
30
31
32
33

CITED BY  30

Collaborative Colleagues:
Tony Chan: colleagues
Jason Cong: colleagues
Kenton Sze: colleagues