Tight Failure Detection Bounds on Atomic Object Implementations

• Published in: Journal of the ACM, vol. 57, num. 4, p. 21
• Publication date: 2010

This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.

Keywords: algorithms ; theory ; reliability

Reference

• EPFL-ARTICLE-149299
• doi:10.1145/1734213.1734216
• View record in Web of Science

Record created on 2010-06-11, modified on 2012-03-21