Title :
The associative-skew clock routing problem
Author :
Yu Chen ; Kahng, A.B. ; Gang Qu ; Zelikovsky, A.
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Abstract :
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, including an efficient and optimal method of merging two zero-skew trees such that zero skew is preserved within the sink sets of each tree. Finally, we list a number of open issues for research and practical application.
Keywords :
circuit layout CAD; clocks; network routing; trees (mathematics); EDA; Steiner minimum tree problem; associative skew clock routing problem; clock routing tree; electronic design automation; heuristic building blocks; merging; skew-scheduling; zero skew; Binary search trees; Circuit topology; Clocks; Computer science; Costs; Electronic design automation and methodology; Merging; Routing; Steiner trees; Very large scale integration;
Conference_Titel :
Computer-Aided Design, 1999. Digest of Technical Papers. 1999 IEEE/ACM International Conference on
Conference_Location :
San Jose, CA, USA
Print_ISBN :
0-7803-5832-5
DOI :
10.1109/ICCAD.1999.810643