Chung-Ping Chen
- 1.Leon S. Lasdon, Optimization Theory for Large Systems, Macmillan Publishing Co., INC. 1970.Google Scholar
- 2.H. Bakoglu, Circuits, Interconnections, and Packaging for VLSI, Addison-Wesley Pub. Company Inc., 1990.Google Scholar
- 3.Chung-Ping Chen, D. F. Wong. "A fast algorithm for optimal wiresizing under Elmore delay model" Proc IEEE ISCAS, 1996.Google Scholar
- 4.J. Chung and C.-K. Cheng, "Skew sensitivity minimization of buffered clock tree," Proc. ICCAD, pp. 280-283, 1994. Google ScholarDigital Library
- 5.J. Cong and K.-S. Leung, "Optimal wiresizing under elmore delay model," IEEE TCAD 14(3), pp. 321-336, 1995. Google ScholarDigital Library
- 6.R. J. DuiTin, E. L. Peterson, and C. Zener, Geometric Programming--Theory and Application, John Wiley ~ Sons, Inc, 1967.Google Scholar
- 7.D. Dobberpuhl and R. Witek, "A 200MHz 64B dual-issue CMOS microprocessor," Proc. IEEE ISSCC, pp. 106-107, 1992.Google Scholar
- 8.W. C. Elmore, "The transient response of damped linear networks with particular regard to wide band amplifiers," J. Applied Physics, 19 (1), 1948.Google ScholarCross Ref
- 9.M. L. Fisher, "An applications oriented guide to Lagrangian relaxation," Interfaces, 15:2, pp. 10-21, March-April 1985.Google ScholarDigital Library
- 10.M.A.B. Jackson, et al., "Clock routing for high performance ICs," Proc. DAC, pp. 573-579, June 1990. Google ScholarDigital Library
- 11.D. G. Luenberger, Linear and Nonlinear Programming, Addison- Wesley Pub. Company Inc., 1984.Google Scholar
- 12.N. Menezes, R. Baldick, and L. T. Pillage, "A sequential quadratic programming approach to concurrent gate and wire-sizing," Proc. ICCAD, 1995. Google ScholarDigital Library
- 13.N. Menezes, S. Pullela, F. Dartu, and L. T. Pillage, "RC interconnect syntheses--a moment fitting approach," Proc. ICCAD, Nov. 1994. Google ScholarDigital Library
- 14.S. Pullela, N. Menezes, and L. T. Pillage, "Reliable non-zero skew clock trees using wire width optimization," Proc. 30th ACM/IEEE Design Automation Conference, pp. 165-170, June 1993. Google ScholarDigital Library
- 15.S. S. Sapatnekar, "RC interconnect optimization under the Elmore delay model," Proc. ICCAD, pp. 387-391, 1994. Google ScholarDigital Library
- 16.R.-S. Tasy, "Exact zero skew," IEEE TCAD, 1993.Google Scholar
- 17.Q. Zhu, W. W.-M. Dai, and J. G. Xi, "Optimal sizing of high-speed clock networks based on distributed RC and lossy transmission line models," Proc. ICCAD, pp. 628-633, 1993. Google ScholarDigital Library
Index Terms
- Fast performance-driven optimization for buffered clock trees based on Lagrangian relaxation
Recommendations
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
Optimization problems whose objective function and constraints are quadratic polynomials are called quadratically constrained quadratic programs (QCQPs). QCQPs are NP-hard in general and are important in optimization theory and practice. There have been ...
Buffered Interconnect Tree Optimization using Lagrangian Relaxation and Dynamic Programming
ICCD '01: Proceedings of the International Conference on Computer Design: VLSI in Computers & ProcessorsAbstract: This paper presents a new synthesis method, based on combining Bottom-up Dynamic Programming and Lagrangian Relaxation, for finding effective solutions to a delay-constrained buffered interconnect tree. By introducing redundant length ...
Fast Timing-Model Independent Buffered Clock-Tree Synthesis
In high-performance synchronous chip design, a buffered clock tree with small clock skew is essential for improving clocking speed. Due to the insufficient accuracy of timing models for modern chip design, embedding simulation into a clock-tree ...
Comments