Fault-tolerant semifast implementations of atomic read/write registers

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., implementations that have fast reads or fast writes. This paper provides an answer to this question. It is shown that one can obtain implementations where all writes are fast, i.e., involving a single communication round-trip, and where reads complete in one to...

• Type: Conference
• Year: 2006
• Where: SPAA
• Authors: Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
• Keywords: Communication Round-trip, Distributed And Parallel Computing, Semifast Implementation, SPAA 2006, Time-efficient Implementations