ACM Home Page
Please provide us with feedback. Feedback
Practical repeater insertion for low power: what repeater library do we need?
Full text PdfPdf (211 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: Clock routing and buffering table of contents
Pages: 30 - 35  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
Xun Liu  North Carolina State University, Raleigh, NC
Yuantao Peng  North Carolina State University, Raleigh, NC
Marios C. Papaefthymiou  University of Michigan, Ann Arbor, MI
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 8
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/996566.996576
What is a DOI?

ABSTRACT

In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal repeater number and width in the discrete solution space, as defined by a given repeater library. Using our algorithm, we show that rounding the solution under the continuity assumption to the closest discrete solution candidate may result in suboptimal designs, or it may even fail to find an existing solution. Given a certain tolerance to the degradation of repeater power dissipation, we address two practical and highly important questions: (1) How coarse could the repeater size granularity be? (2) What range should the repeater size be in?Experimental results demonstrate the high effectiveness of the proposed scheme and provide valuable insights into repeater library design. Our approach achieves up to 23 power reduction in comparison to rounding-based approaches. With a 4 power degradation tolerance, repeater size granularity as coarse as 8 can be used, reducing the library size by more than 87. For interconnects with various wire lengths and timing targets, our investigation reveals that the range of optimal repeater sizes for low-power is limited, indicating that a low-cost small-size repeater library, if well designed, is adequate to provide high quality repeater insertion solutions.


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
V. Adler and E. G. Friedman. Repeater design to reduce delay and power in resistive interconnect. IEEE Trans. Circuits and Systems--II: Analog and Digital Signal Processing, 45(5):607--616, May 1998.
 
2
H. B. Bakoglu. Circuits, Interconnects, and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
 
3
K. Banerjee and A. Mehrotra. A power-optimal repeater insertion methodology for global interconnects in nanometer designs. IEEE Trans. VLSI Systems, 49(11):2001--2007, Nov. 2002.
4
 
5
 
6
 
7
 
8
9
 
10
 
11
 
12
 
13
H. Zhou, D. F. Wong, I. M. Liu and A. Aziz. Simultaneous routing and buffer insertion with restrictions on buffer locations. IEEE Trans. Computer Aided Design of Intergrated Circuits and System, 19(7):819--824, 2000.
 
14
A. Nalamalpu and W. P. Burleson. Repeater insertion in deep sub-micron CMOS: Ramp-based analytical model and placement sensitivity analysis. In International Symposium on Circuits and Systems, May 2000.
 
15
A. Nalamalpu and W. P. Burleson. A practical approach to DSM repeater insertion: Satisfying delay constraints while minimizing area and power. In IEEE International ASIC/SOC Conference, Sept. 2001.
16
17
 
18
D. Sylvester and K. Keutzer. A global wiring paradigm for deep submicron design. IEEE Trans. CAD, 19(2):242--252, Feb. 2000.
 
19
L. P. P. P. van Ginneken. Buffer placement in distributed rc-tree networks for minimal elmore delay. In Proc. Intl. Symposium on Circuits and Systems, 1990.
 
20
C. Y. Wu and M. Shiau. Delay models and speed improvement techniques for RC tree interconnections among small geometry CMOS VLSI. Journal of Solid-State Circuits, 25(10):1247--1256, Oct. 1990.

CITED BY  8

Collaborative Colleagues:
Xun Liu: colleagues
Yuantao Peng: colleagues
Marios C. Papaefthymiou: colleagues