Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Path
  • STA Glossary
  • STA Metrics Reference
  • STA Mastery Cheatsheet
  • Timing Paths and Checks16
  • Constraints & SDC Fundamentals20
  • Delay Graph & Path Analysis16
    • Graph Traversal & Slack
    • Cell vs Net Delay Budgets
    • Path Group Prioritization
    • Report Timing Deep Read
  • Beyond Setup and Hold16
  • Multi-Corner Multi-Mode Signoff16
  • OCV, AOCV, POCV and Variation16
  • Crosstalk and Noise16
  • ECO and Closure16
  • STA Debug Playbook16
  • STA Interview Prep26
  • Capstone Timing Signoff Lab4
Loading lesson

‹Static Timing Analysis
  1. Topics
  2. Static Timing Analysis
  3. Delay Graph & Path Analysis

Part 3 · Delay Graph and Path Analysis · All levels

Delay Graph & Path Analysis

How arrival and required times propagate, where path delay goes, how to prioritise failing paths, and how to read a path report.

  • 4topics
  • 16lessons

Topics in this section

  1. 1Graph Traversal & Slack4 lessons
    • Arrival and Required Times
    • Forward and Backward Propagation
    • Slack Worked Example
    • A Tiny Timing Engine
  2. 2Cell vs Net Delay Budgets4 lessons
    • Where the Delay Goes
    • Sizing and Delay Sensitivity
    • Wire Load and Routed Parasitics
    • Budgeting a Path
  3. 3Path Group Prioritization4 lessons
    • Path Groups and Weights
    • Path Group Reports
    • Choosing What to Fix First
    • Tracking Closure by Group
  4. 4Report Timing Deep Read4 lessons
    • Anatomy of a Path Report
    • Reading the Clock Paths
    • Reading the Data Path
    • Common Misreadings

The timing foundations gave you the graph and the two inequalities. This section turns them into working practice: the propagation algorithm (with a toy engine you can run), a breakdown of where path delay goes, a way to rank failing paths, and a line-by-line reading of path reports, which is where most daily timing work happens.

Learning path through the delay graph section.
Suggested order: the algorithm first, then where the delay goes, then what to fix first, then the report itself.

The sixteen lessons

Lesson

After it you can...

Arrival and Required Times

Compute slack at every node.

Forward and Backward Propagation

Explain why STA scales linearly.

Slack Worked Example

Find shared-segment fixes.

A Tiny Timing Engine

Read and extend a working engine.

Where the Delay Goes

Split a path into cells and wires.

Sizing and Delay Sensitivity

Predict upsizing effects.

Wire Load and Routed Parasitics

Explain estimate-to-routed differences.

Budgeting a Path

Assign stage budgets.

Path Groups and Weights

Explain grouping.

Path Group Reports

Read per-group summaries.

Choosing What to Fix First

Rank work by impact.

Tracking Closure by Group

Track progress honestly.

Anatomy of a Path Report

Recompute a report's slack.

Reading the Clock Paths

Read latency, uncertainty and credit.

Reading the Data Path

Read increments and a hold report.

Common Misreadings

Avoid the eight classic mistakes.

Suggested order: top to bottom. Run every Python block and change a number; the engine in the last lesson of the first topic is the thing to modify. Previous sections: Timing Paths and Checks and Constraints and SDC.

Tip

When a report confuses you, rebuild the path in the toy engine with the same delays. The engine reproduces a report only when launch and capture latencies and uncertainty are folded into its two parameters (start_arrival and period - setup), so treat agreement as a check of your reading, not proof it is right. It cannot model different clocks per endpoint, and a node with no successor needs handling.

Check yourself Name the first three things you read in a path report.

The header (path type, group, view), the slack line, and then the clock sections to see skew, uncertainty and credit before the data path increments.

Related topics

  • Up: STA course hub

  • Glossary

  • RTL: Setup, Hold and Slack

PreviousNext: Graph Traversal & Slack

Up next

Up nextGraph Traversal & Slack

Sign in to save progress

Practice this lessonReport an error

See also

  • How to Use This Course
  • Reading Path
  • STA Glossary