1
$\begingroup$

as far as I understood one wants that an algorithm produces only results that can be also achieved by a sequentially consistent execution.

My question is whether this is true or whether there are correct algorithms that have results that can be only achieved by sequentially inconsistent executions?

$\endgroup$
1
  • $\begingroup$ This comment is only loosely related to your problem. In the field of distributed shared memory, there are various read/write objects with different consistency conditions. The solutions to mutual exclusion problem are different when you use different read/write objects. However, I think the solution with weak objects is still correct when you replace them with strong ones. The reverse is not necessarily right. $\endgroup$
    – hengxin
    Commented Nov 1, 2013 at 2:02

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.