Constructing a Reliable Test&Set Bit

The problem of computing with faulty shared bits is addressed. The focus is on constructing a reliable tests and the constructed bit behaves as intended if the number of component bits which fail does not exceed that bound. Several efficient constructions are presented, and bounds on the space required are given. Our constructions for omission faults also apply to other fault models.

[1]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[2]  David S. Greenberg,et al.  Computing with faulty shared objects , 1995, JACM.

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

[4]  Michael J. Fischer,et al.  The Wakeup Problem , 1996, SIAM J. Comput..

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

[6]  Sam Toueg,et al.  Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[8]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[9]  Yehuda Afek,et al.  Benign Failure Models for Shared Memory (Preliminary Version) , 1993, WDAG.