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
  • Ordering and Synchronization12
    • Memory Models and Protocols
      • Coherence Is Not Consistency
      • SC, TSO and Store Buffers
      • Litmus Tests: SB and MP
      • Weak Models: Arm and RISC-V
    • Barriers, Fences and Completions
    • Speculation, Replay and Recovery
  • 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

‹Ordering and Synchronization
  1. Topics
  2. Cache Coherency
  3. Ordering and Synchronization
  4. Memory Models and Protocols

Part 6 · Ordering and Synchronization · All levels

Memory Models and Protocols

Separate per-location coherence from architectural ordering, then enumerate simple SC and TSO outcomes.

  • 4topics
  • 4lessons

A coherent protocol determines how values and permissions for a location are preserved. A memory model constrains which combinations of observations across operations are permitted. This topic connects those contracts without equating a cache state diagram with an ISA specification.

Lesson

After it you can...

Coherence Is Not Consistency

Explain a coherent execution that SC forbids across locations.

SC, TSO and Store Buffers

Separate store issue, local forwarding and global visibility.

Litmus Tests: SB and MP

Enumerate rather than guess the outcomes of two small tests.

Weak Models: Arm and RISC-V

Name the architectural model and identify evidence needed for a claim.

Read in order. The architectural examples extend the two-core course system with Y in a different 64-byte line. Both locations start at 0, with no cached copies, unless stated otherwise.

Check yourself Does correct GetM invalidation by itself prove that all program-order loads and stores appear in one global order?

No. Store buffering, speculation and architectural ordering constraints are separate from a line's permission transfer. SC makes a global program-order promise that coherence alone does not.

Related topics

  • Shared course model

  • Prerequisite: per-location values

PreviousNext: Coherence Is Not Consistency

Up next

Up nextCoherence Is Not Consistency

Sign in to save progress

Practice this lessonReport an error

See also

  • Barriers, Fences and Completions
  • Speculation, Replay and Recovery