Skip to main content
SpringerLink
Log in

A more committed quorum-based three phase commit protocol

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Computing (DISC 1998)

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

Included in the following conference series:

Abstract

In the original quorum-based three phase commit (Q3PC) protocol, a quorum of sites may form after failure, yet those sites remain blocked. Recently, Keidar and Dolev introduced the Enhanced 3PC (E3PC) protocol, in which a quorum never blocks. However E3PC tends to decide to abort transactions in many of those quorate failure sequences where Q3PC would block. We use the concept of “views” to analyse protocols. This allows us to construct an improved version of E3PC which can make progress towards committing a transaction during recovery in circumstances where E3PC would abort. Our new protocol shares with E3PC the property that a quorum never blocks.

This research was supported by EPSRC grant GR/L74798.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T.D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Dolev, R. Friedman, I. Keidar, and D. Malkhi. Failure detectors in omission failure environments. T.R. 96-1608, Dept. of Computer Science, Cornell University, September 1996.

    Google Scholar 

  3. H. Garcia-Molina. Elections in a Distributed Computing System. IEEE Transactions on Computers, 31(1):48–59, January 1982.

    Google Scholar 

  4. R. Guerraoui. Revisiting the relationship between non-blocking atomic commitment and consensus. In J.-M. Helary and M. Raynal, editors, Proceedings of the 9th International Workshop on Distributed Algorithms, pages 87–100. Springer Verlag, 1995.

    Google Scholar 

  5. I. Keidar and D. Dolev. Increasing the resilience of atomic commit, at no additional cost. In Proc. of the 14th ACM PoDs, pages 245–254, May 1995.

    Google Scholar 

  6. D. Skeen. A Quorum Based Commit Protocol. Berkeley Workshop on Distributed Data Management and Computer Networks, (6):69–80, February 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, Scotland

    Tim Kempster, Colin Stirling & Peter Thanisch

Authors
  1. Tim Kempster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Thanisch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempster, T., Stirling, C., Thanisch, P. (1998). A more committed quorum-based three phase commit protocol. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056487

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation