Unilateral version vector pruning using loosely synchronized clocks
نویسنده
چکیده
This paper presents a new lightweight algorithm for pruning inactive entries in version vectors (VVs). This algorithm lets each node remove inactive VV entries without any coordination with other nodes. It achieves this feature by devising a new way to compare two version vectors based on loosely synchronized clocks and placing a timing restriction on the behavior of the application. VVs computed by our algorithm can accurately and completely capture the “happened-before” relation between events just like ordinary VVs. This paper proves the correctness of our algorithm as well.
منابع مشابه
همزمانی ساعتها در فضا – زمان عام
Einstein and transport synchronizations of infinitesimally spaced and distant clocks are considered in a general Riemannian space-time. It is shown that infinitesimally spaced clocks can always be synchronized. In general one can not find observers for whom distant clock are Einstein synchronized but transport synchronized observers do always exit. Whenever both procedures are possible, they ...
متن کاملClock-RSM: Low-Latency Inter-Datacenter State Machine Replication Using Loosely Synchronized Physical Clocks (Technical Report)
This paper proposes Clock-RSM, a new state machine replication protocol that uses loosely synchronized physical clocks to totally order commands for geo-replicated services. Clock-RSM assumes realistic non-uniform latencies among replicas located at different data centers. It provides low-latency linearizable replication by overlapping 1) logging a command at a majority of replicas, 2) determin...
متن کاملAnalysis of Bounds on Hybrid Vector Clocks
Hybrid vector clocks (HVC) implement vector clocks (VC) in a space-efficient manner by exploiting the availability of loosely-synchronized physical clocks at each node. In this paper, we develop a model for determining the bounds on the size of HVC. Our model uses four parameters, : uncertainty window, δ: minimum message delay, α: communication frequency and n: number of nodes in the system. We...
متن کاملConsistency Models in Distributed Systems with Physical Clocks
Most existing distributed systems use logical clocks to order events in the implementation of various consistency models. Although logical clocks are straightforward to implement and maintain, they may affect the scalability, availability, and latency of the system when being used to totally order events in strong consistency models. They can also incur considerable overhead when being used to ...
متن کاملUniversally Composable Synchronous Computation
In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: i.e., they can simultaneously achieve input completeness (all honest parties’ inputs are included in the computation) and guaranteed termination (honest parties do not “hang” indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channe...
متن کامل