Sciweavers

Share
ICCAD
2006
IEEE

Combinatorial algorithms for fast clock mesh optimization

12 years 2 months ago
Combinatorial algorithms for fast clock mesh optimization
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the high redundancy, a mesh architecture offers high tolerance towards variation in the clock skew. However, such a redundancy comes at the expense of mesh wire length and power dissipation. Based on survivable network theory, we formulate the problem to reduce the clock mesh by retaining only those edges that are critical to maintain redundancy. Such a formulation offers designer the option to trade-off between power and tolerance to process variations. Experimental results indicate that our techniques can result in power savings up to 28% with less than 4% delay penalty.
Ganesh Venkataraman, Zhuo Feng, Jiang Hu, Peng Li
Added 16 Mar 2010
Updated 16 Mar 2010
Type Conference
Year 2006
Where ICCAD
Authors Ganesh Venkataraman, Zhuo Feng, Jiang Hu, Peng Li
Comments (0)
books