Linearizable Implementations Do Not Suffice for Randomized Distributed Computation

Details Linearizable Implementations Do Not Suffice for Randomized Distributed Computation Linearizable Implementations Do Not Suffice for Randomized Distributed Computation

2011-03-24

arxiv.org/abs/1103.4690v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the corresponding algorithm using atomic versions of the same objects. We show that linearizability does not suffice for this purpose when processes can exploit randomization, and we discuss the existence of alternative correctness conditions.

Affiliated with

Also associated with

No associations

Rating

Linearizable Implementations Do Not Suffice for Randomized Distributed Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linearizable Implementations Do Not Suffice for Randomized Distributed Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linearizable Implementations Do Not Suffice for Randomized Distributed Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47168