Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A distributed algorithm to prevent mutual drift between n logical clocks
Information Processing Letters
Exploiting locality in maintaining potential causality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Concerning the size of logical clocks in distributed systems
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
An efficient implementation of vector clocks
Information Processing Letters
On-the-fly analysis of distributed computations
Information Processing Letters
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Shared global states in distributed computations
Journal of Computer and System Sciences
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Principles of Distributed Systems
Principles of Distributed Systems
Plausible clocks: constant size logical clocks for distributed systems
Distributed Computing
Efficient detection of a class of stable properties
Distributed Computing
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems
IEEE Distributed Systems Online
| Hi-index | 0.00 |
Vector clocks are the appropriate mechanism used to track causality among the events produced by a distributed computation. Traditional implementations of vector clocks require application messages to piggyback a vector of nintegers (where n is the number of processes). This paper investigates the tracking of the causality relation on a subset of events (namely, the events that are defined as "relevant" from the application point of view) in a context where communication channels are not required to be FIFO, and where there is no a priori information on the connectivity of the communication graph or the communication pattern. More specifically, the paper proposes a suite of simple and efficient implementations of vector clocks that address the reduction of the size of message timestamps, i.e., they do their best to have message timestamps whose size is less than n. The relevance of such a suite of protocols is twofold. From a practical side, it constitutes the core of an adaptive timestamping software layer that can used by underlying applications. From a theoretical side, it provides a comprehensive view that helps better understand distributed causality-tracking mechanisms.