Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
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)
Communications of the ACM
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
| Hi-index | 0.00 |
Process duplication is a classical method to cope with process crashes: a set of replicated processes constitutes a group that implements some fault-tolerant service. Several distributed systems are structured as a set of interacting reliable groups. This paper presents a clock management protocol where a logical clock is associated with each group (usually, logical clocks are associated with processes). The main problem that has to be solved is to ensure that all processes of a group behave in the same manner despite nondeterministic statements. It is shown that this problem can be reduced to the consensus problem. So, the proposed group clock protocol is based on an underlying building block providing a solution to the consensus problem.