Fault-tolerant wait-free shared objects

The authors classify object failures into two broad categories: responsive and non-responsive. They require that wait-free objects subject to responsive failures continue to respond (in finite time) to operation invocations. The responses may be incorrect. In contrast, wait-free objects subject to non-responsive failures are exempt from responding to operation invocations. Such objects may 'hang' on the invoking process. They divide responsive failures into three models: R-crash,R-omission, and R-arbitrary. They divide non-responsive failures into crash, omission, and arbitrary. An object subject to crash failure behaves correctly until it fails, and once it fails, it never responds to operation invocations. An object subject to omission failures may fail to respond to the invocations of an arbitrary subset of processes, but continue to respond to the invocations of the remaining processes (forever).<<ETX>>

[1]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[2]  Gary L. Peterson,et al.  Concurrent reading while writing II: The multi-writer case , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[4]  Gary L. Peterson,et al.  Concurrent Reading While Writing , 1983, TOPL.

[5]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[6]  Jon M. Kleinberg,et al.  Resource bounds and combinations of consensus objects , 1993, PODC '93.

[7]  Piotr Berman,et al.  Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Krishnamurthy Vidyasankar.  Converting Lamport's Regular Register to Atomic Register , 1988, Inf. Process. Lett..

[9]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[10]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  David S. Greenberg,et al.  Computing with faulty shared memory , 1992, PODC '92.

[12]  Sam Toueg,et al.  Some Results on the Impossibility, Universality, and Decidability of Consensus , 1992, WDAG.

[13]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[14]  Serge A. Plotkin.  Sticky bits and universality of consensus , 1989, PODC '89.

[15]  Brian A. Coan,et al.  Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity , 1992, Inf. Comput..

[16]  Leslie Lamport,et al.  The Implementation of Reliable Distributed Multiprocess Systems , 1978, Comput. Networks.

[17]  Leslie Lamport,et al.  Concurrent reading and writing , 1977, Commun. ACM.

[18]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[19]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[20]  Gil Neiger,et al.  Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.

[21]  Ambuj K. Singh,et al.  The elusive atomic register revisited , 1987, PODC '87.

[22]  Gary L. Peterson.  A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables , 1983, TOPL.

[23]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  Richard Newman-Wolfe,et al.  A protocol for wait-free, atomic, multi-reader shared variables , 1987, PODC '87.

[25]  Brian A. Coan,et al.  Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations , 1987 .

[26]  James Aspnes,et al.  Time-and space-efficient randomized consensus , 1990, PODC '90.

[27]  Krishnamurthy Vidyasankar,et al.  An Elegant 1-Writer Multireader Multivalued Atomic Register , 1989, Inf. Process. Lett..

[28]  Bard Bloom,et al.  Constructing two-writer atomic registers , 1987, PODC '87.

[29]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[30]  Jennifer L. Welch,et al.  Bounds on the Costs of Register Implementations , 1991, WDAG.