ACM Home Page
Please provide us with feedback. Feedback
Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method
Full text PdfPdf (923 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 42nd annual Design Automation Conference table of contents
Anaheim, California, USA
SESSION: Electrical optimization for physical synthesis table of contents
Pages: 813 - 818  
Year of Publication: 2005
ISBN:1-59593-058-2
Authors
Yuantao Peng  North Carolina State University, Raleigh, NC
Xun Liu  North Carolina State University, Raleigh, NC
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 8,   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/1065579.1065794
What is a DOI?

ABSTRACT

This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines a local optimizer based on the dynamic programming technique and a global search engine using the ellipsoid method. As a result, our approach is capable of producing high-quality solutions at a very fast speed. Furthermore, our scheme is robust and does not need any manual tuning of the iteration-control parameters.We have developed a repeater insertion tool, called F<small>REEZE</small>, using the proposed algorithm and applied it to various interconnect trees with different timing targets. Experimental results demonstrate the high effectiveness of our approach. In comparison with the state-of-the-art low-power repeater insertion schemes, F<small>REEZE</small> requires 5.8 times fewer iterations on the average, achieving up to 27 times speedup with even better power savings. When compared with a dynamic programming based scheme, which guarantees the optimal solution, our tool delivers up to 50 times speedup with 0.9% power increase on the average.


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. Computer-Aided Design of Integrated Circuits and Systems, 18(11):1633--1645, Nov. 1999.
2
3
 
4
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.
 
5
H. B. Bakoglu. Circuits, Interconnects, and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
 
6
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.
7
8
 
9
 
10
 
11
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.
 
12
N. Hedenstierna and K. O. Jeppson. CMOS circuit speed and buffer optimization. IEEE Trans. CAD, 6(2):270--280, Feb. 1987.
13
 
14
J. Lillis, C. K. Cheng, and T.-T. Y. Lin. Optimal wire sizing and buffer insertion for low power and a generalized delay model. J. of Solid-State Circuits, 31(3):437--447, Mar. 1996.
15
16
 
17
 
18
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.
 
19
M. Nekili and Y. Savaria. Optimal methods of driving interconnections in VLSI circuits. In International Symposium on Circuits and Systems, May 1993.
 
20
A. Nemirovsky and D. Yudin. Informational complexity and efficient methods for solution of convex extremal problems. J. Wiley & Sons, New York, 1983.
21
 
22
J. F. Shapiro. Mathematical Programming: Structures and Algorithms. Wiley-Interscience Publication, 1979.
23
 
24
D. Sylvester and K. Keutzer. A global wiring paradigm for deep submicron design. IEEE Trans. CAD, 19(2):242--252, Feb. 2000.