DMCA
Fault-tolerant semifast implementations for atomic read/write registers (2005)
| Citations: | 14 - 4 self |
BibTeX
@MISC{Georgiou05fault-tolerantsemifast,
author = {Chryssis Georgiou and Nicolas C. Nicolaou and Alexander A. Shvartsman},
title = {Fault-tolerant semifast implementations for atomic read/write registers},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up to t servers may crash. A recent result of Dutta et al. [3] shows how to obtain fast implementations in which both reads and writes complete in one communication round-trip, under the constraint that the number of readers is less than S t − 2, where t < S 2. In that same paper the authors pose a question of whether it is possible to relax the bound on readers, and at what cost, if semifast implementations are considered, i.e.,
