Zero Skew Clock Routing With Minimum Wirelength (1992)
| Citations: | 64 - 12 self |
BibTeX
@MISC{Chao92zeroskew,
author = {Ting-Hai Chao and Yu-Chin Hsu and Jan-Ming Ho and Kenneth D. Boese and Andrew B. Kahng},
title = {Zero Skew Clock Routing With Minimum Wirelength},
year = {1992}
}
Years of Citing Articles
OpenURL
Abstract
In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we first present the Deferred-Merge Embedding (DME) algorithm, which embeds any given connection topology to create a clock tree with zero skew while minimizing total wirelength. The algorithm always yields exact zero skew trees with respect to the appropriate delay model. Experimental results show an 8% to 15% wirelength reduction over previous constructions in [17] [18]. The DME algorithm may be applied to either the Elmore or linear delay model, and yields optimal total wirelength for linear delay. DME is a very fast algorithm, running in time linear in the number of synchronizing elements. We also present a unified BB+DME algorithm, which constructs a clock tree t...







