Relaxed Semantic

The relaxed semantic is the other end of the spectrum. It’s the weakest of all memory models and only guarantees that the operations on the same atomic data type in the same thread won’t be reordered. That guarantee is called modification order consistency. Other threads can see these operations in a different order.

No Synchronization & Ordering constraints?

This is quite easy; if there are no rules, we cannot violate them. But that is too easy, as the program should have well-defined behavior. In particular, this means that data ...