In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) intwosteps: (i) a bottom-upphase to construct a binarytree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the exact locations of clock entry points.Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of routing solutionswith skew and wirelength trade-off.
Paper Location
IEEEXplore
Citation
[1] J. Cong, "Minimum-cost bounded-skew clock routing," Proceedings of ISCAS'95 - International Symposium on Circuits and Systems, vol. 2775, pp. 215-218.
Positive
- Problem formulation is clearly stated and easy to read. Well defined problem.
- Great use of theorems to prove the cited properties of the BST/DME algorithm.
- Good use of the figures to illustrate how the proofs are working.
Negative
- Insufficient number of comparisons, there are a lot of other algorithms out there.
- Possible improvements are mentioned, but not incorporated into the algorithm, the improvements seem to be a small time commitment.
No comments:
Post a Comment