Distributed Computing
Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Exploiting locality in maintaining potential causality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Bounded ignorance in replicated systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concerning the size of logical clocks in distributed systems
Information Processing Letters
An efficient implementation of vector clocks
Information Processing Letters
Reasoning about knowledge
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Causality and atomicity in distributed computations
Distributed Computing
Concurrent common knowledge: defining agreement for asynchronous systems
Distributed Computing
The inhibition spectrum and the achievement of causal consistency
Distributed Computing
| Hi-index | 0.00 |
Vector and matrix clocks are extensively used in asynchronous distributed systems. This paper asks, "how does the clock abstraction generalize?" and casts the problem in terms of concurrent knowledge. To this end, the paper motivates and proposes logical clocks of arbitrary dimensions. It then identifies and explores the conceptual link between such clocks and knowledge. It establishes the necessary and sufficient conditions on the size and dimension of clocks required to declare k-level concurrent knowledge about the most recent global facts for which this is possible without using control messages. It then gives algorithms to compute the latest global fact about which a specified level of knowledge is attainable in a given state, and to compute the earliest state in which a specified level of knowledge about a given global fact is attainable.