The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Distributed breakpoint detection in message-passing programs
Journal of Parallel and Distributed Computing
An introduction to distributed algorithms
An introduction to distributed algorithms
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Principles of Distributed Systems
Principles of Distributed Systems
An Atlas of Edge-Reversal Dynamics
An Atlas of Edge-Reversal Dynamics
Fundamentals of Distributed System Observation
IEEE Software
IEEE Transactions on Software Engineering
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Illustrating the Use of Vector Clocks in Property Detection: An Example and a Counter-Example
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Causal separators for large-scale multicast communication
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
A modular drinking philosophers algorithm
Distributed Computing
| Hi-index | 0.00 |
Matrix clocks are a generalization of the notion of vector clocks that allows the local representation of causal precedence to reach into an asynchronous distributed computation's past with depth x, where x ≥ 1 is an integer. Maintaining matrix clocks correctly in a system of n nodes requires that every message be accompanied by O(nx) numbers, which reflects an exponential dependency of the complexity of matrix clocks upon the desired depth x. We introduce a novel type of matrix clock, one that requires only nx numbers to be attached to each message while maintaining what for many applications may be the most significant portion of the information that the original matrix clock carries. In order to illustrate the new clock's applicability, we demonstrate its use in the monitoring of certain resource-sharing computations.