Michael J. Fischer
Nancy A. Lynch
Michael Merritt
- A.D. Angluin, "Local and Global Properties in Networks of Processors," Proc. of the 12th STOC, April 30-May 2, 1980, Los Angeles, CA., pp. 82-93. Google Scholar
Digital Library
- B.J. Bums, "A Formal Model for Message Passing Systems," TR-91, Indiana University, September 1980.Google Scholar
- BL.J. Burns, N. Lynch "Tile Byzantine Firing Squad Problem," submitted for publication.Google Scholar
- CDDS.B. Coan, D. Dolev, C. Dwork and L. Stockmeyer "The Distributed Firing Squad Problem," Proc. of the 17th STOC, May 6-8, 1985, Providence R.I. Google ScholarDigital Library
- D.D. l)olcv. "The Byzantine Gencrals Strike Again," Journal of Algorithms, 3, 1982, pp. 14-30.Google ScholarCross Ref
- DHS.D. Dolev, J. Halpern, H. Strong, "On tile Possibility and impossibility of Achieving Clock Synchronization," Proc. of the 16th STOC, April 30- May 2, 1984, Washington, D.C., pp. 504-510. Google ScholarDigital Library
- DLPSW.D. Dolev, N. A. Lynch, S. Pinter, E. Stark and W. Weihl, "Reaching Approximate Agreement in the Presence of Faults," Proc. of the 3rd Annual IEEE Syrup. on Distributed Sofware and Databases, 1983.Google Scholar
- IR.A. Itai, M. Rodeh, "The Lord of the Ring or Probabilistic Methods for Breaking Symmetry in Distributive Networks," RJ-3110, IBM Research Report, April 1981.Google Scholar
- L.L. Lamport, "The Weak Byzantine Generals Problem", JACM, 30,1983, pp. 668-676. Google ScholarDigital Library
- LSP.L. Lamport, R. Shostak, M. Pease, "~'he Byzantine Generals Problem," ACM Trans. on Programming Lang. and Systems 4, 3 (July 1982), 382-401. Google ScholarDigital Library
- MS.S. Mahaney, F. Schneider ,"Inexact Agreement: Accuracy, Precision, and Graceful Degradation," Proc. of the 4th Annual ACM Symposium on Principles of Distributed Computing August 5-7, 1985, Minacki, Ontario. Google ScholarDigital Library
- PSL.M. Pease, R. Shostak, L. I.amport, "Reaching Agreement in the Presence of Faults," JACM 27:2 1980, 228-234. Google ScholarDigital Library
Index Terms
- Easy impossibility proofs for distributed consensus problems
Recommendations
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11: Proceedings of the 15th international conference on Principles of Distributed SystemsDespite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively ...
The gap in circumventing the impossibility of consensus
The impossibility of reaching deterministic consensus in an asynchronous and crash prone system was established for a weak variant of the problem, usually called weak consensus, where a set of processes need to decide on a common value in {0,1}, so that ...
Easy impossibility proofs for k-set agreement in message passing systems
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Comments