ACM Home Page
Please provide us with feedback. Feedback
Wire segmenting for improved buffer insertion
Full text PdfPdf (158 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 588 - 593  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Charles Alpert  IBM Austin Research Laboratory, Austin, TX
Anirudh Devgan  IBM Austin Research Laboratory, Austin, TX
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 33,   Citation Count: 57
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/266021.266291
What is a DOI?

ABSTRACT

Buffer insertion seeks to place buffers on the wires of a signal netto minimize delay. Van Ginneken [Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay] proposed an optimal dynamicprogramming solution (with extensions proposed by [7] [8][9] [12]) such that at most one buffer can be placed on a singlewire. This constraint can hurt solution quality, but it may be circumventedby dividing each wire into multiple smaller segments.This work studies the problem of finding the correct number of segmentsfor each wire in the routing tree. Too few segments yieldssub-par solutions, but too many segments can lead to excessive runtimes and memory loads. We derive new theoretical results forcomputing the appropriate number of buffers (and hence wire segments)which motivate our new wire segmenting algorithm. Weshow that using wire segmenting as a precursor to buffer insertionproduces solutions within a few percent of optimal, while usingonly seconds of CPU time.


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
S. Dhar and M. A. Franklin, "Optimum Buffer Circuits for Driving Long Uniform Lines" IEEE Journal of Solid-State Circuits 26(1), 1991, pp. 32-40.
 
4
W. C. Elmore, "The Transient Response of Damped Linear Network with Particular Regard to Wideband Amplifiers", J. Applied Physics 19, 1948, pp. 55-63.
 
5
N. Hedenstierna and K. O. Jeppson, "CMOS Circuit Speed and Buffer Optimization", IEEE Trans. on Computer-Aided Design 6(2), 1987, pp. 270-281.
6
 
7
J. Lillis, C.-K. Cheng and T.-T. Y. Lin "Optimal and Efficient Buffer Insertion and Wire Sizing", IEEE Custom Integrated Circuits Conference, 1995, pp. 259-262
 
8
 
9
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 Journal of Solid-State Circuits, 31(3), 1996, pp. 437-447.
 
10
 
11
 
12
T. Okamoto and J. Cong, "Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion", Fifth ACM/SIGDA Physical Design Workshop, 1996, pp. 1-6.
13
 
14
L. E E E van Ginneken, "Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay", Proc. International Symposium on Circuits and Systems, 1990, pp. 865-868.

CITED BY  57

Collaborative Colleagues:
Charles Alpert: colleagues
Anirudh Devgan: colleagues