Proceedings of 1993 International Conference on Computer Aided Design (ICCAD) · 2005 · 33 citations · 11 references
EngineeringComputer ScienceElectrical EngineeringAlgorithmsCircuit TheoryDesign OptimizationCombinatorial OptimizationDelay ModelingInterconnect DesignRoutingRouting AlgorithmsTiming AnalysisClock RoutingClock Skew MinimizationClock Tree RoutingDelay MinimizationSimulated AnnealingSimulated Annealing OptimizationSimulated Annealing RoutingZero-skew Clocking
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 the 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.
11
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
Clock routing for high-performance ICs
M.A.B. Jackson, Arvind Srinivasan, E.S. Kuh · 1990 · 228 citations
Engineering, Computer Engineering, Electrical Engineering +16
A clustering-based optimization algorithm in zero-skew routings
Masato Edahiro · 1993 · 222 citations