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
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
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Reasoning about knowledge
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Introductory Combinatorics
Disconnection modes for mobile databases
Wireless Networks
WDAG '94 Proceedings of the 8th 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
Plausible clocks: constant size logical clocks for distributed systems
Distributed Computing
Concurrent common knowledge: defining agreement for asynchronous systems
Distributed Computing
The inhibition spectrum and the achievement of causal consistency
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
| Hi-index | 0.00 |
Vector and matrix clocks are extensively used in asynchronous distributed systems. This paper asks, "how does the clock abstraction generalize?" To address this problem, 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 attain any specified level of knowledge about the timestamp of the most recent system state for which this is possible without using any messages in the clock protocol. The paper then gives algorithms to determine the time-stamp of the latest system state about which a specified level of knowledge is attainable in a given system state, and to compute the timestamp of the earliest system state in which a specified level of knowledge about a given system state is attainable. The results are applicable to applications that deal with a certain class of properties, identified as monotonic properties.