An Election Algorithm for a Distributed Clock Synchronization Program

Abstract

This paper describes the election algorithm that guarantees the reliability of TEMPO, a distributed clock synchronizer running on Berkeley UNIX 4.3BSD 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 slave 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 time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1985
Accession Number
ADA611781

Entities

People

  • Riccardo Gusella
  • Stefano Zatti

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Clocks
  • Computer Science
  • Computers
  • Elections
  • Electrical Engineering
  • Engineering
  • Guarantees
  • Intervals
  • Local Area Networks
  • Networks
  • Operating Systems
  • Probability
  • Probability Density Functions
  • Random Variables
  • Reliability

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Operations Research
  • Positioning, Navigation, and Timing (PNT) Technology.