Skip to content
scrambled
Parallel And Distributed Programming Concept

Relaxed Consistency

Depends on JourneyParallel And Distributed Programming Statuslearning Tags
  • computation model
  • correctness condition

A family of memory consistency models weaker than sequential consistency. They permit the hardware or compiler to reorder memory operations (reads and writes) across threads as long as the program order within each thread is preserved for dependent operations.

Used in practice because enforcing sequential consistency requires expensive synchronization barriers. Examples: processor consistency, release consistency, and the C++11 memory_order_relaxed ordering. Stronger consistency is achieved on demand via acquire/release semantics or sequentially-consistent atomic operations.