[concurrency-interest] Ordering Question

Michael Barker mikeb01 at gmail.com
Tue Jul 19 22:11:15 EDT 2016


I have a question around ordering of events.

Given, threads (T1, T2), and variables (A, B, X, Y) where X and Y are
shared on the heap and visible to T1 and T2.


X = 0
Y = 0;

1) X = 1 (lazySet/putOrdered)
2) B = Y (volatile read)

3) Y = 1 (compare and set)
4) A = X (volatile read)

Is it possible to get a final state of A = 1 and B = 0?

My current suspicion is that it is, due to 1) and 2) being reordered.  If
so, can the final state of A=1, B=0 be prevented by strengthening 1) to be
a volatile store?

Michael Barker.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20160720/34a5373f/attachment.html>

More information about the Concurrency-interest mailing list