Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

  • Dan Alistarh
  • Seth Gilbert
  • Rachid Guerraoui
  • Corentin Travers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5878)


Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. The complexity of set agreement in synchronous networks has also been a significant research challenge. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony.

In this paper, we analyze the complexity of set agreement in a “partially synchronous” setting, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone messagepassing system in which some fragments appear synchronous to some processes. We use this technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. We also present an asymptotically matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony.

By relating environments with differing degrees of synchrony, our simulation technique is of independent interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of [12], and to re-derive the combinatorial topology lower bound of [13] in an algorithmic way.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)zbMATHCrossRefGoogle Scholar
  2. 2.
    Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Of choices, failures and asynchrony: The many faces of set agreement. Technical report,
  3. 3.
    Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: How to solve consensus in the smallest window of synchrony. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 32–46. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Attiya, H., Rachman, O.: Atomic snapshots in o(n logn) operations. SIAM J. Comput. 27(2), 319–340 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91–100 (1993)Google Scholar
  6. 6.
    Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132–158 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: A tight lower bound for k-set agreement. In: FOCS, pp. 206–215. IEEE, Los Alamitos (1993)Google Scholar
  8. 8.
    Dutta, P., Guerraoui, R.: The inherent price of indulgence. Distributed Computing 18(1), 85–98 (2005)CrossRefGoogle Scholar
  9. 9.
    Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288–323 (1988)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Gafni, E.: Round-by-round fault detectors: Unifying synchrony and asynchrony (extended abstract). In: PODC, pp. 143–152 (1998)Google Scholar
  11. 11.
    Gafni, E.: The Extended BG simulation and the characterization of t-resiliency. In: STOC (2009)Google Scholar
  12. 12.
    Gafni, E., Guerraoui, R., Pochon, B.: From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. In: STOC, pp. 714–722 (2005)Google Scholar
  13. 13.
    Guerraoui, R., Herlihy, M.P., Pochon, B.: A topological treatment of early-deciding set-agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 20–35. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Keidar, I., Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: PODC, pp. 169–178 (2006)Google Scholar
  16. 16.
    Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ToPLaS 4(3), 382–401 (1982)zbMATHCrossRefGoogle Scholar
  17. 17.
    Saks, M.E., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput. 29(5), 1449–1483 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Yang, J., Neiger, G., Gafni, E.: Structured derivations of consensus algorithms for failure detectors. In: PODC, pp. 297–308 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dan Alistarh
    • 1
  • Seth Gilbert
    • 1
  • Rachid Guerraoui
    • 1
  • Corentin Travers
    • 2
  1. 1.Swiss Federal Institute of TechnologyLausanneSwitzerland
  2. 2.TechnionHaifaIsrael

Personalised recommendations