Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth 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)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Software Engineering
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal implementation of the weakest failure detector for solving consensus (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Eventually consistent failure detectors
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Consensus-based fault-tolerant total order multicast
IEEE Transactions on Parallel and Distributed Systems
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mastering Agreement Problems in Distributed Systems
IEEE Software
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
Solving the Group Priority Inversion Problem in a Timed Asynchronous System
IEEE Transactions on Computers
Consensus-Based Fault-Tolerant Total Order Multicast
IEEE Transactions on Parallel and Distributed Systems
ACM SIGACT News
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Dynamically Scaling Computer Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Asynchronous Group Membership with Oracles
Proceedings of the 13th International Symposium on Distributed Computing
Proceedings of the 13th International Symposium on Distributed Computing
Revising the Weakest Failure Detector for Uniform Reliable Broadcast
Proceedings of the 13th International Symposium on Distributed Computing
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Ruminations on Domain-Based Reliable Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Enhancing Replica Management Services to Cope with Group Failures
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Avoiding Priority Inversion on the Processing of Requests by Active Replicated Servers
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
On the Importance of Having an Identity or is Consensus Really Universal?
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Real-Time Fault-Tolerant Atomic Broadcast
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
tight bounds for k-set agreement with limited-scope failure detectors
Proceedings of the twenty-second annual symposium on Principles of distributed computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
A Consensus Protocol for CAN-Based Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Consensus in byzantine asynchronous systems
Journal of Discrete Algorithms
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A flexible formal framework for masking/demasking faults
Information Sciences—Informatics and Computer Science: An International Journal
A weakest failure detector-based asynchronous consensus protocol for f
Information Processing Letters
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of 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
Failure detection and consensus in the crash-recovery model
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Failure, connectivity and disconnection detectors
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
The mobile groups approach for the coordination of mobile agents
Journal of Parallel and Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
Reliable and total order broadcast in the crash-recovery model
Journal of Parallel and Distributed Computing
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The weakest failure detector to solve nonuniform consensus
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Illustrating the impossibility of crash-tolerant consensus in asynchronous systems
ACM SIGOPS Operating Systems Review
Journal of Parallel and Distributed Computing
Service interface: a new abstraction for implementing and composing protocols
Proceedings of the 2006 ACM symposium on Applied computing
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Distributed Computing
Fully Distributed Three-Tier Active Software Replication
IEEE Transactions on Parallel and Distributed Systems
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Coordinated data aggregation in wireless sensor networks using the Omega failure detector
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Implementing unreliable failure detectors with unknown membership
Information Processing Letters
Asynchronous bounded lifetime failure detectors
Information Processing Letters
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
Managed Agreement: Generalizing two fundamental distributed agreement problems
Information Processing Letters
A new adaptive accrual failure detector for dependable distributed systems
Proceedings of the 2007 ACM symposium on Applied computing
Boxwood: abstractions as the foundation for storage infrastructure
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
IEEE Transactions on Dependable and Secure Computing
The election problem in asynchronous distributed systems with bounded faulty processes
The Journal of Supercomputing
Science of Computer Programming
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks
IEEE Transactions on Computers
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
From an intermittent rotating star to a leader
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Timeliness-based wait-freedom: a gracefully degrading progress condition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
The DHCP Failover Protocol: A Formal Perspective
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
Disassembling real-time fault-tolerant programs
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Solving Atomic Multicast When Groups Crash
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
From adaptive renaming to set agreement
Theoretical Computer Science
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Fault-tolerant aggregator election and data aggregation in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Extracting quorum failure detectors
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for solving k-set agreement
Proceedings of the 28th ACM symposium on Principles of distributed computing
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: weakest failure detectors via an egg-laying simulation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Brief Announcement: A Simple and Quiescent Omega Algorithm in the Crash-Recovery Model
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Asynchronous bounded lifetime failure detectors
Information Processing Letters
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Modeling agreement problems in the universal composability framework
ICICS'07 Proceedings of the 9th international conference on Information and communications security
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Practical impact of group communication theory
Future directions in distributed computing
Designing algorithms for dependent process failures
Future directions in distributed computing
Comparing the atomic commitment and consensus problems
Future directions in distributed computing
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
Future directions in distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the existence of weakest failure detectors for mutual exclusion and k-exclusion
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: on implementing Omega efficiently in the crash-recovery model
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Eventually linearizable shared objects
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information Processing Letters
Mencius: building efficient replicated state machines for WANs
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Weak consistency as a last resort
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
The failure detector abstraction
ACM Computing Surveys (CSUR)
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
On the impossibility of implementing perpetual failure detectors in partially synchronous systems
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Structural and algorithmic issues of dynamic protocol update
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Communication-efficient and crash-quiescent Omega with unknown membership
Information Processing Letters
Autonomous and scalable failure detection in distributed systems
International Journal of Autonomous and Adaptive Communications Systems
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Self-stabilizing tiny interaction protocols
Proceedings of the Third International Workshop on Reliability, Availability, and Security
The impossibility of boosting distributed service resilience
Information and Computation
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Multicast with aggregated deliveries
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Relations linking failure detectors associated with k-set agreement in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: on the meaning of solving a task with a failure detector
DISC'11 Proceedings of the 25th international conference on Distributed computing
Brief announcement: ΔΩ: specifying an eventual leader service for dynamic systems
DISC'11 Proceedings of the 25th international conference on Distributed computing
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
On fractional dynamic faults with threshold
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Revisiting the election problem in asynchronous distributed systems
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
On the possibility and the impossibility of message-driven self-stabilizing failure detection
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Solving election problem in asynchronous distributed systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The election problem in asynchronous distributed systems with bounded faulty processes
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Low-latency atomic broadcast in the presence of contention
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Adaptive fault monitoring in fault tolerant CORBA
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Building and using quorums despite any number of process of crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Total order communications: a practical analysis
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
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Dependable Systems
Advances in the design and implementation of group communication middleware
Dependable Systems
Divide and concur: employing chandra and toueg's consensus algorithm in a multi-level setting
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Leader election for replicated services using application scores
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Automatic classification of eventual failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the implementation of communication-optimal failure detectors
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
From a store-collect object and Ω to efficient asynchronous consensus
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Non-blocking atomic commitment in asynchronous distributed systems with faulty processes
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Leader election for replicated services using application scores
Proceedings of the 12th International Middleware Conference
Brief announcement: anonymity, failures, detectors and consensus
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Multicasting in the presence of aggregated deliveries
Journal of Parallel and Distributed Computing
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Theoretical Computer Science
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
Journal of Parallel and Distributed Computing
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors
The Journal of Supercomputing
| Hi-index | 0.02 |
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [1996], it is shown that W, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper, we prove that to solve Consensus, any failure detector has to provide at least as much information as W. Thus, W is indeed the weakest failure detector for solving Consensus in asynchronous systems with a majority of correct processes.