Skewed Timestamps

In the well known timestamp algorithm each writing process reads all the registers of the other processes, and then sets a higher timestamp (natural number) to itself. In the `skewed algorithm' only one writing process in each pair reads the other. Categories and Subjects Descriptors: D.2.4 [Software Engineering]: Programs Verification---correctness proofs; F.3.1 [Logic and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs. 1 Preface Messages are often timestamped. In a fax, the timestamp includes the date and exact time of the day, and in a book only the publication year, but in all cases this information guides the reader in choosing and processing the data. The antiquarian may choose the oldest book, and the student the newest edition, but in the general timestamp protocol the reader (called scanner) returns all the messages in their issuing order. Neither clocks nor calendars are needed in the Unbounded Timestamp Algorithm (Figure 1) which uses the n..