Jump to content

Berkeley algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shigs (talk | contribs) at 11:16, 7 May 2008 (The algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Berkeley Algorithm is an method of clock synchronisation in distributed computing which assumes no machine has an accurate time source.

The algorithm

Unlike Cristian's algorithm the server in Berkeley algorithm, called the master periodically polls the other computers which are called slaves.


Template:Computer Science