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
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Concerning the size of logical clocks in distributed systems
Information Processing Letters
An efficient implementation of vector clocks
Information Processing Letters
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
A limitation of vector timestamps for reconstructing distributed computations
Information Processing Letters
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
IEEE Transactions on Software Engineering
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper presents a survey of implementation of logical time in asynchronous distributed systems. We provide an argument that justifies the use of logical time as a mechanism for detecting causal relationships between events. Further, we formally introduce the notion of a logical time system (a logical clock) and proceed to discuss the properties of the scalar, vector, and matrix clocks. Finally, we consider the modifications of the vector clock that reduce the average communication overhead while retaining the property of isomorphism.