Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Hermes: a language for distributed computing
Hermes: a language for distributed computing
Introduction to OSF DCE (rev. 1.0)
Introduction to OSF DCE (rev. 1.0)
An efficient implementation of vector clocks
Information Processing Letters
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Java Language Specification
The Java Language Specification
A framework algorithm for dynamic, centralized dimension-bounded timestamps
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Self-Organizing Hierarchical Cluster Timestamps
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
Abstract: Partial-order data structures used in distributed-system observation tools typically use vector timestamps to efficiently determine event precedence. Unfortunately, all current dynamic vector-timestamp algorithms either require a vector of size equal to the number of processes in the computation or require a graph search operation to determine event precedence. This fundamentally limits the scalability of such observation systems. In this paper we present an algorithm for hierarchical, clustered vector time-stamps. We present results for a variety of computation environments that demonstrate such timestamps can reduce space consumption by more than an order-of-magnitude over Fidge/Mattern timestamps while still providing acceptable time bounds for computing timestamps and determining event precedence.