Global events and global breakpoints in distributed systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
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
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
About logical clocks for distributed systems
ACM SIGOPS Operating Systems Review
An efficient implementation of vector clocks
Information Processing Letters
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Characterizing the accuracy of distributed timestamps
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Global States and Time in Distributed Systems
Global States and Time in Distributed Systems
Fundamentals of Distributed System Observation
IEEE Software
IEEE Transactions on Software Engineering
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory
Proceedings of the 3rd International Workshop on Distributed Algorithms
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Lifetime Based Consistency Protocols for Distributed Objects
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Interval Approximations of Message Causality in Distributed Executions
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A scalable technique for implementing multiple consistency levels for distributed objects
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Performance Evaluation of Plausible Clocks
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Efficient Causality-Tracking Timestamping
IEEE Transactions on Knowledge and Data Engineering
The power of logical clock abstractions
Distributed Computing
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Safety of a session guarantees protocol using plausible clocks
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Log' version vector: Logging version vectors concisely in dynamic replication
Information Processing Letters
Plausible clocks with bounded inaccuracy
DISC'05 Proceedings of the 19th international conference on Distributed Computing
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An approach to debug interactions in multi-agent system software tests
Information Sciences: an International Journal
Theoretical Computer Science
Link prediction with social vector clocks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
In a Distributed System with N sites, the precise detection of causal relationships between events can only be done with vector clocks of size N. This gives rise to scalability and efficiency problems for logical clocks that can be used to order events accurately. In this paper we propose a class of logical clocks called plausible clocks that can be implemented with a number of components not affected by the size of the system and yet they provide good ordering accuracy. We develop rules to combine plausible clocks to produce more accurate clocks. Several examples of plausible clocks and their combination are presented. Using a simulation model, we evaluate the performance of these clocks. We also present examples of applications where constant size clocks can be used.