Global quiescence detection based on credit distribution and recovery
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
Efficient vector time with dynamic process creation and termination
Journal of Parallel and Distributed Computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Bayou: replicated database services for world-wide applications
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Version Stamps " Decentralized Version Vectors
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Plausible clocks: constant size logical clocks for distributed systems
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
From Static Distributed Systems to Dynamic Systems
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Tree clocks: an efficient and entirely dynamic logical time system
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems
IEEE Distributed Systems Online
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Agreeing to agree: conflict resolution for optimistically replicated data
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Concise version vectors in WinFS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Data synchronization architectural pattern for ubiquitous learning systems
Programming Support Innovations for Emerging Distributed Applications
Virtual time and timeout in client-server networks
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
An approach to debug interactions in multi-agent system software tests
Information Sciences: an International Journal
Dissemination of reconfiguration policies on mesh networks
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Asynchronous event detection for context inconsistency in pervasive computing
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Causality tracking mechanisms, such as vector clocks and version vectors, rely on mappings from globally unique identifiers to integer counters. In a system with a well known set of entities these ids can be preconfigured and given distinct positions in a vector or distinct names in a mapping. Id management is more problematic in dynamic systems, with large and highly variable number of entities, being worsened when network partitions occur. Present solutions for causality tracking are not appropriate to these increasingly common scenarios. In this paper we introduce Interval Tree Clocks , a novel causality tracking mechanism that can be used in scenarios with a dynamic number of entities, allowing a completely decentralized creation of processes/replicas without need for global identifiers or global coordination. The mechanism has a variable size representation that adapts automatically to the number of existing entities, growing or shrinking appropriately. The representation is so compact that the mechanism can even be considered for scenarios with a fixed number of entities, which makes it a general substitute for vector clocks and version vectors.