An O(nlogn) time algorithm for optimal buffer insertion

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 580-585

  Shi, Weiping ^a   Li, Zhuo ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Buffer insertion; Data structure; Elmore delay; Routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ROUTERS;

OPTIMAL BUFFER INSERTION;

COMPUTER AIDED ENGINEERING;

EID: 0041633712     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775832.775980     Document Type: Conference Paper

References (9)

1. C. J. Alpert and A. Devgan, "Wire segmenting for improved buffer insertion," DAC 1997, 588-593.
2. T. Corman, C. E. Leiserson and R. Rivest, Introduction to Algorithms, McGraw Hill, 1990.
3. M. Kang, W. W.-M. Dai, T. Dillinger and D. LaPotin, "Delay bounded buffered tree construction for timing driven floorplanning," ICCAD 1997, 707-712.
4. 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.
5. J. Lillis, et. al., "New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing," DAC 1996, 359-400.
6. T. Okamoto and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," ICCAD 1996, 44-49.
7. W. Shi, "A fast algorithm for area minimization of slicing floorplans," IEEE Trans. CAD 15(6), 1996, 550-571.
8. L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," ISCAS 1990, 865-868.
9. H. Zhou, D. F. Wong, I. M. Liu and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations," IEEE Trans. CAD 19(7), 2000, 819-824.