TAMU Homepage TAMU Libraries Homepage TAMU Digital Library Homepage

Clock Distribution Network Optimization by Sequential Quadratic Programing

Show full item record

Title: Clock Distribution Network Optimization by Sequential Quadratic Programing
Author: Mekala, Venkata
Abstract: Clock mesh is widely used in microprocessor designs for achieving low clock skew and high process variation tolerance. Clock mesh optimization is a very diffcult problem to solve because it has a highly connected structure and requires accurate delay models which are computationally expensive. Existing methods on clock network optimization are either restricted to clock trees, which are easy to be separated into smaller problems, or naive heuristics based on crude delay models. A clock mesh sizing algorithm, which is aimed to minimize total mesh wire area with consideration of clock skew constraints, has been proposed in this research work. This algorithm is a systematic solution search through rigorous Sequential Quadratic Programming (SQP). The SQP is guided by an efficient adjoint sensitivity analysis which has near-SPICE(Simulation Program for Integrated Circuits Emphasis)-level accuracy and faster-than-SPICE speed. Experimental results on various benchmark circuits indicate that this algorithm leads to substantial wire area reduction while maintaining low clock skew in the clock mesh. The reduction in mesh area achieved is about 33%.
Subject: Optimization
Clock Distribution Network
Sequential Quadratic Programming
URI: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7753
Date: 2010-05


Mekala, Venkata (2010). Clock Distribution Network Optimization by Sequential Quadratic Programing. Master's thesis, Texas A&M University. Available electronically from http : / /hdl .handle .net /1969 .1 /ETD -TAMU -2010 -05 -7753.

Files in this item

Files Size Format View
MEKALA-THESIS.pdf 2.278Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record