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
  • Cache Coherency Glossary
  • The Shared Course Model
  • Cache Coherency Revision Sheet
  • Why Coherence Exists8
  • States and Protocols12
  • Transactions12
  • Races and Controller Design8
  • Progress and the Fabric16
    • Virtual Networks and Progress
    • Filtering and Snoop Pruning
    • Latency, Fairness and QoS
    • Hierarchical and Chiplet Coherence
      • Two-Level Directories
      • Clusters and Global Homes
      • Coherence Across Dies
      • Hierarchy Trade-Offs
  • Ordering and Synchronization12
  • Performance and Scalability12
  • Real Protocols12
  • SoC Integration12
  • Power, Clocking and Reliability12
  • Verification12
  • Debug and Bring-up12
  • Interview and Design Review17
  • Capstone: A Coherent Model Lab5
Loading lesson

‹Progress and the Fabric
  1. Topics
  2. Cache Coherency
  3. Progress and the Fabric
  4. Hierarchical and Chiplet Coherence

Part 5 · Progress and the Fabric · All levels

Hierarchical and Chiplet Coherence

Extend the two-core model with clusters and local proxies while keeping one global serialization point and the dirty data safe.

  • 4topics
  • 4lessons

Hierarchy changes where information lives and how traffic travels. It does not remove the need to find every conflicting permission and the newest data. Begin with what each level of directory records, follow one cross-cluster transfer, then consider die-crossing and metadata costs.

Lesson

After it you can...

Two-Level Directories

Read a cluster-level record and the local states it allows.

Clusters and Global Homes

Trace the newest data through local proxies and one global serialization point.

Coherence Across Dies

Count die crossings on a coherence path and keep link delivery separate from protocol completion.

Hierarchy Trade-Offs

Compare illustrative metadata savings against added paths and replication.

Read after the filtering and deadlock lessons. The lessons extend the course model with two clusters, K0 = {C0, C2} and K1 = {C1}, local proxies H0 and H1, and the original H as global home. C2 is a third core, added because local sharing needs two cores in one cluster. Extra topology does not imply a commercial protocol.

Check yourself Does a global directory entry for K0 prove its local proxy stores X's bytes?

No. It can record the cluster containing a private dirty-responsible holder. A record that leads to a copy is not the copy.

Related topics

  • Shared course model

  • Prerequisite: conservative coverage

PreviousNext: Two-Level Directories

Up next

Up nextTwo-Level Directories

Sign in to save progress

Practice this lessonReport an error

See also

  • Virtual Networks and Progress
  • Filtering and Snoop Pruning
  • Latency, Fairness and QoS