Journal ArticleDOI
Computing $k$-Atomicity in Polynomial Time
TLDR
The $k$-atomicity property can be used to describe the consistency of data operations in large distributed storage systems as well as weak consistency guarantees offered by such systems.Abstract:
The $k$-atomicity property can be used to describe the consistency of data operations in large distributed storage systems. The weak consistency guarantees offered by such systems are seen as a nec...read more
Citations
More filters
Journal ArticleDOI
Achieving Probabilistic Atomicity With Well-Bounded Staleness and Low Read Latency in Distributed Datastores
TL;DR: The theoretical analysis and the experimental evaluations show that the fast read algorithm for PAB guarantees PAB, even when faced with dynamic changes in the computing environment.
Posted Content
Inversion-based Measurement of Data Consistency for Read/Write Registers.
TL;DR: The basic idea of the verification algorithm is brute-force search of the permutation with less than $i$ inversions, which requires exponential cost but can be leveraged to prune the search space and yields an efficient polynomial verification algorithm.
Journal ArticleDOI
ViSearch: Weak Consistency Measurement for Replicated Data Types
TL;DR: TheViSearch framework refactors the existing brute-force checking algorithm to a generic algorithm skeleton, which further enables efficient pruning of the search space and effective parallelization, and shows the usefulness and cost-effectiveness of consistency measurement based on the ViSearch framework in realistic scenarios.