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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Attie, P.C., Francez, N., Grumberg, O.: Fairness and hyperfairness in multi-party interactions. Distributed Computing 6, 245–254 (1993)
Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. 2nd PODC, pp. 27–30. ACM, New York (1983)
Best, E.: Fairness and conspiracies. In: IPL, vol. 18, pp. 215–220 (1984) Erratum ibidem 19:162
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)
Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)
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)
Francez, N., Back, R.-J.J., Kurki-Suonio, R.: On equivalence-completions of fairness assumptions. Formal Aspects of Computing 4, 582–591 (1992)
Herlihy, M.: Wait-free synchronization. ACM ToPLaS 11(1), 124–149 (1991)
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)
Joung, Y.-J.: On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation 166, 1–34 (2001)
Joung, Y.-J.: On fairness notions in distributed systems, part II: Equivalence-completions and their hierarchies. Information and Computation 166, 35–60 (2001)
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)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Lamport, L.: Fairness and hyperfairness. Distributed Computing 13(4), 239–245 (2000)
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)
Merceron, A.: Fair processes. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266. Springer, Heidelberg (1987)
Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proc. 15th STOC, pp. 278–290. ACM, New York (1983)
Völzer, H.: A constructive proof for FLP. In: IPL, vol. 92, pp. 83–87 (2004)
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)
Völzer, H.: On conspiracies and hyperfairness in distributed computing. SIIM Technical Report SIIM-TR-A-05-20, Universität zu Lübeck (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)