Common knowledge and consistent simultaneous coordination

  • Gil Neiger
  • Mark R. Tuttle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)

Abstract

Traditional problems in distributed systems include the Reliable Broadcast, Distributed Consensus, and Distributed Firing Squad problems. These problems require coordination only among the processors that do not fail. In systems with benign processor failures, however, it is reasonable to require that a faulty processor's actions are consistent with those of nonfaulty processors, assuming that it performs any action at all. We consider problems requiring consistent, simultaneous coordination and analyze these problems in terms of common knowledge. (Others have performed similar analyses of traditional coordination problems [1,9].) In several failure models, we use our analysis to give round-optimal solutions. In one benign failure model, however, we show that such problems cannot be solved, even in failure-free executions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2):156–186, October 1990.Google Scholar
  2. [2]
    Ajei Gopal and Sam Toueg. Reliable broadcast in synchronous and asynchronous environments (preliminary version). In J.-C. Bermond and M. Raynal, editors, Proceedings of the Third International Workshop on Distributed Algorithms, volume 392 of Lecture Notes on Computer Science, pages 110–123. Springer-Verlag, September 1989.Google Scholar
  3. [3]
    Vassos Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. Ph.D. dissertation, Harvard University, June 1984. Department of Computer Science Technical Report 11–84.Google Scholar
  4. [4]
    Joseph Y. Halpern and Yoram Moses. A guide to the modal logic of knowledge and belief. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 480–490. Morgan-Kaufmann, August 1985.Google Scholar
  5. [5]
    Joseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549–587, July 1990.Google Scholar
  6. [6]
    Joseph Y. Halpern, Yoram Moses, and Orli Waarts. A characterization of eventual Byzantine agreement. In Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing, pages 333–346, August 1990.Google Scholar
  7. [7]
    Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.Google Scholar
  8. [8]
    C. Mohan, R. Strong, and S. Finkelstein. Methods for distributed transaction commit and recovery using Byzantine agreement within clusters of processors. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 89–103, August 1983.Google Scholar
  9. [9]
    Yoram Moses and Mark R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3(1):121–169, 1988.Google Scholar
  10. [10]
    Gil Neiger. Using knowledge to achieve consistent coordination in distributed systems. In preparation, July 1990.Google Scholar
  11. [11]
    Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374–419, September 1990.Google Scholar
  12. [12]
    M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, April 1980.Google Scholar
  13. [13]
    Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477–482, March 1986.Google Scholar
  14. [14]
    Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222–238, August 1983.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Gil Neiger
    • 1
  • Mark R. Tuttle
    • 2
  1. 1.College of Computing Georgia Institute of TechnologyAtlanta
  2. 2.DEC Cambridge Research LabCambridge

Personalised recommendations