Taco: temperature aware clock-tree optimization
Authors:
- 22 December 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10923152,p. 582-587
Abstract
In this paper, an efficient linear time algorithm TACO is proposed for the first time to minimize the worst case clock skew in the presence of on-chip thermal variation. TACO, while tries to minimize the worst case clock skew, also attempts to minimize the clock tree wirelength by building up merging diamonds in a bottom-up manner. As an output, TACO provides balanced merging points and the modified clock routing paths to minimize the worst case clock skew under thermal variation. Experimental results on a set of standard benchmarks show 50-70% skew reduction with less than 0.6% wirelength overhead.Keywords
This publication has 12 references indexed in Scilit:
- Transistor Sizing Issues And Tool For Multi-threshold Cmos Technology2005
- Fast, automated thermal simulation of three-dimensional integrated circuits2004
- Concurrent sizing, Vdd and V/sub th/ assignment for low-power design2004
- Distributed sleep transistor network for power reduction2003
- Zero-skew clock routing trees with minimum wirelength2003
- 3-D Thermal-ADI: a linear-time chip level transient thermal simulatorIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Gated clock routing for low-power microprocessor designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2001
- Analysis and optimization of thermal issues in high-performance VLSI2001
- Bounded-skew clock and Steiner routingACM Transactions on Design Automation of Electronic Systems, 1998
- An exact zero-skew clock routing algorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993