Re:Turing Lecture: The Computer Science of Concurrency – The...
by yshalabi on Saturday June 06, 2015 @11:55AM
(#9671198)
It comes down to how you define correctness. Weaker consistency requirements accept executions that do not serialize processor orderings allowing for algorithms like bakery to work without strong atomic operations.
[ Parent
| on HN ]
There are no comments on this comment yet.