Software Engineering KB

Home

❯

02 Programming Languages and Paradigms

❯

04 Concurrency

❯

01 Concept

❯

Memory Ordering

Memory Ordering

Feb 10, 20261 min read

  • concurrency
  • lock-free
  • memory-ordering

Memory Ordering

← Back to Lock-Free & Wait-Free Programming

Rules governing the visible order of memory operations across threads. Different ordering levels trade off between correctness guarantees and performance, from strict sequential consistency to relaxed ordering that allows maximum hardware optimization.

Key Properties

  • Sequential Consistency
  • Acquire-Release
  • Relaxed Ordering

concurrency lock-free memory-ordering


Graph View

  • Memory Ordering
  • Key Properties

Backlinks

  • Lock-Free & Wait-Free Programming
  • Acquire-Release
  • Relaxed Ordering
  • Sequential Consistency

Created with Quartz v4.5.2 © 2026

  • GitHub