DocumentCode
2012436
Title
A Low-Power Buffered Tree Construction Algorithm Aware of Supply Voltage Variation
Author
Wang, Yibo ; Cai, Yici ; Hong, Xianlong
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing
fYear
2008
fDate
7-9 April 2008
Firstpage
221
Lastpage
226
Abstract
Power dissipation problem becomes a dominant factor in the state-of-the-art IC design. In this paper, we use accurate delay and power models to construct buffered routing trees with consideration of power optimization under timing constraints. Moreover, with the supply voltage goes down, the supply voltage variation becomes an important part of total supply voltage, and make the traditional timing estimation inaccurate and unreliable. Our algorithm takes the supply voltage variation into account to obtain better solutions. Experimental results show, our method can save 42.8% and 75.9% of power dissipation and total buffer area, respectively. Moreover, with the consideration of supply voltage variation, 12.0% power dissipation and 31.6% total buffer area will be saved compared with the worst case IR-drop estimation, and more reliable solutions are obtained compared with the cases not considering supply voltage variation.
Keywords
circuit optimisation; integrated circuit design; low-power electronics; network routing; simulated annealing; trees (mathematics); IC design; buffered routing trees; low-power buffered tree construction algorithm; power dissipation problem; supply voltage variation; timing estimation; Constraint optimization; Delay effects; Integrated circuit interconnections; Power dissipation; Routing; Timing; Tree graphs; Very large scale integration; Voltage; Wire; buffer insertion; low power; supply voltage variation;
fLanguage
English
Publisher
ieee
Conference_Titel
Symposium on VLSI, 2008. ISVLSI '08. IEEE Computer Society Annual
Conference_Location
Montpellier
Print_ISBN
978-0-7695-3291-2
Electronic_ISBN
978-0-7695-3170-0
Type
conf
DOI
10.1109/ISVLSI.2008.31
Filename
4556798
Link To Document