Interface Protocols · All levels
CHI Topology Basics: Comparison Matrix
Comparison Matrix for CHI Topology Basics.
Comparison matrix
MESI/MOESI/CHI differ in traffic, directory cost, latency, and verification burden.
+------------------+----------------+----------------+----------------+
| Approach | Strength | Weakness | Best when |
+------------------+----------------+----------------+----------------+
| Baseline | known, signed | may miss peak | shipping SKU |
| More buffer | absorbs latency | area, deadlock | DMA-heavy |
| Wider bus | peak BW up | timing, power | memory bound |
| SW contract | cheap silicon | driver burden | fixed platform |
+------------------+----------------+----------------+----------------+When to choose each approach
Pick baseline when schedule and risk dominate
Pick buffering only after proving backpressure is the limiter
Pick width only after payload efficiency analysis
Pick software contract when hardware change is too expensive
Interview traps
Comparing peak spec numbers across protocols
Ignoring bridge and firmware in the comparison
One-size-fits-all answer in interviews
Evidence comparison
COMPLIANCE / DEBUG MATRIX — CHI Topology Basics
+-------------------+------------------------+--------------------------+-------------------------+
| Evidence | Tells you | Does not prove | Next action |
+-------------------+------------------------+--------------------------+-------------------------+
| Waveform | signal-level sequence | full system intent | map to transaction log |
| VIP transaction | spec-level behavior | RTL micro-cause | correlate timestamp |
| Counter / PMU | aggregate symptom | single failing packet | isolate traffic class |
| Firmware log | software-visible flow | electrical/link health | compare with hardware |
| Analyzer capture | external protocol view | internal reset/config | align with RTL trace |
+-------------------+------------------------+--------------------------+-------------------------+Protocol deep dive
Coherence extends memory transactions with snoop and state — traffic multiplies when software shares cache lines.
Concept diagram
COHERENCE TRAFFIC FLOW
RN issues coherent read
-> HN looks up directory
-> snoops to sharers
-> data + state update returned
False sharing: different variables, same cache line -> coherence storm.Metric graph
COHERENCY TRAFFIC STACK
data fetch ████████
snoop responses ██████████████
writebacks ██████
maintenance ops ████
High snoop stack with good IPC -> suspect line sharing before faster NoC.Metrics and artifacts to collect
snoop rate
intervention latency
coherency transaction mix
false sharing indicators
Mini case study
Benchmark IPC looked fine but system power spiked: per-core counters were on one cache line. Padding counters fixed coherency traffic without any NoC change.
Debug branches
If snoop latency high, check home node placement and directory policy.
If ordering bug, run litmus sequences before microarch changes.
If traffic storm, profile cache line sharing in software layout.
Senior review question
Ask: what is the first transaction that deviates, and which spec rule does it test?
Key takeaways
Connect every protocol claim to a transaction identity and measurable metric.
Store the artifact (waveform, log, counter) next to every signoff decision.
Common pitfalls
Debugging timeouts without finding the first bad transaction.
Quoting peak bus width without payload efficiency and retry overhead.
Treating VIP compliance as a substitute for system integration replay.
Principal review addendum
Re-read CHI Topology Basics against one concrete product workload, not a synthetic directed test.
CHI separates request, response, data, and snoop flows across nodes with directory and home-node responsibilities.