An efficient implementation of vector clocks

DOI10.1016/0020-0190(92)90028-TzbMath0780.68050OpenAlexW2082073570MaRDI QIDQ1198011

Mukesh Singhal, Ajay D. Kshemkalyani

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90028-t

zbMATH Keywords

distributed algorithmsvector timecausal orderingefficient implementationdistributed computing systemsFIFO message deliveryvector clockslogical time

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items

Detecting causal relationships in distributed computations: In search of the holy grail ⋮ Optimal propagation-based protocols implementing causal memories ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Timestamping messages and events in a distributed system using synchronous communication ⋮ Necessary and sufficient conditions on information for causal message ordering and their optimal implementation ⋮ The power of logical clock abstractions ⋮ A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION ⋮ \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication ⋮ On the minimal information to encode timestamps in distributed computations.

Cites Work

• Unnamed Item
• Concerning the size of logical clocks in distributed systems
• Time, clocks, and the ordering of events in a distributed system
• Exploiting locality in maintaining potential causality