2 ms·

There's a good in-depth discussion here: https://pvk.ca/Blog/2019/01/09/preemption-is-gc-for-memory-reordering/ https://pvk.ca/Blog/2019/01/09/preemption-is-gc-

• loeg 3y ago
  Yeah, kinda, although this is pretty much the entire discussion on how the asymmetric fence works: > The slow path can execute its write(s) before making a membarrier syscall. Once the syscall returns, any fast path write that has yet to be visible (hasn’t retired yet), along with every subsequent instruction in program order, started in a state where the slow path’s writes were visible. (I've actually seen this blog post before, but did not remember this part in detail.)