A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
2008
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08
This paper studies a trade-off between fault-tolerance and latency in implementations of atomic read/write objects in message-passing systems. In particular, considering fast or semifast quorum-based implementations, that is, implementations where all or respectively most read and write operations complete in a single communication round-trip, it is shown that such implementations are not robust due to the fact that they necessarily require a quorum system with a common intersection between its
doi:10.1145/1400751.1400817
dblp:conf/podc/GeorgiouNS08
fatcat:3e4tfuzq2nfvrjmt5qeit4ccuu