ACM Home Page
Please provide us with feedback. Feedback
Low-power repeater insertion with both delay and slew rate constraints
Full text PdfPdf (612 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 18: buffer insertion table of contents
Pages: 302 - 307  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Yuantao Peng  North Carolina State University, Raleigh, NC
Xun Liu  North Carolina State University, Raleigh, NC
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 26,   Citation Count: 2
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/1146909.1146989
What is a DOI?

ABSTRACT

In this paper, a novel repeater insertion algorithm is presented to minimize the power dissipation of interconnect trees under given timing budgets and slew rate constraints. In contrast to traditional bottom-up dynamic programming approaches, the proposed algorithm combines a Lagrangian relaxation framework and a graph-based search method to derive possible solutions in a top-down fashion. As a result, it is capable of analyzing repeater slew rates efficiently. In addition, our scheme incorporates accurate circuit models and is therefore able to capture the precise delay and slew rate information, leading to high-quality interconnect designs.We have applied our scheme to interconnects of different topologies and various timing and slew rate constraints. Experimental results demonstrate the effectiveness of our approach in comparison with previous low-power repeater insertion schemes. Under tight timing constraints, our scheme can always derive repeater insertion solutions that meet both delay and slew rate requirements, whereas other schemes often fail. Under loose timing constraints, our algorithm achieves up to a 23% average power dissipation reduction for different interconnects specifications with shorter runtimes.


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
C. Alpert, A. Devgan, and S. T. Quay. Buffer insertion for noise and delay optimization. IEEE Trans. CAD, 18(11):1633--1645, Nov. 1999.
2
 
3
C. J. Alpert, J. Hu, S. S. Sapatnekar, and P. G. Villarrubia. A practical methodology for early buffer and wire resource allocation. IEEE Trans. CAD, 22(5), May 2003.
 
4
H. B. Bakoglu. Circuits, Interconnects, and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
5
6
 
7
 
8
 
9
 
10
L. Ginneken. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In ISCAS, 1990.
 
11
N. Hedenstierna and K. O. Jeppson. CMOS circuit speed and buffer optimization. IEEE Trans. CAD, 6(2):270--280, Feb. 1987.
12
 
13
J. Lillis, C. K. Cheng, and T.-T. Y. Lin. Optimal wire sizing and buffer insertion for low power and a generalized delay model. JSSC, 31(3):437--447, Mar. 1996.
14
 
15
 
16
A. Nalamalpu and W. P. Burleson. A practical approach to DSM repeater insertion: Satisfying delay constraints while minimizing area and power. In IEEE Inter. ASIC/SOC Conference, Sept. 2001.
 
17
M. Nekili and Y. Savaria. Optimal methods of driving interconnections in VLSI circuits. In ISCAS, May 1993.
18
19
 
20
P. Saxena, N. Menezes, P. Cocchini, and D. A. Kirkpatrick. Repeater scaling and its impact on CAD. IEEE Trans. CAD, 23(4):451--463, Apr. 2004.
 
21
J. F. Shapiro. Mathematical Programming: Structures and Algorithms. Wiley-Interscience Publication, 1979.