MétaCan
Menu
Back to cohort
Record W2105974573 · doi:10.1109/vlsid.2007.33

An Efficient Uncertainty- and Skew-aware Methodology for Clock Tree Synthesis and Analysis

2007· article· en· W2105974573 on OpenAlexaff
Vineet Wason, Rajeev Murgai, William W. Walker

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicLow-power high-performance VLSI design
Canadian institutionsAdvanced Micro Devices (Canada)
Fundersnot available
KeywordsSkewClock skewComputer scienceStatic timing analysisTiming failureTree (set theory)Clock networkAlgorithmClock signalMathematicsJitterEmbedded system

Abstract

fetched live from OpenAlex

The effect of variations (process, voltage, temperature, and crosstalk) on circuit delay is increasing with technology scaling. As a result, the timing uncertainty of clock signal is increasing. In this paper, an efficient methodology for clock timing uncertainty- and skew-aware clock tree synthesis and analysis is proposed. We first present a statistical and less pessimistic methodology (as compared to the traditional static timing analysis (STA) methodology) for computing the clock timing uncertainty under the impact of parameter variations (process, voltage, temperature, and crosstalk). We also devise a technique to synthesize a clock tree that has zero skew and on which uncertainty can be computed efficiently. Finally, using the proposed uncertainty analysis algorithm, a post-processing scheme to reanalyze the critical paths reported by traditional STA is presented. We applied our zero-skew tree synthesis algorithm on a real industrial design. With our analysis methodology, the worst-case timing uncertainty on this tree was reduced from 388ps (used by traditional STA tools) to 63ps

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.446
Threshold uncertainty score0.669

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.026
GPT teacher head0.281
Teacher spread0.255 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations7
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicLow-power high-performance VLSI designFrench-language works237,207