Associative skew clock routing for difficult instances

Authors:
Min-Seok Kim;Jiang Hu
Affiliations:
Texas A & M University, College Station, TX;Texas A & M University, College Station, TX
Venue:
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Year:
2006

Citing 11
Cited 0

Clock Skew Optimization

IEEE Transactions on Computers
A clustering-based optimization algorithm in zero-skew routings

DAC '93 Proceedings of the 30th international Design Automation Conference
Design methodology for synthesizing clock distribution networks exploiting nonzero localized clock skew

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Useful-Skew Clock Routing with Gate Sizing for Low Power Design

Journal of VLSI Signal Processing Systems - Special issue on high performance clock distribution networks
Bounded-skew clock and Steiner routing

ACM Transactions on Design Automation of Electronic Systems (TODAES)
The associative-skew clock routing problem

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Clock skew scheduling for improved reliability via quadratic programming

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
UST/DME: a clock tree router for general skew constraints

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Power Supply Noise Suppression via Clock Skew Scheduling

ISQED '02 Proceedings of the 3rd International Symposium on Quality Electronic Design
An efficient merging scheme for prescribed skew clock routing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient Steiner tree construction based on spanning graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In clock network synthesis, sometimes skew constraints are required only within certain groups of clock sinks and do not exist between different groups. This is the so-called associative skew clock routing problem. Although the number of constraints is reduced, the problem becomes more difficult to solve due to the enlarged solution space. The perhaps only previous work used a very primitive delay model and cannot handle difficult instances in which sink groups are intermingled. We reuse existing techniques to solve this problem, including the difficult instances, based on a more accurate and popular delay model. Experimental results show that our algorithm can reduce the total clock routing wirelength by 12% on average compared to greedy-DME which is one of the best zero skew routing algorithms.