Show simple item record

dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorNicolaou, Nicolas C.en
dc.contributor.authorShvartsman, A. A.en
dc.creatorGeorgiou, Chryssisen
dc.creatorNicolaou, Nicolas C.en
dc.creatorShvartsman, A. A.en
dc.description.abstractThis 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 round-trip communication, and where reads complete in one to two communication rounds under the assumption that no more than S <S/2 f servers crash. Simulated scenarios included in this paper indicate that only a small fraction of reads require a second communication round. Interestingly the correctness of the implementation does not depend on the number of concurrent readers in the system. The solution is obtained with the help of non-unique virtual ids assigned to each reader, where the readers sharing a virtual id form a virtual node. For the proposed definition of semifast implementations it is shown that implementations satisfying certain assumptions are semifast if and only if the number of virtual ids in the system is less than 7 -2. This result is proved to be tight in terms of the required communication. It is shown that only a single complete two-round read operation may be necessary for each write operation. It is furthermore shown that no semifast implementation exists for the multi-reader, multi-writer model. Copyright 2006 ACM.en
dc.sourceAnnual ACM Symposium on Parallelism in Algorithms and Architecturesen
dc.sourceSPAA 2006: 18th Annual ACM Symposium on Parallelism in Algorithms and Architecturesen
dc.subjectMathematical modelsen
dc.subjectDistributed computer systemsen
dc.subjectSet theoryen
dc.subjectFault tolerant computer systemsen
dc.subjectDistributed algorithmsen
dc.subjectVirtual realityen
dc.subjectRead/Write registersen
dc.subjectCommunication roundsen
dc.subjectCommunication round tripen
dc.subjectMultiwriter modelsen
dc.titleFault-tolerant semi fast implementations of atomic read/write registersen
dc.description.endingpage290 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: ACM SIGACTen
dc.description.notesACM SIGARCHen
dc.description.notesConference code: 68299en
dc.description.notesCited By :3</p>en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record