Cache Coherency · All levels
Directory vs Snoop Fundamentals: Mechanism
Mechanism for Directory vs Snoop Fundamentals.
Mechanism to understand
Mechanism for Directory vs Snoop Fundamentals explains how to reason from coherency invariant to measurable engineering decision.
Broadcast snoops trade simplicity for traffic, while directory schemes trade metadata and lookup latency for scalable filtering.
Start from invariant, not from one signal waveform.
Track ownership and sharer intent as first-class state.
Keep ordering assumptions explicit in every review.
Reference flow
COHERENCY DECISION FLOW — Directory vs Snoop Fundamentals
request intent (read/shared/unique/writeback/evict)
|
v
ownership check + sharer metadata evaluation
|
v
snoop / directory action + ordering gate
|
v
data source selection (owner forward vs memory)
|
v
state transition + acknowledgment closure
|
v
metric validation + regression guardrailsCache coherency deep dive
Cache coherence is a correctness contract across caches, interconnect, and software ordering.
Concept diagram
requester -> coherence fabric -> owner or memory -> state updateMetric graph
traffic mix across request, snoop, response, dataMetrics and artifacts to collect
coherence latency
invalidation rate
retry rate
stale-read incidents
Mini case study
Anchor debug to first stale read and the exact line state transition.
Debug branches
Track ownership
Track ordering
Track evidence
Senior review question
Ask: what is the first line state transition that deviates, and which ordering rule does it break?
Key takeaways
Tie every coherency claim to one cache line, one transaction identity, and one measurable counter.
Keep proof artifacts from simulation and silicon replay aligned by address, state, and ordering event.
Common pitfalls
Chasing bandwidth regressions without checking false sharing and line bouncing first.
Assuming coherence correctness implies memory consistency correctness.
Declaring closure without litmus, stress, and post-silicon replay evidence.