Relaxed ordering preserves the atomicity of an atomic read-modify-write, but places no ordering constraints on other memory accesses. Unlike acquire-release ordering, it does not act as a fence, avoiding fence overhead when surrounding accesses need no ordering. section 4.1.3
In Triton, choose it with `sem="relaxed"` on an atomic operation. It suits accumulation where the atomic update must be indivisible but the visibility order of surrounding loads and stores does not matter. section 4.1.3
Split-K accumulation
In Split-K GEMM, program instances atomically add partial results. Relaxed ordering is suitable when the goal is the final sum, not an ordering of surrounding memory accesses. section 4.1.3
