Loading...
research article
Tight Failure Detection Bounds on Atomic Object Implementations
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.
Loading...
Name
p1-Gallet.pdf
Access type
openaccess
Size
584.08 KB
Format
Adobe PDF
Checksum (MD5)
0f4a6549d6a38d3188415117f5ba7d10