ReportDOI
An Election Algorithm for a Distributed Clock Synchronization Program
Riccardo Gusella,Stefano Zatti +1 more
- pp 364-371
TLDR
The election algorithm that guarantees the reliability of TEMPO, a distributed clock synchronizer running on Berkeley UNIX 4.3BSD systems, is described.Abstract:
This paper describes the election algorithm that guarantees the reliability of TEMPO, a distributed clock synchronizer running on Berkeley UNIX 43BSD systems TEMPO is a distributed program based on a master-slave scheme that is comprised of time daemon processes running on individual machines The election algorithm chooses a new master from among the slaves after the crash of the machine on which the original master was running When the master is working, it periodically resets an election timer in each slave If the master disappears, the sl ave whose timer expires first will become a candidate for the new master The election algorithm covers this normal case, as well as the infrequent case where there may be two or more simultaneous candidates It also handles the case in which, due to a network partition that has been repaired, two masters are present at the same timeread more
Citations
More filters
Network Time Protocol (Version 3) Specification, Implementation and Analysis
TL;DR: This document describes the Network Time Protocol (NTP), specifies its formal structure and summarizes information useful for its implementation and describes the methods used for their implementation.
Journal ArticleDOI
Multimedia group synchronization protocols for integrated services networks
Ian F. Akyildiz,Wei Yen +1 more
TL;DR: New group synchronization protocols for real-time, multimedia applications, including teleconference, teleorchestration and multimedia on demand services are introduced, achieving synchronization for all configurations and without prior knowledge of the end-to-end delay distribution, or the distribution of the clock drift.
Journal ArticleDOI
The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD
R. Gusella,S. Zatti +1 more
TL;DR: Comparison with other clock synchronization algorithms shows that TEMPO, in an environment with no Byzantine faults, can achieve better synchronization at a lower cost.
Patent
Method and apparatus for exchanging heartbeat messages and configuration information between nodes operating in a master-slave configuration
TL;DR: In this article, a node periodically generates and sends ( 520, 526, FIG. 5 ) a Heartbeat message that indicates the operational status for one or more application instances being managed by the node.
Proceedings ArticleDOI
Reliable group communication in distributed systems
TL;DR: The design and implementation of a reliable group communication mechanism that guarantees a form of atomicity in that the messages are received by all operational members of the group or by none of them is presented.
References
More filters
Journal ArticleDOI
Elections in a Distributed Computing System
TL;DR: This paper discusses elections and reorganizations of active nodes in a distributed computing system after a failure, and two types of reasonable failure environments are studied.
Journal ArticleDOI
Hints for Computer System Design
TL;DR: Decorated with pithy quotations from many sources, this collection of good advice and anecdotes draws upon the folk wisdom of experienced designers.
Proceedings ArticleDOI
Polynomial algorithms for multiple processor agreement
Danny Dolev,H. Raymond Strong +1 more
TL;DR: It is proved that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.
Proceedings ArticleDOI
The impact of synchronous communication on the problem of electing a leader in a ring
Greg N. Frederickson,Nancy Lynch +1 more
TL;DR: The problem of electing a leader in a synchronous ring of n processors is considered and it is shown that if processor ID's are chosen from some countable set, then there is an algorithm which uses only O(n) messages in the worst case.