DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Bounded-skew clock and Steiner routing under Elmore delay
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Optimal clock skew scheduling tolerant to process variations
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Optimal non-uniform wire-sizing under the Elmore delay model
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Impact of interconnect variations on the clock skew of a gigahertz microprocessor
Proceedings of the 37th Annual Design Automation Conference
A general probabilistic framework for worst case timing analysis
Proceedings of the 39th annual Design Automation Conference
UST/DME: a clock tree router for general skew constraints
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Fast Generation of Statistically-based Worst-Case Modeling of On-Chip Interconnect
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Optimal Wire-Sizing Function with Fringing Capacitance Consideration
Optimal Wire-Sizing Function with Fringing Capacitance Consideration
Optimal wiresizing under Elmore delay model
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Clock skew bounds estimation under power supply and process variations
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Hi-index | 0.00 |
Under modern VLSI technology, process variations greatly affectcircuit performance, especially clock skew which is very timingsensitive. Unwanted skew due to process variation forms a bottleneckpreventing further improvement on clock frequency. Impactfrom intra-chip interconnect variation is becoming remarkable andis difficult to be modeled efficiently due to its distributive nature.Through wire shaping analysis, we establish an analytical boundfor the unwanted skew due to wire width variation which is thedominating factor among interconnect variations. Experimental resultson benchmark circuits show that this bound is safer, tighterand computationally faster than similar existing approach.