On the limitation of the global time assumption in distributed systems

Uri Abraham, Shai Ben-David, Shlomo Moran

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


An ongoing debate among theoreticians of distributed systems concerns the global time issue. The basic question seems to be to what extent does a model with global time reflect the ‘real’ behavior of a distributed system. The assumption of the existence of global time simplifies the analysis of distributed algorithms to an extent that makes it almost irresistible. On the other hand it should be clear that when the operations discussed are of time duration that is comparable to that of the time needed for a signal to pass between different components of the system, then such an assumption is unrealistic. The debate is of a somewhat philosophical nature mainly because, so far, there were no known examples of faulty conclusions caused by excessive use of the global time model. In this note we demonstrate, for the first time, a protocol that is guaranteed to perform well as long as it is run in a system that enjoys the existence of global time, yet it may fail in some other conceivable circumstances. The protocol is very simple and is often used as a basic step in protocols for mutual exclusion. By the results of [5], such a phenomenon could not have occurred had we been running our protocol on one of the three common types of shared registers (safe, regular or atomic). Another contribution of this work is the introduction of a new class of shared memory registers - ‘weakly regular registers’. Our weak regularity is a natural variant on Lamport’s definition of regularity of registers.

Original languageEnglish
Title of host publicationDistributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings
EditorsPaul G. Spirakis, Lefteris Kirousis, Sam Toueg
PublisherSpringer Verlag
Number of pages8
ISBN (Print)9783540552369
StatePublished - 1 Jan 1992
Event5th International Workshop on Distributed Algorithms, WDAG 1991 - Delphi, Greece
Duration: 7 Oct 19919 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Distributed Algorithms, WDAG 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On the limitation of the global time assumption in distributed systems'. Together they form a unique fingerprint.

Cite this