Using knowledge to optimally achieve coordination in distributed systems

Theoretical Computer Science

Volumn 220, Issue 1, 1999, Pages 31-65

  Neiger, Gil ^a   Bazzi, Rida A ^b  

^a INTEL CORPORATION   (United States)

^b Arizona State University   (United States)

Author keywords

Common knowledge; Distributed coordination; Knowledge; Optimal algorithms; Optimum algorithms

Indexed keywords

EID: 0009734557     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00236-9     Document Type: Article

References (20)

1. R.A. Bazzi, G. Neiger, The complexity and impossibility of achieving fault-tolerant coordination, in: Proc. 11th ACM Symp. on Principles of Distributed Computing, ACM, New York, 1992, pp. 203-214.
2. B.A. Coan, A communication-efficient canonical form for fault-tolerant distributed protocols, in: Proc. 5th ACM Symp. on Principles of Distributed Computing, August 1986, pp. 63-72. A revised version appears in Coan's Ph.D. dissertation [3].
3. B.A. Coan, Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations, Ph.D. dissertation, Massachusetts Institute of Technology, June 1987.
4. D. Dolev, R. Reischuk, H. Raymond Strong, Eventual is earlier than immediate, in: Proc. 23rd Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, 1982, pp. 196-203.
5. C. Dwork, Y. Moses, Knowledge and common knowledge in a Byzantine environment: crash failures, Inform. and Comput. 88 (2) (1990) 156-186.
6. R. Fagin, J.Y. Halpern, Y. Moses, M.Y. Vardi, Reasoning about Knowledge, MIT Press, Cambridge, MA, 1995.
7. R. Fagin, M.Y. Vardi, Knowledge and implicit knowledge in a distributed environment: preliminary report, in: J.Y. Halpern (Ed.), Proc. 1st Conf. on Theoretical Aspects of Reasoning about Knowledge, Morgan-Kaufmann, LosAltos, CA, 1986, pp. 187-206. Also appears as Technical Report RJ4990, IBM Research Laboratory.
8. M.J. Fischer, The consensus problem in unreliable distributed systems (a brief survey), in: M. Karpinsky (Ed.), Foundations of Computation Theory, Lecture Notes on Computer Science, vol. 158, Springer, Berlin, 1983, pp.127-140.
9. M.J. Fischer, N.A. Lynch, A lower bound for the time to assure interactive consistency, Inform. Process. Lett. 14, 1982, pp. 183-186.
10. M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of distributed consensus with one faulty process, J. ACM 32 (2) (1985) pp. 374-382.
11. A. Gopal, S. Toueg, Reliable broadcast in synchronous and asynchronous environments, in: J.-C. Bermond, M. Raynal (Eds.), Proc. 3rd Internat. Workshop on Distributed Algorithms, Lecture Notes on Computer Science, vol. 392, Springer, Berlin, 1989, pp. 110-123.
12. V. Hadzilacos, Issues of Fault Tolerance in Concurrent Computations, Ph.D. dissertation, Harvard University, 1984.
13. J.Y. Halpern, Y. Moses, Knowledge and common knowledge in a distributed environment, J. ACM 37 (3) (1990) pp. 549-587.
14. J.Y. Halpern, Y. Moses, O. Waarts, A characterization of eventual Byzantine agreement, in: Proc. 9th ACM Symp. on Principles of Distributed Computing, ACM, New York, 1990, pp. 333-346.
15. R. Michel, Knowledge in distributed byzantine environments, Ph.D. dissertation, Yale University, New Hoven, 1989.
16. Y. Moses, M.R. Tuttle, Programming simultaneous actions using common knowledge, Algorithmica 3 (1) (1988) 121-169.
17. G. Neiger, S. Toueg, Automatically increasing the fault-tolerance of distributed algorithms, J. Algorithms 11 (3) (1990) 374-419.
18. G. Neiger, M.R. Tuttle, Common knowledge and consistent simultaneous coordination, Distrib. Comput. 6 (3) (1993) 181-192.
19. M. Pease, R. Shostak, L. Lamport, Reaching agreement in the presence of faults, J. ACM 27 (2) (1980) 228-234.
20. M.R. Tuttle, A game-theoretic characterization of eventual common knowledge, Unpublished manuscript, October 1988.