Concerning the size of logical clocks in distributed systems
Information Processing Letters
An efficient implementation of vector clocks
Information Processing Letters
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
| Hi-index | 0.00 |
Timestamping algorithms are used to capture the causal order or the concurrency of events in asynchronous distributed computations. This paper introduces a formal framework on timestamping algorithms, by characterizing some conditions they have to satisfy in order to capture causality. Under the proposed formal framework we derive a few properties about the size of timestamps and local informations at processes obtained by counting the number of distinct causal pasts which could be observed by an omniscient observer during the evolution of a distributed computation.