Faster minimization of linear wirelength for global placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 17, Issue 1, 1998, Pages 3-13

  Alpert, Charles J ^a   Chan, Tony F ^a   Kahng, Andrew B ^a   Markov, Igor L ^a   Mulet, Pep ^a  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Analytic placement, gordian l, interconnect delay, linear placement, linear wirelength, newton, primal dual, quadratic placement, weiszfeld

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER AIDED NETWORK ANALYSIS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; OPTIMIZATION;

LINEAR WIRELENGTH; PRIMAL DUAL NEWTON ITERATIONS; PRIMAL NEWTON ITERATIONS; WEISZFELD ALGORITHM;

INTEGRATED CIRCUIT LAYOUT;

EID: 0031652243     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.673628     Document Type: Article

References (23)

1. PETSc 2.0 User's Manual, Argonne National Laboratory, S. Balay, W. Gropp, L. C. McInnes, and B. Smith, 1995 [Online]. Available WWW: http://www.mcs.anl.gov/petsc/petsc.html.
2. T. F. Chan, G. H. Golub, and P. Mulet, "A nonlinear primal-dual method for TV-based image restoration," in Proc. ICAOS'96, 12th Int. Conf. Analysis Optimization Syst.: Images, Wavelets, PDE's, (Lecture Notes in Control and Information Sciences), M. Berger et al. Eds., Paris, France, June 26-28, 1996, no. 219, pp. 241-252.
3. C. K. Cheng and E. S. Kuh, "Module placement based on resistive network optimization," IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 218-225, 1984.
4. A. Conn and M. Overton, "A primal-dual interior point method for minimizing a sum of euclidean distances," Computer Science Department, New York University, Tech. Rep., 1995.
5. U. Eckhardt, "On an optimization problem related to minimal surfaces with obstacles," in Optimization and Optimal Control, (Lecture Notes in Mathematics), R. Bulirsch, W. Oetti, and J. Stoer, Eds. New York: Springer-Verlag, 1975, pp. 95-101.
6. _, "Weber's problem and Weiszfeld's algorithm in general spaces," Math. Programming, vol. 18, pp. 186-196, 1980.
7. W. C. Elmore, "The transient response of damped linear network with particular regard to wideband amplifiers," J. Appl. Physics, vol. 19, pp. 55-63, 1948.
8. K. Fukunaga, S. Yamada, H. S. Stone, and T. Kasai, "Placement of circuit modules using a graph space approach," in Proc. 20th ACM/IEEE Design Autom. Conf., 1983, pp. 465-471.
9. W. Hackbush, Iterative Solution of Large Sparse Systems. New York: Springer-Verlag, 1994.
10. L. Hagen and A. B. Kahng, "Improving the quadratic objective function in module placement," in Proc. IEEE Int. ASIC Conf. Exhibit, Rochester, NY, Sept. 1992, pp. 21-25.
11. T. Hamada, C.-K. Cheng, and P. M. Chau, "Prime: A timing-driven placement tool using a piecewise linear resistive network approach," in Proc. 30th ACM/IEEE Design Autom. Conf., 1993, pp. 531-536.
12. C. Kelley, "Iterative methods for linear and nonlinear equations," in Frontiers in Applied Mathematics, vol. 16. Philadelphia, PA: SIAM Press, 1995.
13. J. Kleinhans, G. Sigl, F. Johannes, and K. Antreich, "GORDIAN: VLSI placement by quadratic programming and slicing optimization," IEEE Trans. Computer-Aided Design, vol. 10, pp. 356-365, Mar. 1991.
14. J. Li, J. Lillis, L.-T. Liu, and C.-K. Cheng, "New spectral linear placement and clustering approach," in Proc. 33rd ACM/IEEE Design Autom. Conf., 1996, pp. 88-93.
15. Y. Li, A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances," Cornell University, Tech. Rep., 1996.
16. 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," IEICE Trans. Fundamentals of Electron., Commun. Comput. Sci., vol. E77-A, no. 4, pp. 719-725, Apr. 1994.
17. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic, 1970.
18. B. M. Riess, K. Doll, and F. M. Johannes, "Partitioning very large circuits using analytical placement techniques," in Proc. 31st ACM/IEEE Design Autom. Conf., 1994, pp. 646-651.
19. G. Sigl, K. Doll, and F. Johannes, "Analytical placement: A linear or a quadratic objective function?," in Proc. 28th ACM/IEEE Design Autom. Conf., 1991, pp. 427-432.
20. W. Swartz and C. Sechen, "Timing driven placement for large standard cell circuits," in Proc. 32nd ACM/IEEE Design Autom. Conf., 1995, pp. 211-215.
21. R. S. Tsay and E. Kuh, "A unified approach to partitioning and placement," IEEE Trans. Circuits Syst., vol. 38, pp. 521-633, May 1991.
22. E. Weiszfeld, "Sur le Point pour Lequel la Somme des Distances de n Points Données est Minimum," J. Tôhoku Math. vol. 43, pp. 355-386, 1937.
23. G. J. Wipfler, M. Wiesel, and D. A. Mlynski, "A combined force and cut algorithm for hierarchical VLSI layout," in Proc. 20th ACM/IEEE Design Autom. Conf., 1983, pp. 124-125.