Complexity of network synchronization
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Synchronization and control of distributed systems and programs
Synchronization and control of distributed systems and programs
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Introduction to distributed algorithms
Introduction to distributed algorithms
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
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)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
A taxonomy of distributed termination detection algorithms
Journal of Systems and Software
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Principles of Distributed Systems
Principles of Distributed Systems
Distributed Algorithms
Repeated Computation of Global Functions in a Distributed Environment
IEEE Transactions on Parallel and Distributed Systems
General and Efficient Decentralized Consensus Protocols
Proceedings of the 2nd International Workshop on Distributed Algorithms
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Fault-Tolerant Broadcasts in CAN
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
A Solution to Atomic Commitment Based on an Extended Consensus Protocol
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
On Classes of Problems in Asynchronous Distributed Systems with Process Crashes
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Early stopping in global data computation
Proceedings of the twenty-first annual symposium on Principles of distributed computing
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Theoretical Computer Science
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Uncertainty and predictability: can they be reconciled?
Future directions in distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
The notion of veto number for distributed agreement problems
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
On detecting termination in the crash-recovery model
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Exploiting partitioned synchrony to implement accurate failure detectors
International Journal of Critical Computer-Based Systems
Hi-index | 0.01 |
A Global Data is a vector with one entry per process. Each entry must be filled with an appropriate value provided by the corresponding process. Several distributed computing problems amount to compute a function on a global data. This paper proposes a protocol to solve such problems in the context of asynchronous distributed systems where processes may fail by crashing. The main problem that has to be solved lies in computing the global data and in providing each noncrashed process with a copy of it, despite the possible crash of some processes. To be consistent, the global data must contain, at least, all the values provided by the processes that do not crash. This defines the Global Data Computation (GDC) problem. To solve this problem, processes execute a sequence of asynchronous rounds during which they construct, in a decentralized way, the value of the global data and eventually each process gets a copy of it. To cope with process crashes, the protocol uses a perfect failure detector. The proposed protocol has been designed to be time efficient: it allows early decision. Let $t$ be the maximum number of processes that may crash, $t