A fast algorithm for optimal buffer insertion

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 24, Issue 6, 2005, Pages 879-891

  Shi, Weiping ^a   Li, Zhuo ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Buffer insertion; Data structure; Elmore delay; Interconnect; Routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; INTERCONNECTION NETWORKS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

BUFFER INSERTION; ELMORE DELAY; INTERCONNECTS; ROUTING;

BUFFER CIRCUITS;

EID: 20444462290     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.847942     Document Type: Article

References (15)

1. C. J. Alpert and A. Devgan, "Wire segmenting for improved buffer insertion," in Proc. ACM/IEEE Design Automation Conf., 1997, pp. 588-593.
2. C. J. Alpert, C. Chu, G. Gandham, M. Hrkic, J. Hu, C. Kashyap, and S. Quay, "Simultaneous driver sizing and buffer insertion using a delay penalty estimation technique," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 23, no. 1, pp. 136-141, Jan. 2004.
3. M. R. Brown and R. E. Tarjan, "A fast merging algorithm," J. ACM, vol. 26, no. 2, pp. 211-226, 1979.
4. C. C. N. Chu and D. F. Wong, "A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 18, no. 6, pp. 787-798, Jun. 1999.
5. T. Corman, C. E. Leiserson, and R. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
6. S. Dhar and M. A. Franklin, "Optimum buffer circuits for driving long uniform lines," IEEE J. Solid-State Circuits, vol. 26, no. 1, pp. 32-40, Jan. 1991.
7. M. Kang, W. W.-M. Dai, T. Dillinger, and D. LaPotin, "Delay bounded buffered tree construction for timing driven floorplanning," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1997, pp. 707-712.
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 J. Solid-State Circuits, vol. 31, no. 3, pp. 437-447, Mar. 1996.
9. T. Okamoto and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1996, pp. 44-49.
10. R. H. J. M. Otten, "Efficient floorplan optimization," in Proc. IEEE Int. Conf. Comput. Design, 1983, pp. 499-502.
11. W. Shi, "A fast algorithm for area minimization of slicing floorplans," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 15, no. 12, pp. 1525-1532, Dec. 1996.
12. W. Shi, Z. Li, and C. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," in Proc. Conf. Asia South Pacific Design Automation, 2004, pp. 609-614.
13. L. Stockmeyer, "Optimal orientations of cells in slicing floorplan designs," Inform. Control, vol. 57, pp. 91-101, 1983.
14. L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," in Proc. IEEE Int. Symp. Circuits Syst., 1990, pp. 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 Integr. Circuits Syst., vol. 19, no. 7, pp. 819-824, Jul. 2000.