Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
暂无分享,去创建一个
[1] Sam Toueg,et al. Unreliable failure detectors for asynchronous systems (preliminary version) , 1991, PODC '91.
[2] Maurice Herlihy,et al. Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.
[3] David S. Greenberg,et al. Computing with faulty shared memory , 1992, PODC '92.
[4] Sam Toueg,et al. Unreliable Failure Detectors for Asynchronous Systems , 1991 .
[5] Maurice Herlihy,et al. On the space complexity of randomized synchronization , 1993, PODC '93.
[6] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[7] Sam Toueg,et al. The weakest failure detector for solving consensus , 1996, JACM.
[8] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[9] Nir Shavit,et al. Atomic snapshots of shared memory , 1990, JACM.
[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] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[12] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.