Skip to main content
SpringerLink
Log in

On Conspiracies and Hyperfairness in Distributed Computing

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

Abstract

We study the phenomenon of conspiracies, a certain class of livelocks, in distributed computations. This elementary phenomenon occurs in systems with shared variables, shared actions as well as in message-passing systems. We propose a new and simple characterization via a new notion of hyperfairness, which postulates the absence of conspiracies. We argue that hyperfairness is a useful tool for understanding some impossibility results, in particular results involving crash-tolerance. As a main result, we show that a large subclass of hyperfairness can be implemented through partial synchrony and randomization.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Attie, P.C., Francez, N., Grumberg, O.: Fairness and hyperfairness in multi-party interactions. Distributed Computing 6, 245–254 (1993)

    Article  MATH  Google Scholar 

  2. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. 2nd PODC, pp. 27–30. ACM, New York (1983)

    Google Scholar 

  3. Best, E.: Fairness and conspiracies. In: IPL, vol. 18, pp. 215–220 (1984) Erratum ibidem 19:162

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)

    MATH  Google Scholar 

  6. Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)

    Article  MathSciNet  Google Scholar 

  7. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Francez, N., Back, R.-J.J., Kurki-Suonio, R.: On equivalence-completions of fairness assumptions. Formal Aspects of Computing 4, 582–591 (1992)

    Article  MATH  Google Scholar 

  10. Herlihy, M.: Wait-free synchronization. ACM ToPLaS 11(1), 124–149 (1991)

    Article  Google Scholar 

  11. Joung, Y.-J.: Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. Theor. Comput. Sci. 243(1-2), 307–338 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Joung, Y.-J.: On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation 166, 1–34 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Joung, Y.-J.: On fairness notions in distributed systems, part II: Equivalence-completions and their hierarchies. Information and Computation 166, 35–60 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kwong, Y.: On the absence of livelocks in parallel programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 172–190. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  15. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  16. Lamport, L.: Fairness and hyperfairness. Distributed Computing 13(4), 239–245 (2000)

    Article  Google Scholar 

  17. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193. Springer, Heidelberg (1985)

    Google Scholar 

  18. Merceron, A.: Fair processes. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266. Springer, Heidelberg (1987)

    Google Scholar 

  19. Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proc. 15th STOC, pp. 278–290. ACM, New York (1983)

    Google Scholar 

  20. Völzer, H.: A constructive proof for FLP. In: IPL, vol. 92, pp. 83–87 (2004)

    Google Scholar 

  21. Völzer, H.: On randomization versus synchronization in distributed systems. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1214–1226. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  22. Völzer, H.: On conspiracies and hyperfairness in distributed computing. SIIM Technical Report SIIM-TR-A-05-20, Universität zu Lübeck (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Theoretical Computer Science, University of Lübeck, Germany

    Hagen Völzer

Authors
  1. Hagen Völzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Völzer, H. (2005). On Conspiracies and Hyperfairness in Distributed Computing. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_5

Download citation

  • DOI: https://doi.org/10.1007/11561927_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation