Talk:Chandra–Toueg consensus algorithm

This is an old revision of this page, as edited by Qwerfjkl (bot) (talk | contribs) at 09:25, 28 July 2023 (Adding {{WikiProject banner shell}} (Task 19)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 11 years ago by 128.62.57.205 in topic Timestamps

Timestamps

Where do timestamp come from? Does this article assume there is a shared clock? If not, I guess each process has its own clock? If so, then those clocks might not agree. In that case, it seems dubious to compare timestamps from different processes. Do differing clocks affect the correctness of the algorithm? If not, aren't timestamps just arbitrary, and the largest one wins? What happens if two preferences have the same timestamp? 24.7.113.167 (talk) 02:48, 13 April 2014 (UTC)Reply

As mentioned in the "Algorithm" section, the timestamp is the "last round where it changed its decision value (the value's timestamp)". Since the paper deals with asynchronous systems, of course there is no clock. — Preceding unsigned comment added by 128.62.57.205 (talk) 18:33, 6 May 2014 (UTC)Reply