The associative-skew clock routing problem

Authors:
Yu Chen;Andrew B. Kahng;Gang Qu;Alexander Zelikovsky
Affiliations:
UCLA Department of Computer Science, Los Angeles, CA;UCLA Department of Computer Science, Los Angeles, CA;UCLA Department of Computer Science, Los Angeles, CA;Department of Computer Science, Georgia State University, Atlanta, GA
Venue:
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Year:
1999

Citing 9
Cited 3

Clock Skew Optimization

IEEE Transactions on Computers
Computing optimal clock schedules

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Zero skew clock net routing

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A clustering-based optimization algorithm in zero-skew routings

DAC '93 Proceedings of the 30th international Design Automation Conference
On the bounded-skew clock and Steiner routing problems

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Useful-skew clock routing with gate sizing for low power design

DAC '96 Proceedings of the 33rd annual Design Automation Conference
More practical bounded-skew clock routing

DAC '97 Proceedings of the 34th annual Design Automation Conference
Bounded-skew clock and Steiner routing

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Minimizing wirelength in zero and bounded skew clock trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

A practical clock tree synthesis for semi-synchronous circuits

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Clustering based fast clock scheduling for light clock-tree

Proceedings of the conference on Design, automation and test in Europe
Associative skew clock routing for difficult instances

Proceedings of the conference on Design, automation and test in Europe: Proceedings

Quantified Score

Hi-index	0.00

Visualization

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.