From crash-stop to permanent omission: automatic transformation and weakest failure detectors

Authors:
Carole Delporte-Gallet;Hugues Fauconnier;Felix C. Freiling;Lucia Draque Penso;Andreas Tielmann
Affiliations:
Laboratoire d'Informatique Algorithmique, Fondements et Applications, University Paris VII, France;Laboratoire d'Informatique Algorithmique, Fondements et Applications, University Paris VII, France;Laboratory for Dependable Distributed Systems, University of Mannheim, Germany;Laboratory for Dependable Distributed Systems, University of Mannheim, Germany;Laboratoire d'Informatique Algorithmique, Fondements et Applications, University Paris VII, France
Venue:
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Year:
2007

Citing 17
Cited 1

Distributed agreement in the presence of processor and communication faults

IEEE Transactions on Software Engineering
Automatically increasing the fault-tolerance of distributed algorithms

Journal of Algorithms
Agreement is harder than consensus: set consensus problems in totally asynchronous systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
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)
Failure detectors in omission failure environments

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Muteness Failure Detectors: Specification and Implementation

EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Simulating Crash Failures with Many Faulty Processors (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)

Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The perfectly synchronized round-based model of distributed computing

Information and Computation
Gracefully degrading fair exchange with security modules

EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Revisiting failure detection and consensus in omission failure environments

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
TrustedPals: secure multiparty computation implemented with smart cards

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

Communication-efficient failure detection and consensus in omission environments

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms, failure detectors, and problem specifications, one of which is weakest failure detector preserving. We prove that our transformation of failure detector Ω [1] is the weakest failure detector for consensus in environments with crash-stop and permanent omission failures and a majority of correct processes. Our results help to use the power of the well-understood crash-stop model to automatically derive solutions for the general omission model, which has recently raised interest for being noticeably applicable for security problems in distributed environments equipped with security modules such as smartcards [2,3,4].