ACM Home Page
Please provide us with feedback. Feedback
An O(nlogn) time algorithm for optimal buffer insertion
Full text PdfPdf (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
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 37,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775832.775980
What is a DOI?

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
 
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
 
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