Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

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

Volumn , Issue , 2004, Pages 609-614

  Shi, Weiping ^a   Li, Zhuo ^a   Alpert, Charles J ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER COST MINIMIZATION PROBLEMS; OPTIMAL BUFFER INSERTION; WIRE SIZING;

ALGORITHMS; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; POLYNOMIALS; THEOREM PROVING; TOPOLOGY;

COMPUTATIONAL COMPLEXITY;

EID: 2442496236     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. C. J. Alpert and A. Devgan, "Wire segmenting for improved buffer insertion," Proc. 1997 DAC, 588-593.
2. C. J. Alpert, A. Devgan, and S. T. Quay, "Buffer insertion for noise and delay optimization," Proc. 1998 DAC, 362-367.
3. C. J. Alpert, A. Devgan, and S. T. Quay, "Buffer insertion with accurate gate and interconnect delay computation," Proc. 1999 DAC, 479-484.
4. C.-P. Chen and N. Menezes, "Noise-aware repeater insertion and wire sizing for on-chip interconnect using hierarchical moment matching," Proc. 1999 DAC, 502-506.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.
6. M. Hrkic and J. Lillis, "S-tree: a technique for buffered routing tree synthesis," Proc. 2002 DAC, 578-583.
7. J. Hu, C. J. Alpert, S. T. Quay, G. Gandham, "Buffer insertion with adaptive blockage avoidance," IEEE Trans. Computer-Aided Design, 22(4), 2003, 492-498.
8. J. Lillis, C. K. Cheng and T.-T. Y. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," IEEE Trans. Solid-State Circuits, 31(3), 1996, 437-447.
9. J. Lillis, C. K. Cheng and T.-T. Y. Lin, "Simultaneous routing and buffer insertion for high performance interconnect," Proc. 1996 Great Lakes Symposium on VLSI, 148-153.
10. T. Okamoto and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," Proc. 1996 ICCAD, 44-49.
11. P. Saxena, N. Menezes, P. Cocchini, and D. A. Kirkpatrick, "The scaling challenge: Can correct-by-construction design help?" Proc. 2003 ISPD, 51-58.
12. W. Shi and Z. Li, "An O(n log n) time algorithm for optimal buffer insertion," Proc. 2003 DAC, 580-585.
13. S. P. Stanley, Enumerative Combinatorics, Cambridge University Press, Cambridge, 1999.
14. L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," Proc. 1990 ISCAS, 865-868.
15. H. Zhou, D. F. Wong, I. M. Liu and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations," IEEE Trans. Computer-Aided Design, 19(7), 2000, 819-824.