Zero skew clock net routing

Abstract

The authors present an algorithm, called the zero skew segment tree method (ZSTM), for the clock net routing problem. To eliminate the lock skew and minimize the total wire length, ZSTM recursively partitions the sink nodes into two subsets which have equal loadings and minimum sum of diameters, and then constructs a zero skew segment tree according to the partitioning result. The final layout of the clock net can be decided by the channel information of the routing region. Experiments showed that ZSTM improved the wire length by 15% and the maximum delay by 3% over the published results. It also completely eliminated the clock skew.<>