Function smoothing with applications to VLSI layout

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 1999-January, Issue , 1999, Pages 225-228

  Baldick, Ross ^a   Kahng, Andrew B ^b   Kennings, Andrew ^c   Markov, Igor L ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c RYERSON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; INTEGRATED CIRCUIT LAYOUT; NUMERICAL METHODS;

CONTINUOUS FUNCTIONS; DELAY ESTIMATION; DIFFERENTIABLE FUNCTIONS; LIMIT BEHAVIOR; PARAMETERIZED; SOLUTION QUALITY; VLSI LAYOUT; WIRE LENGTH;

VLSI CIRCUITS;

EID: 0009790428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.1999.760001     Document Type: Conference Paper

References (18)

1. C. J. Alpert, T. F. Chan, D. J. H. Huang, A. B. Kahng, I. L. Markov, P. Mulet and K. Yan, "Faster Minimization of Linear Wire Length for Global Placement", Proc. ACM/IEEE Intl. Symp. on Physical Design, 1997, pp. 4-11.
2. U. Eckhardt, "On an Optimization Problem Related to Minimal Surfaces with Obstacles", in R. Bulirsch, W. Oetti and J. Stoer, eds., Optimization and Optimal Control, Lecture Notes in Mathematics 477, Springer Verlag, 1975, pp. 95-
3. U.Eckhardt, "Weber's Problem and Weiszfeld's Algorithm in General Spaces", Mathematical Programming 18 (1980), pp. 186-196.
4. W. C. Elmore, "The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers", J. Applied Physics, 19 (1948), pp. 55-63.
5. J.W. Eyster, J.A. White and W.W. Wierwille, "On Solving Multifacility Location Problems Using a Hyperboloid Approximation Procedure", Trans. American Institute of Industrial Engineering 5 (1973), pp. 1-6.
6. P.E. Gill, W. Murray and M.H. Wright, Practical Optimization, 1981, Academic Press, London.
7. M. A. B. Jackson and E. S. Kuh, "Performance-Driven Placement of Cell Based IC's", Proc. ACM/IEEE Design Automation Conf., 1989, pp. 370-375.
8. T. Hamada, C. K. Cheng and P. M. Chau, "Prime: A Timing-Driven Placement Tool Using a Piecewise Linear Resistive Network Approach", Proc. ACM/IEEE Design Automation Conf., 1991, pp. 531-536.
9. M. Held, P. Wolfe and H. P. Crowder, "Validation of Sub-gradient Optimization", Mathematical Programming, 1974, pp. 62-88
10. C. Kelley, Iterative Methods for Linear and Nonlinear Equations, Frontiers in Applied Mathematics vol. 16, SIAM Press, 1995.
11. p Distances Using Convex Programming", Operations Research 23 (1975), pp. 581-587.
12. 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. on Fundamentals of Electronics, Communications and Computer Sciences 4(E77-A) (1994), pp. 710-725.
13. B. M. Riess and G. G. Ettelt, "Speed: Fast and Efficient Timing Driven Placement", Proc. IEEE Intl. Symp. on Circuits and Systems, 1995, pp. 377-380.
14. G. Sigl, K. Doll and F. M. Johannes, "Analytical Placement: A Linear or Quadratic Objective Function?" Proc. ACM/IEEE Design Automation Conf., 1991, pp. 57-62.
15. A. Srinivasan, K. Chaudhary and E. S. Kuh, "RITUAL: A Performance Driven Placement for Small-Cell ICs", Proc. Intl. Conf. on Computer-Aided Design, 1991, pp. 48-51.
16. R. S. Tsay and J. Koehl, "An Analytical Net Weighting Approach for Performance Optimization in Circuit Placement", Proc. ACM/IEEE Design Automation Conf, 1991, pp. 620-625.
17. E. Weiszfeld, "Sur le Point pour Lequel la Somme des Distances de n Points Donnees est Minimum." Tohoku Mathematics J. 43 (1937), pp. 355-386.
18. S.J. Wright, Primal-Dual Interior-Point Methods, Philadelphia, SIAM Press, 1996.