Wire Length And Delay Minimization In General Clock Net Routing

Abstract

We propose a simulated annealing based zero-skew clock net construction algorithm which works in any routing space, from Manhattan to Euclidean, with the added flexibility of optimizing either the wire length or the propagation delay. We first devise an O(1og n) tree grafting perturbation function to construct a zero-skew clock tree under t he Elmore delay model. This tree grafting scheme is able to explore the entire solution space asymptotically. A Gauss-Seidel iteration procedure is then applied to optimize the Steiner point positions. Experimental results have shown that our algorithm can achieve substantial delay reduction and encouraging wire length minimization compared to previous works.