Fault-Tolerant Critical Section Management in Asynchronous Networks

The topic of the paper is managing a fault-tolerant critical section in a completely asynchronous distributed network. Assume that processors may fail while using the critical section and therefore the critical section must have at least t+1 slots. (t is the maximum number of possible faulty processors).

[1]  Allan Borodin,et al.  Resource allocation with immunity to limited process failure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Hagit Attiya,et al.  Achievable cases in an asynchronous environment , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[4]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

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

[6]  Ronald J. Watro,et al.  Fault-tolerant decision making in totally asynchronous distributed systems , 1987, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[7]  Shmuel Zaks,et al.  A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor , 1988, PODC '88.

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

[9]  Nir Shavit,et al.  Toward a non-atomic era: l-exclusion as a test case , 1988, STOC '88.