ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
From an Asynchronous Intermittent Rotating Star to an Eventual Leader
IEEE Transactions on Parallel and Distributed Systems
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Increasing the power of the iterated immediate snapshot model with failure detectors
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
ACM SIGACT News
Hi-index | 0.00 |
A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a message adversary defines a subset of messages that cannot be eliminated by the adversary. It has recently been shown that when a message adversary is constrained by a property denoted TOUR (for tournament), the corresponding synchronous system and the asynchronous crash-prone read/write system have the same computability power for task solvability. This paper introduces new message adversary properties (denoted SOURCE and QUORUM), and shows that the synchronous round-based systems whose adversaries are constrained by these properties are characterizations of classical asynchronous crash-prone systems (1) in which processes communicate through atomic read/write registers or point-to-point message-passing, and (2) enriched with failure detectors such asOmega and Sigma. Hence these properties characterize maximal adversaries, in the sense that they define strongest message adversaries equating classical asynchronous crash-prone systems. They consequently provide strong relations linking round-based synchrony weakened by message adversaries with asynchrony restricted with failure detectors. This not only enriches our understanding of the synchrony/asynchrony duality, but also allows for the establishment of a meaningful hierarchy of property-constrained message adversaries.