Faster minimization of linear wirelength for global placement

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Faster minimization of linear wirelength for global placement

Full text

Pdf (1.06 MB)

Source

International Symposium on Physical Design archive
Proceedings of the 1997 international symposium on Physical design table of contents

Napa Valley, California, United States

Pages: 4 - 11

Year of Publication: 1997

ISBN:0-89791-927-0

Authors

Charles J. Alpert	IBM Austin Research Laboratory, Austin, TX
Tony F. Chan	UCLA Mathematics Department, Los Angeles, CA
Dennis J.-H. Huang	UCLA Computer Science Department, Los Angeles, CA
Andrew B. Kahng	UCLA Computer Science Department, Los Angeles, CA and Cadence Design Systems, Inc., San Jose, CA
Igor L. Markov	UCLA Mathematics Department, Los Angeles, CA
Pep Mulet	UCLA Mathematics Department, Los Angeles, CA
Kenneth Yan	UCLA Computer Science Department, Los Angeles, CA

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 27, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267665.267670 What is a DOI?

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	T, F. Chan, G. H. Golub and P. Mulet, "A Nonlinear Primal-Dual Method for TV-Based Image Restoration", In Proc. of ICAOS'96, 12 th Int'l Conf. on Analysis and Optimization of Systems: Images, Wavelets and PDEs, Paris, June 26-28, 1996, M. Bergex et al (eds.), No. 219 in Lecture Notes in Control and Information Sciences, 1996, pp. 241-252.
	2	C.K. Cheng and E. S. Ktth, "Module Placement Based on Resistive Network Optimization", IEEE Transactions on Computer-Aided Design, CAD-3, 1984, pp. 218-225.
	3	A. Corm and M. Overton, "A Primal-Dual Interior Point Method for Minimizing a Sum of Euclidean Distances", Computer Science Department, New York University, Technical Report, 1995.
	4	U. Ed~ardt, "On an Optimization Problem Related to Minimal Surfaces with Obstacles", in: R. Bulirsch, W. Oetti and J. Stoer editors; "Optimization and Optimal Control", Lecture Notes in Mathematics 477 Springer Verlag, 1975, pp. 95-101.
	5	U.~ardt, "Weber's Problem and Weiszfeld's Algorithm in General Spaces", Mathematical Programming 18, 1980, pp. 186-196.
	6	W. Hackbush, Iterative Solution of Large Sparse Systems, Springer Verlag, 1994.
	7	Takeo Hamada , Chung-Kuan Cheng , Paul M. Chau, Prime: a timing-driven placement tool using a piecewise linear resistive network approach, Proceedings of the 30th international conference on Design automation, p.531-536, June 14-18, 1993, Dallas, Texas, United States [doi>10.1145/157485.165015]
	8	C. Kelley, "Iterative Methods for Linear and Nonlinear Equations", Frontiers in Applied ~{athematics, vol. 16, SIAM, 1995.
	9	J. Kleinhans, G. Sigl, F. Johannes and K. Antreich, "GOR- DIAN:VLSI Placement by Quadratic Programming and Slicing Optimization." {EEE Transactions on Computer- Aided Design. 10 (3), March 1991, pp. 356-365.
	10	Yuying Li, A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distances, Cornell University, Ithaca, NY, 1995
	11	I.I. Mahmoud, K. Asakura, T. Nishibu and T. Ohtsuki, "Ex~perimental Appraisal of Linear and Quadratic Objective Functions Effect on Force Directed Method for Analog Placement", IEICE Transactions on Fundamentals of Electronics, Communlca~ions and Computer Sciences, E77-A (4), April 1994, pp. 719-725.
	12	E. Miehle, "Link-Length Minimization in Networks", Operations Research, 6, 1958, pp. 232-243.
	13	James M. Ortega , Werner C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000
	14	Bernhard M. Riess , Konrad Doll , Frank M. Johannes, Partitioning very large circuits using analytical placement techniques, Proceedings of the 31st annual conference on Design automation, p.646-651, June 06-10, 1994, San Diego, California, United States [doi>10.1145/196244.196602]
	15	B. Riess and G. Ettelt, "SPEED: Fast and Efficient Timing Driven Placement", Proc. IEEE Int. Symp. Circuits and Systems, vol. 1, 1995, pp. 377-380.
	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	William Swartz , Carl Sechen, Timing driven placement for large standard cell circuits, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.211-215, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217531]
	18	R. S. Tsay, E. Kuh, "A Unified Approach to Partitioning and Placement", IEEE Transactions on Circuits and Systems, Vol.38, No.5, May 1991. pp. 521-633.
	19	E. Weiszfeld, "Sur le Point pour Lequel la Somme des Distances de n Points Donn~es est Minimum." TShoku Mathernatics J. 43, 1937, pp. 355-386.

CITED BY 4

	Andrew B. Kahng , Stefanus Mantik , Igor L. Markov , Miodrag Potkonjak , Paul Tucker , Huijuan Wang , Gregory Wolfe, Robust IP watermarking methodologies for physical design, Proceedings of the 35th annual conference on Design automation, p.782-787, June 15-19, 1998, San Francisco, California, United States
	Andrew A. Kennings , Igor L. Markov, Analytical minimization of half-perimeter wirelength, Proceedings of the 2000 conference on Asia South Pacific design automation, p.179-184, January 2000, Yokohama, Japan
	Philip Chong , Christian Szegedy, A morphing approach to address placement stability, Proceedings of the 2007 international symposium on Physical design, March 18-21, 2007, Austin, Texas, USA
	Henning Fernau, Parameterized algorithmics for linear arrangement problems, Discrete Applied Mathematics, v.156 n.17, p.3166-3177, October, 2008