Skip to main content
SpringerLink
Log in

Conditions for Set Agreement with an Application to Synchronous Systems

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The k-set agreement problem is a generalization of the consensus problem: considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. While this problem cannot be solved in an asynchronous system prone to t process crashes when t ≥ k, it can always be solved in a synchronous system; \( \left\lfloor {\frac{t}{k}} \right\rfloor + 1 \) is then a lower bound on the number of rounds (consecutive communication steps) for the non-faulty processes to decide. The condition-based approach has been introduced in the consensus context. Its aim was to both circumvent the consensus impossibility in asynchronous systems, and allow for more efficient consensus algorithms in synchronous systems. This paper addresses the condition-based approach in the context of the k-set agreement problem. It has two main contributions. The first is the definition of a framework that allows defining conditions suited to the k-set agreement problem and the second is a generic synchronous k-set agreement algorithm based on conditions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fischer M J, Lynch N A, Paterson M S. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 1985, 32(2): 374–382.

    Article  MATH  MathSciNet  Google Scholar 

  2. Loui M C, Abu-Amara H H. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Parallel and Distributed Computing: Vol.4 of Advances in Computing Research, JAI Press, 1987, 4: 163–183.

  3. Mostefaoui A, Rajsbaum S, Raynal M. Conditions on input vectors for consensus solvability in asynchronous distributed systems. Journal of the ACM, 2003, 50(6): 922–954.

    Article  MathSciNet  Google Scholar 

  4. Friedman R, Mostéfaoui A, S Rajsbaum S, Raynal M. Asynchronous agreement and its relation with error-correcting codes. IEEE Trans. Computers, 2007, 56(7): 865–876.

    Article  Google Scholar 

  5. Izumi T, Masuzawa T. Condition adaptation in synchronous consensus. IEEE Trans. Computers, 2006, 55(7): 843–853.

    Article  Google Scholar 

  6. Izumi T, Masuzawa T. A weakly adaptive condition-based consensus algorithm in asynchronous distributed systems. Information Processing Letters, 2006, 100(5): 199–205.

    Article  MathSciNet  Google Scholar 

  7. Mostefaoui A, Rajsbaum S, Raynal M. Synchronous condition-based consensus. Distributed Computing, 2006, 18(5): 325–343.

    Article  Google Scholar 

  8. Mostefaoui A, Rajsbaum S, Raynal M, Roy M. Condition-based consensus solvability: A hierarchy of conditions and efficient protocols. Distributed Computing, 2004, 17: 1–20.

    Article  Google Scholar 

  9. Zibin Y. Condition-based consensus in synchronous systems. In Proc. the 17th Int. Symposium on Distributed Computing, LNCS 2848, Springer-Verlag, Sorrento, Italy, Oct. 1–3, 2003, pp.239–248.

  10. Aguilera M K, Toueg S. A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Information Processing Letters, 1999, 71: 155–178.

    Article  MATH  MathSciNet  Google Scholar 

  11. Fischer M J, Lynch N. A lower bound for the time to assure interactive consistency. Information Processing Letters, 1982, 71: 183–186.

    Google Scholar 

  12. Chaudhuri S. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 1993, 105: 132–158.

    Article  MATH  MathSciNet  Google Scholar 

  13. Borowsky E, Gafni E. Generalized FLP impossibility results for t-resilient asynchronous computations. In Proc. the 25 th ACM Symposium on the Theory of Computing (STOC'93), San Diego, USA, ACM Press, June 7–14, 1993, pp.91–100.

  14. Herlihy M P, Shavit N. The topological structure of asynchronous computability. Journal of the ACM, 1999, 46(6): 858–923.

    Article  MATH  MathSciNet  Google Scholar 

  15. Saks M, Zaharoglou F. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing, 2000, 29(5): 1449–1483.

    Article  MATH  MathSciNet  Google Scholar 

  16. Chaudhuri S, Herlihy M, Lynch N, Tuttle M. Tight bounds for k-set agreement. Journal of the ACM, 2000, 47(5): 912–943.

    Article  MathSciNet  Google Scholar 

  17. Attiya H, Avidor Z. Wait-free n-set consensus when inputs are restricted. In Proc. the 16th Int. Symposium on Distributed Computing (DISC'02), Toulouse, France, LNCS 2508, Springer Verlag, Oct. 28–30, 2002, pp.326–338.

  18. Mostefaoui A, Rajsbaum S, Raynal M, Roy M. Condition-based protocols for set agreement problems. In Proc. the 16th Int. Symposium on Distributed Computing (DISC'02), Toulouse, France, LNCS 2508, Springer Verlag, Oct. 28–30, 2002, pp.46–62.

  19. Mostefaoui A, Rajsbaum S, Raynal M. The combined power of conditions and failure detectors to solve asynchronous set agreement. In Proc. the 24th ACM Symposium on Principles of Distributed Computing (PODC'05), Las Vegas, USA, ACM Press, July 17–20, 2005, pp.179–188.

  20. Attiya H, Welch J. Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 1998, p.451.

  21. Lynch N A. Distributed Algorithms. San Fransisco: Morgan Kaufmann Pub., USA, 1996, 872 pages.

  22. Raynal M. Consensus in synchronous systems: A concise guided tour. In Proc. the 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC'02), Tsukuba, Japan, IEEE Computer Press, Dec. 16–18, 2002, pp.221–228.

  23. Afek Y, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N. Atomic snapshots of shared memory. Journal of the ACM, 1993, 40(4): 873–890.

    Article  MATH  Google Scholar 

  24. Dolev D, Reischuk R, Strong R. Early stopping in Byzantine agreement. Journal of the ACM, April 1990, 37(4): 720–741.

    Article  MATH  MathSciNet  Google Scholar 

  25. Keidar I, Rajsbaum S. A simple proof of the uniform consensus synchronous lower bound. Information Processing Letters, 2003, 85: 47–52.

    Article  MATH  MathSciNet  Google Scholar 

  26. Moses Y, Rajsbaum S. A layered analysis of consensus. SIAM Journal of Computing, 2002, 31(4): 989–1021.

    Article  MATH  MathSciNet  Google Scholar 

  27. Gafni E, Guerraoui R, Pochon B. From a static impossibility to an adaptive lower bound: The complexity of early deciding set agreement. In Proc. the 37th ACM Symposium on Theory of Computing (STOC'05), Baltimore, USA, May 22–24, 2005, pp.714–722.

  28. Raïpin Parvédy Ph, Raynal M, Travers C. Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures. In Proc. the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), Chester, UK, LNCS 4056, Springer-Verlag, July 3–5, 2006, pp.182–196.

  29. Raynal M, Travers C. Synchronous set agreement: A concise guided tour (including a new algorithm and a list of open problems). In Proc. the 12th Int. IEEE Pacific Rim Dependable Computing Symposium (PRDC'2006), IEEE Society Computer Press, Riverside, USA, Dec. 18–20, 2006, pp.267–274.

Download references

Author information

Authors and Affiliations

  1. IRISA, University of Rennes, 35042, Rennes Cedex, France

    François Bonnet & Michel Raynal

Authors
  1. François Bonnet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to François Bonnet.

Additional information

This work was supported by the European Network of Excellence ReSIST.

A previous version of this paper has appeared in the Proceedings of the 28th IEEE Int. Conference on Distributed Computing Systems (ICDCS'08), June 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonnet, F., Raynal, M. Conditions for Set Agreement with an Application to Synchronous Systems. J. Comput. Sci. Technol. 24, 418–433 (2009). https://doi.org/10.1007/s11390-009-9234-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9234-3

Keywords

Search

Navigation