Marzullo's Algorithm

From	bob <bob@coolfone.comze.com>
Newsgroups	comp.programming
Subject	Marzullo's Algorithm
Date	2012-06-01 08:25 -0700
Organization	http://groups.google.com
Message-ID	<5ff73423-5932-4e1b-9a22-7bef7b09e04d@googlegroups.com> (permalink)

Show all headers | View raw

Let's say I have one computer that is synchronized to an atomic clock.

Then I have, say 5 other computers, that need the correct time and will attempt to get it by talking to the timekeeper computer.  Those 5 computers are all connected to the timekeeper by Wifi, so there can be a bit of latency (although the latency tends to vary).

What is the best way to get the 5 computers synced to the timekeeper?

I am thinking Marzullo's Algorithm is a good way.  However, there may be something slightly simpler.  In Marzullo's Algorithm, it is for talking to multiple timekeepers usually.  If we are only talking to one, we can simplify Marzullo's Algorithm:

Simply have each computer ask for the time from the timekeeper 100 times or so.  Then use the time that came back with the lowest Round Trip Time (RTT).

Can someone let me know if this is a correct simplification of Marzullo's Algorithm for one timekeeper?

Back to comp.programming | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

Marzullo's Algorithm bob <bob@coolfone.comze.com> - 2012-06-01 08:25 -0700
  Re: Marzullo's Algorithm Ike Naar <ike@iceland.freeshell.org> - 2012-06-01 15:38 +0000
    Re: Marzullo's Algorithm Robert Wessel <robertwessel2@yahoo.com> - 2012-06-01 10:58 -0500
  Re: Marzullo's Algorithm "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> - 2012-06-01 18:29 +0200

csiph-web