2011•arXiv (Cornell University)Open access

Linearizable Implementations Do Not Suffice for Randomized Distributed\n Computation

Wojciech Golab, Lisa Highám, Philipp Woelfel

Abstract

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

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Correctness, Linearizability, Computer science, Implementation, Computation, Exploit, Theoretical computer science, Algorithm