Andrew A. Kennings
Igor L. Markov
- 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. ISPD '97, pp. 4-11. Google Scholar
Digital Library
- 2.C. J. Alpert, A. E. Caldwell, T. Chan, D. J.-H. Huang, A. B. Kahng, I. L. Markov and M. Moroz, "Analytical Engines Are Unnecessary in Top-down Partitioning-Based Placement" VLSI Design (1999), to appear.Google Scholar
- 3.R. Baldick, A. Kahng, A. Kennings and I. Markov, "Function Smoothing with Applications to VLSI Layout", Proc. ASP-DAC '99, pp. 225-228.Google Scholar
- 4.H. Eisenmann, F. M. Johannes, "Generic Global Placement and Floorplanning". Proc. DAC '98, pp. 269-274. Google ScholarDigital Library
- 5.R. Fletcher and M.J.D. Powell, "A Rapidly Convergent Descent Method for Minimization", Computer J. 6, 1963, pp. 163-168.Google ScholarCross Ref
- 6.S.W. Hur and J. Lillis, "Relaxation and Clustering in a Local Search Framework: Application to Linear Placement", Proc. DAC '99, pp. 360-366. Google ScholarDigital Library
- 7.M. A. B. Jackson and E. S. Kuh, "Performance-Driven Placement of Cell Based IC's", Proc. DAC '89, pp. 370-375. Google ScholarDigital Library
- 8.M. Hanan, P. K.Wolff, and B. J. Agule, "A Study of Placement Techniques." J. Design Automation and Fault-Tolerant Computing, vol. 2, 1978, pp. 28-61.Google Scholar
- 9.T. Koide at al, "Par-POPINS: a Timing-driven Parallel Placement Method With the Elmore Delay Model For Row Based VLSIs", Proc. ASP-DAC '97, 1997. pp. 133-40.Google Scholar
- 10.T. Lengauer , Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, 1990. Google ScholarDigital Library
- 11.D. C. Liu and J. Nocedal, "On the Limited Memory BFGS Method For Large Scale Optimization", Mathematical Programming 45 (1989), pp. 503-528. Google ScholarDigital Library
- 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.Google Scholar
- 13.J. Nocedal, "Large Scale Unconstrained Optimization", The State of the Art in Numerical Analysis, Ed. A Watson and I. Duff, Oxford University Press, 1996.Google Scholar
- 14.J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970. Google ScholarDigital Library
- 15.B. M. Riess and G. G. Ettelt, "Speed: Fast and Efficient Timing Driven Placement", Proc. ISCAS '95, pp. 377-380.Google Scholar
- 16.M. Sarrafzadeh, D. Knol and G. Tellez, "Unification of Budgeting and Placement", In Proc. DAC '97, pp. 758-761. Google ScholarDigital Library
- 17.G. Sigl, K. Doll and F. M. Johannes, "Analytical Placement: A Linear or Quadratic Objective Function?" Proc. DAC '91, pp. 57-62. Google ScholarDigital Library
- 18.A. Srinivasan, K. Chaudhary and E. S. Kuh, "RITUAL: A Performance Driven Placement for Small-Cell ICs", Proc. ICCAD '91, pp. 48-51.Google Scholar
- 19.Takahashi, K.; Nakajima, K.; Terai, M.; Sato, K., "Min-cut Placement With Global Objective Functions For Large Scale Sea-of-gates Arrays.", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 4, April 1995, pp. 434-446. Google ScholarDigital Library
- 20.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.Google ScholarCross Ref
- 21.R. S. Tsay, E. Kuh, and C. P. Hsu, "Proud: A Sea-Of-Gate Placement Algorithm", IEEE Design & Test of Computers, 1988, pp. 44-56. Google ScholarDigital Library
- 22.Y.-W. Tsay, H.-P. Su, Y.-L. Lin, "An Improved Objective For Cell Placement", Proc. ASP-DAC '97, Japan, 1997, pp. 281- 284.Google Scholar
- 23.J. Vygen, "Algorithms For Large-scale Flat Placement", Proc. DAC '97, pp. 746-51. Google ScholarDigital Library
- 24.J. Vygen, Personal Communication, November, 1999.Google Scholar
- 25.B. X. Weis and D. A. Mlynski, "A New Relative Placement Procedure Based on MSST and Linear Programming. Proc. ISCAS '87, pp. 564-567.Google Scholar
- Analytical minimization of half-perimeter wirelength
Recommendations
Half-Perimeter Wirelength Model for VLSI Analytical Placement
ICIT '14: Proceedings of the 2014 International Conference on Information TechnologyPlacement is a crucial stage in physical design of VLSI. At this stage, analytical placer uses half perimeter wire length (HPWL) of the circuit as an objective function to place blocks optimally within chip. Inspired by popularly used log-sum-exp (LSE) ...
Recursive Function Smoothing of Half-Perimeter Wirelength for Analytical Placement
ISQED '07: Proceedings of the 8th International Symposium on Quality Electronic DesignInspired by recent success of analytical placers that use a logarithmsum- exponential (LSE) to smooth half-perimeter wirelength (HPWL), we consider in this paper two alternative smoothing methods for HPWL by recursive extension of two-variable max ...
Blockage-aware terminal propagation for placement wirelength minimization
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided DesignWirelength is the most fundamental objective in placement because it also affects various placement metrics (routability, timing, etc.). Half-perimeter wirelength (HPWL) is a pervasive metric for circuit placement. However, preplaced blocks (i.e., ...
Comments