Logical Time: A Way to Capture Causality in Distributed Systems

Michel Raynal 1 Mukesh Singhal 2
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The concept of causality between events is fundamental to the design and analysis of parallel and distributed computing and operating systems. Usually causality is tracked using physical time, but in distributed systems setting, there is no built-in physical time and it is only possible to realize an approximation of it. As asynchronous distributed computations make progress in spurts, it turns out that the logical time, which advances in jumps, is sufficient to capture the fundamental monotonicity property associated with causality in distributed systems. This paper reviews three ways to define logical time (e.g., scalar time, vector time, and matrix time) that have been proposed to capture causality between events of a distributed computation.
Type de document :
[Research Report] RR-2472, INRIA. 1995
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:44:29
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:06:42



  • HAL Id : inria-00074203, version 1


Michel Raynal, Mukesh Singhal. Logical Time: A Way to Capture Causality in Distributed Systems. [Research Report] RR-2472, INRIA. 1995. 〈inria-00074203〉



Consultations de la notice


Téléchargements de fichiers