Talk:Chandra–Toueg consensus algorithm

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Low This article has been rated as Low-importance on the project's importance scale.

Timestamps

Latest comment: 11 years ago2 comments2 people in discussion

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