[concurrency-interest] Enforcing total sync order on modern hardware

Marko Topolnik marko at hazelcast.com
Tue Mar 24 09:02:03 EDT 2015


On Tue, Mar 24, 2015 at 1:54 PM, Alexander Terekhov <TEREKHOV at de.ibm.com>
wrote:

> http://lists.boost.org/Archives/boost/2011/08/185134.php
>
> A == 1 && B == 0 && C == 1 && D == 0 is possible without remote write
> atomicity.


It is also possible if (A = X; B = Y;) can be reordered into (B = Y; A =
X;), even if the writes were in order. That's what Oleksandr was getting
at, I believe.

---
Marko
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20150324/0ee1ecbe/attachment.html>


More information about the Concurrency-interest mailing list