ACM Home Page
Please provide us with feedback. Feedback
An efficient surface-based low-power buffer insertion algorithm
Full text PdfPdf (512 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2005 international symposium on Physical design table of contents
San Francisco, California, USA
SESSION: Power, buffering and open source table of contents
Pages: 86 - 93  
Year of Publication: 2005
ISBN:1-59593-021-3
Authors
Rajeev R. Rao  University of Michigan, Ann Arbor, MI
David Blaauw  University of Michigan, Ann Arbor, MI
Dennis Sylvester  University of Michigan, Ann Arbor, MI
Charles J. Alpert  IBM Corporation, Austin, TX
Sani Nassif  IBM Corporation, Austin, TX
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 27,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Buffer insertion is an important technique used to achieve timing closure in high performance VLSI designs. As the number of buffers in ASIC designs has increased with process scaling, the power con-sumption of buffers has become a critical concern. In this paper, we present an efficient algorithm that performs van Ginneken style buffer insertion on RC trees and minimizes the total power con-sumption under a given delay constraint. Our algorithm is based on a formulation that uses a buffer library consisting of continuous buffer sizes. We construct solution candidates in the form of surfaces in the 3-D delay, capacitance and power (DCP) space and show the mecha-nisms to propagate and merge them in the interconnect tree. Instead of a single minimal power solution, the algorithm produces an entire DCP surface from which a suitable solution point can be selected. We also present a post-processing step where buffers with continu-ous (non-standard) sizes are snapped to discrete size values corre-sponding to the buffers in a given library. The proposed algorithm has a worst-case runtime complexity that is polynomial (quadratic) in the number of possible buffer locations. We implemented and tested our proposed algorithm on a number of large benchmark nets and observed that our method produces a speedup in runtime of 5-6X in comparison with previous power aware buffer insertion methods.


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
L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree networks for minimal elmore delay", ISCAS 1990.
3
4
 
5
C. Chu, D. F. Wong, "A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing", IEEE Trans. on CAD, 18(6), 1999.
 
6
C.-P. Chen, C. Chu, D. F. Wong, "Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation", IEEE Trans. on CAD, 18(7), 1999.
 
7
J.-L. Tsai, T.-H. Chen, C.-P. Chen, "Zero skew clock-tree optimization with buffer insertion/sizing and wire sizing", IEEE Trans. on CAD, 23(4), 2004.
 
8
C. J. Alpert, C. Chu, G. Gandham, M. Hrkic, J. Hu, C. Kashyap, S. Quay, "Simultaneous driver sizing and buffer insertion using a delay penalty estimation technique", IEEE Trans. on CAD, 23(1), 2004.
 
9
 
10
H. Zhou, D. F. Wong, I. Liu, A. Aziz,"Simultaneous routing and buffer insertion with restrictions on buffer locations", IEEE Trans. on CAD, 19(7), 2000.
 
11
 
12
 
13
 
14
S. Weiping, L. Zhuo, "An O(nlogn) time algorithm for optimal buffer insertion", DAC 2003.
 
15
P. Saxena, N. Menezes, P. Cocchini, D. Kirkpatrick, "Repeater scaling and its impact on CAD", IEEE Trans. on CAD, 23(4), 2004.
 
16
17
18
 
19
J. Lillis, C.-K. Cheng, T. Y. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model", JSSC, 31(3), 1996.
 
20
 
21
J. Fishburn, C. Schevon, "Shaping a distributed RC line to minimize Elmore delay", IEEE Trans. on Circuits and Systems, 42(12), 1995.
22
 
23
 
24
 
25
W. C. Elmore, "The transient response of a damped linear network with particular regard to wideband amplifiers", J. Applied Physics, 19, 1948.
26
 
27
R. Haddad, L. P. P. P. van Ginneken, N. Shenoy, "Discrete drive selection for continuous sizing", ICCD 1997.
28
 
29
 
30
GNU Scientific Library (GSL), http://www.gnu.org/software/gsl/.
 
31
C. J. Alpert, M. Hrkic, J. Hu, A. B. Kahng, J. Lillis, B. Liu, S. T. Quay, S. S. Sapatnekar, A. J. Sullivan, P. Villarrubia, "Buffered Steiner trees for difficult instances", IEEE Trans. on CAD, 21(1), 2002.
 
32
 
33
International Technology Roadmap for Semiconductors (ITRS), 2001.


Collaborative Colleagues:
Rajeev R. Rao: colleagues
David Blaauw: colleagues
Dennis Sylvester: colleagues
Charles J. Alpert: colleagues
Sani Nassif: colleagues