Skip to main content

General protocols for consensus in distributed systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 978))

Abstract

In distributed applications, a group of processes have to make consensus to do the cooperation. If the processes take the same value by exchanging the values taken by the processes, the consensus is obtained. It is important to consider what values the process can take after taking a value. In this paper, we define a dominant relation ≺ to denote this precedence relation among the values. Based on ≺, we present four steps of the general consensus protocol, i.e. pre-voting, voting, global decision, and final local decision. Here, the process can change the mind after notifying other processes of the opinion, and various kinds of global decision logics and control schemes can be adopted.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barborak, M., Malek, M., and Dahbura, A., “The Consensus Problem in Fault-Tolerant Computing,” ACM Computing Surveys, Vol. 25, No.2, 1993, pp. 182–184,198–199.

    Google Scholar 

  2. Bernstein, P. A., Hadzilacos, V., and Goodman, N., “Concurrency Control and Recovery in Database Systems,” Addison-Wesley Publishing Company, 1987, pp.222–261.

    Google Scholar 

  3. Birman, K. P., Schiper, A., and Stephenson, P., “Lightweight Causal and Atomic Group Multicast,” ACM Trans. on Computer Systems, Vol. 9, No.3, 1991, pp. 272–314.

    Google Scholar 

  4. Ellis, C. A., Gibbs, S. J., and Rein, G. L., “Groupware,” Comm. ACM, Vol. 34, No. 1, 1991, pp. 38–58.

    Google Scholar 

  5. Fischer, J. M., Lynch, A. N., and Paterson, S. M., “Impossibility of Distributed Consensus with One Faulty Process,” Journal of ACM, Vol. 32, No.2, 1985, pp. 374–382.

    MathSciNet  Google Scholar 

  6. Gray, J., “Notes on Database Operating Systems, An Advanced Course,” Lecture Notes in Computer Science, No.60, 1978, pp. 393–481.

    Google Scholar 

  7. Lamport, L., “Time, Clocks, and the Ordering of Events in a Distributed System,” Comm. ACM, Vol. 21, No.7, 1978, pp. 558–565.

    MATH  Google Scholar 

  8. Lamport, L. and Shostak, R., “The Bysantine Generals Problem,” ACM-Trans.Programming Languages and Systems, Vol. 4, No3, 1982, pp. 382–401.

    Google Scholar 

  9. Ozsu, M. T. and Valduriez, P., “Principle of Distributed Database Systems,” Prentice-Hall, 1990.

    Google Scholar 

  10. Skeen, D. and Stonebraker, M., “A Formal Model of Crash Recovery in a Distributed System,” IEEE Computer Society Press, Vol. SE-9, No.3, 1983, pp. 219–228.

    Google Scholar 

  11. Turek, J. and Shasha, D., “The Many Faces of Consensus in Distributed Systems,” Distributed Computing Systems, IEEE Computer Society Press, 1994, pp.83–91.

    Google Scholar 

  12. Yahata, C., Sakai, J., and Takizawa, M., “Generalization of Consensus Protocols,” Proc. of the 9th IEEE Int'l Conf. on Information Networking (ICOIN-9), 1994, pp.419–424.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Norman Revell A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yahata, C., Takizawa, M. (1995). General protocols for consensus in distributed systems. In: Revell, N., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1995. Lecture Notes in Computer Science, vol 978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049121

Download citation

  • DOI: https://doi.org/10.1007/BFb0049121

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60303-0

  • Online ISBN: 978-3-540-44790-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics