The associative-skew clock routing problem

@article{Chen1999TheAC,
  title={The associative-skew clock routing problem},
  author={Yu Chen and Andrew B. Kahng and Gang Qu and Alex Zelikovsky},
  journal={1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)},
  year={1999},
  pages={168-172}
}
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative skew problem is easier to address within current EDA frameworks than useful-skew (skew-scheduling) approaches, and defines an interesting tradeoff between the traditional zero-skew clock routing problem (one sink group) and the Steiner minimum tree problem (n sink groups). We present a set of heuristic building blocks… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Topological Synthesis of Clock Trees with Non-Zero Clock Skew

  • I. S. Kourtev, E. G. Friedman
  • Proc. ACM/IEEE International Workshop on Timing…
  • 1997
Highly Influential
4 Excerpts

editor

  • E. G. Friedman
  • Clock Distribution networks in VLSI Circuits and…
  • 1995
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…