An efficient implementation of vector clocks

Information Processing Letters

Volumn 43, Issue 1, 1992, Pages 47-52

  Singhal, Mukesh ^a   Kshemkalyani, Ajay ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

causal ordering; Distributed computing systems; efficient implementation; logical time; vector time

Indexed keywords

ALGORITHMS; THEORY;

DISTRIBUTED ALGORITHMS; FIFO MESSAGE DELIVERY; VECTOR CLOCKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0026907967     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(92)90028-T     Document Type: Article

References (16)

1. Implementing and programming causal distributed memory
2. Fast causal multicast
3. Concerning the size of clocks
4. Partial order for parallel debugging
5. Timestamps in message-passing systems that preserve partial ordering
6. Time, clocks, and the ordering of events in a distributed system
7. Using tracing to direct our reasoning about distributed programs
8. Algorithms for distributed termination detection
9. Virtual time and global states of distributed systems
10. Exploiting locality in maintaining potential causality
11. Detection of mutual inconsistency in distributed systems
12. A new algorithm to implement causal ordering
13. A heuristically-aided algorithm for mutual exclusion in distributed systems
14. Optimistic recovery in distributed systems