Byzantine clock synchronization

Authors:
Leslie Lamport;P M Melliar Smith
Affiliations:
-;-
Venue:
ACM SIGOPS Operating Systems Review
Year:
1986

Citing 7
Cited 1

Synchronizing clocks in the presence of faults

Journal of the ACM (JACM)
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A new fault-tolerant algorithm for clock synchronization

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the possibility and impossibility of achieving clock synchronization

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Authentication revisited

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

An informal description is given of three fault-tolerant clock-synchronization algorithms. These algorithms work in the presence of arbitrary kinds of failure, including "two-faced" clocks. Two of the algorithms are derived from Byzantine Generals solutions.