Computer Architecture · All levels

MESI Fundamentals and Variants — Comparison Matrix

Comparison Matrix for MESI Fundamentals and Variants (Coherency and Memory Ordering).

Comparison matrix

Coherency protocols differ in traffic, latency, directory cost, and verification burden.

diagram
+------------------+----------------+----------------+----------------+
| Approach         | Strength       | Weakness       | Best when      |
+------------------+----------------+----------------+----------------+
| MESI             | simple         | writebacks     | SMP            |
| MOESI            | less off-chip  | more states    | shared heavy   |
| MESIF            | forwarding     | detail         | Intel-style    |
| Directory        | scalable       | directory cost | large SMP      |
+------------------+----------------+----------------+----------------+

When to choose each approach

  • Pick baseline when schedule risk dominates

  • Pick structural only with proof

Interview traps

  • One approach always best

  • Ignoring software burden

Architecture deep dive

Coherency protocols trade traffic, latency, and verification complexity.

Concept diagram

diagram
MESI STATE SKETCH

        read miss          write
 Invalid ─────────► Shared ───────► Modified
    ▲                 │  ▲             │
    │ invalidate      │  │ downgrade   │ writeback
    └─────────────────┘  └─────────────┘

The interview bar is not naming states; it is explaining traffic and ordering.

Metric graph

diagram
COHERENCY TRAFFIC STACK

read shared      █████████████  42%
read exclusive   ███████        21%
invalidates      ██████████     31%
writebacks       █████          14%
snoop retries    ███            8%

False sharing often appears as invalidation spikes.

Metrics and artifacts

  • coherency transaction rate

  • snoop/filter efficiency

  • ordering violation tests

  • false sharing counters

Mini case study

Performance regression traced to false sharing on a counter array — coherency traffic exploded. Architecture fix: per-core counters + periodic merge, not faster NoC alone.

Debug branches

  • If rare SW bug, run litmus and ordering tests before microarch changes.

  • If traffic high, profile sharing patterns at cache-line granularity.

Senior review question

Ask: what single metric would prove this concept is working or failing on your workload?

Key takeaways

  • Connect every architecture claim to a workload and measurable metric.

  • State verification and PPA impact before proposing design changes.

Common pitfalls

  • Feature-driven design without MPKI/IPC/bandwidth evidence.

  • Ignoring coherency and NoC traffic in cache and accelerator sizing.

Study notes

Re-read this topic with one concrete workload.