An interesting trick for increasing instruction-level parallelism by introducing a spurious-seeming conditional to break a dependency chain:

If we could tell the CPU to predict that j stays intact, the loop would become throughput-bound rather than latency-bound. While we don’t have direct control over address prediction, we can simulate this with branch prediction: […]

See also Matt Godbolt’s talk about the fundamental performance features of modern CPUs.