Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
An efficient implementation of vector clocks
Information Processing Letters
Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
ACM Transactions on Computer-Human Interaction (TOCHI)
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
Roam: A Scalable Replication System for Mobile Computing
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
Lightweight Version Vectors for Pervasive Computing Devices
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Plausible clocks: constant size logical clocks for distributed systems
Distributed Computing
MPFR: A multiple-precision binary floating-point library with correct rounding
ACM Transactions on Mathematical Software (TOMS)
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
Hi-index | 0.89 |
In a replication system, version vectors are logged with replicas to detect conflicts among operations. Dynamic replications where replicas are frequently created and destroyed suffer from expensive logging overhead caused by inactive entries of version vectors. Although the rigmarole of pruning vectors can delete inactive entries, the vectors may be incompatible without additional information, which also causes another overhead. This paper proposes a novel version vector called log^' (log-prime) consisting of only three entries. By encoding based on the characteristics of prime numbers, log^' version vectors of fixed size can be logged concisely with no pruning technique at a little sacrifice in accuracy. Simulation studies show that log^' version vectors are accurate enough to detect almost all conflicts in the replication systems where all replicas are fully synchronizing.