Information Processing Letters
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Parallel program design: a foundation
Parallel program design: a foundation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
On fairness notions in distributed systems I.4: a characterization of implementability
Information and Computation
On fairness notions in distributed systems II.: equivalence-completions and their hierarchies
Information and Computation
On the Absence of Livelocks in Parallel Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Proceedings of the Conference on Logic of Programs
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Information Processing Letters
Distributed Computing
Fairness and hyperfairness in multi-party interactions
Distributed Computing
Generating non-conspiratorial executions
Information Processing Letters
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Fairness and conspiracy concepts in concurrent systems
ACM SIGSOFT Software Engineering Notes
The failure detector abstraction
ACM Computing Surveys (CSUR)
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
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.