Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts (1997) [36 citations — 9 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Lynch97robustemulation,author = {Nancy Lynch and Alex Shvartsman},
title = {Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts},
booktitle = {In Symposium on Fault-Tolerant Computing},
year = {1997},
pages = {272--281},
publisher = {IEEE}
}
Years of Citing Articles
Abstract:
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum configurations. In addition to processor and link failures, this emulation tolerates changes in quorum configurations, i.e., on-line replacements of one quorum system consisting of read and write quorums with another such system. This work extends the results of Attiya, Bar-Noy and Dolev [1] who showed how to emulate single-writer/multi-reader registers robustly in message-passing systems using majorities. The emulation in this paper is specified using a modular two-layer architecture. The lower layer uses unreliable broadcast to disseminate a request from the higher layer to a set of processors, and then to collect responses from a subset of the processors. The subset can be specified by a predicate or by using a quorum system. The lower layer then computes a function on the collected responses and returns the result to the higher layer. The broadcast can take advantage of hardware-assisted broadcast as we do not assume that the broadcast is reliable or that it has fifo, causal or atomic properties. The higher layer algorithm emulates robust multi-writer/multi-reader registers where quorum configurations are used to ensure that the registers are atomic.
