> I think this way lies madness. The model simply isn't defined in terms of
> permitted or non-permitted reorderings.
Well it is and it isn't. ...
> If you want to make some assertion in your lock free algorithm
> you need to find a combination of happens-before and synchronization
> orderings that supports it.
But that is not sufficient. Identifying the happens-before relationships
doesn't guarantee that A will happen before B. The system is allowed to
reorder actions in a happens-before relationship as long as it is not
detectable by anything that happens-after. So to determine that A will
actually happen before B you have to show that A happening after B would be
detectable by something that happens-after, and so the reordering would not
JavaMemoryModel mailing list - http://www.cs.umd.edu/~pugh/java/memoryModel
This archive was generated by hypermail 2b29 : Thu Oct 13 2005 - 07:01:04 EDT