| An O(nlogn) time algorithm for optimal buffer insertion |
| Full text |
Pdf
(207 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 40th annual Design Automation Conference
table of contents
Anaheim, CA, USA
SESSION: Technology mapping, buffering, and bus design
table of contents
Pages: 580 - 585
Year of Publication: 2003
ISBN:1-58113-688-9
|
|
Authors
|
|
Weiping Shi
|
Texas A&M University, College Station, TX
|
|
Zhuo Li
|
Texas A&M University, College Station, TX
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 10, Downloads (12 Months): 37, Citation Count: 15
|
|
|
ABSTRACT
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2), where n is the number of possible buffer positions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
Maggie Kang , Wayne W.-M. Dai , Tom Dillinger , David LaPotin, Delay bounded buffered tree construction for timing driven floorplanning, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.707-712, November 09-13, 1997, San Jose, California, United States
|
| |
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
|
John Lillis , Chung-Kuan Cheng , Ting-Ting Y. Lin , Ching-Yen Ho, New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing, Proceedings of the 33rd annual conference on Design automation, p.395-400, June 03-07, 1996, Las Vegas, Nevada, United States
[doi> 10.1145/240518.240594]
|
| |
6
|
|
| |
7
|
"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.
|
CITED BY 15
|
|
|
|
|
C. N. Sze , Charles J. Alpert , Jiang Hu , Weiping Shi, Path based buffer insertion, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
|
|
|
Christoph Bartoschek , Stephan Held , Dieter Rautenbach , Jens Vygen, Efficient generation of short and fast repeater tree topologies, Proceedings of the 2006 international symposium on Physical design, April 09-12, 2006, San Jose, California, USA
|
|
|
|
|
|
Zhuo Li , C. N. Sze , Charles J. Alpert , Jiang Hu , Weiping Shi, Making fast buffer insertion even faster via approximation techniques, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
|
|
|
|
|
|
|
|
|
Yu Hu , King Ho Tam , Tom Tong Jing , Lei He, Fast dual-vdd buffering based on interconnect prediction and sampling, Proceedings of the 2007 international workshop on System level interconnect prediction, March 17-18, 2007, Austin, Texas, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Chien Pang Lu , Mango C.-T. Chao , Chen Hsing Lo , Chih Wei Chang, A metal-only-ECO solver for input-slew and output-loading violations, Proceedings of the 2009 international symposium on Physical design, March 29-April 01, 2009, San Diego, California, USA
|
|