About logical clocks for distributed systems

Memory space and processor time are basic resources when executing a program. But beside this implementation aspect (this time resource is necessary but does not belong to the program semantics), the concept of time presents a more fundamental facet in distributed systems namely causality relation between events. Put forward by Lamport in 1978, the logical nature of time is of primary importance when designing or analyzing distributed systems. This paper reviews three ways (linear time, vector time and matrix time) which have been proposed to capture causality between events of a distributed computation and which consequently allow to define logical time.

[1]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[2]  Jayadev Misra,et al.  Distributed discrete-event simulation , 1986, CSUR.

[3]  André Schiper,et al.  A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[4]  Barbara Liskov,et al.  Highly available distributed services and fault-tolerant distributed garbage collection , 1986, PODC '86.

[5]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[6]  W. Weigel,et al.  Global events and global breakpoints in distributed systems , 1988, [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track.

[7]  Willy Zwaenepoel,et al.  Recovery in distributed systems using asynchronous message logging and checkpointing , 1988, PODC '88.

[8]  Frank Bernhard Schmuck,et al.  The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems , 1988 .

[9]  Alley Stoughton,et al.  Detection of Mutual Inconsistency in Distributed Systems , 1983, IEEE Transactions on Software Engineering.

[10]  Rhonda Righter,et al.  Distributed simulation of discrete event systems , 1989, Proc. IEEE.

[11]  Robert E. Strom,et al.  Optimistic recovery in distributed systems , 1985, TOCS.

[12]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[13]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[14]  David B. Johnson,et al.  Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing , 1988, J. Algorithms.

[15]  Michel Raynal,et al.  Synchronization and concurrency measures for distributed computations , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[16]  Mustaque Ahamad,et al.  Implementing and programming causal distributed shared memory , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[17]  Michel Raynal,et al.  A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks , 1987, Inf. Process. Lett..

[18]  Bernadette Charron-Bost,et al.  Concerning the Size of Logical Clocks in Distributed Systems , 1991, Inf. Process. Lett..

[19]  Colin J. Fidge,et al.  Logical time in distributed computing systems , 1991, Computer.

[20]  Gérard Berry,et al.  Real Time Programming: Special Purpose or General Purpose Languages , 1989, IFIP Congress.

[21]  Michel Raynal,et al.  Synchronization and control of distributed systems and programs , 1990, Wiley series in parallel computing.

[22]  Nancy A. Lynch,et al.  Discarding Obsolete Information in a Replicated Database System , 1987, IEEE Transactions on Software Engineering.

[23]  Arthur J. Bernstein,et al.  Efficient solutions to the replicated log and dictionary problems , 1984, PODC '84.

[24]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[25]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.