Managing update conflicts in Bayou, a weakly connected replicated storage system

@article{Terry1995ManagingUC,
  title={Managing update conflicts in Bayou, a weakly connected replicated storage system},
  author={Douglas B. Terry and Marvin Theimer and Karin Petersen and Alan J. Demers and Mike Spreitzer and Carl H. Hauser},
  journal={Proceedings of the fifteenth ACM symposium on Operating systems principles},
  year={1995}
}
  • D. Terry, M. Theimer, +3 authors C. Hauser
  • Published 1995
  • Computer Science
  • Proceedings of the fifteenth ACM symposium on Operating systems principles
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou’s design has focused on supporting application-specific mechanisms to detect and resolve the update conflicts that naturally arise in such a system, ensuring that replicas move towards eventual consistency, and defining a protocol by which the… Expand
A Scalable Conflict-Free Replicated Set Data Type
  • Andrei Deftu, J. Griebsch
  • Computer Science
  • 2013 IEEE 33rd International Conference on Distributed Computing Systems
  • 2013
TLDR
This work improves the original CRDT specification by introducing an efficient algorithm for sending deltas of updates between replicas and by partitioning a set replica into disjunctive subsets, and adds support for limited-lifetime elements to enable simple garbage collection strategies to address the problem of unbounded database growth. Expand
TARDiS : Transactional Storage with Parallel Worlds
Geo-replication is an increasingly common requirement for computing services which desire low latency and high availability across the globe. In these services, replicas serve requests locally andExpand
Putting consistency back into eventual consistency
TLDR
This work presents the design and evaluation of Indigo, a middleware that provides Explicit Consistency on top of a causally-consistent data store that guarantees strong application invariants while providing similar latency to an eventually-cons consistent system in the common case. Expand
SCAR: Strong Consistency using Asynchronous Replication with Minimal Coordination
TLDR
SCAR is a new distributed and replicated in-memory database that allows serializable transactions to read from backup replicas with minimal coordination, and it is demonstrated that SCAR achieves higher throughput by running under reduced isolation levels and detects concurrency anomalies in real time. Expand
PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
TLDR
PaRiS is presented, the first TCC system that supports partial replication and implements non-blocking parallel read operations, and it is shown that the throughput penalty incurred to implement causal consistency is as low as 20% for read-heavy workloads and 37% for write- heavy workloads. Expand
Data Consistency in Intermittently Connected Distributed Systems
TLDR
A replication scheme tailored for mobile computing in which communication is most often intermittent, low-bandwidth, or expensive, thus providing only weak connectivity is presented and transaction-oriented correctness criteria for the proposed schemes are presented. Expand
Optimistic Replication with Forward Conflict Resolution in Distributed Real-Time Databases
TLDR
VADer assists the application programmer in conquering the complexity inherent in optimistic replication and forward conflict resolution, and supports run-time visualization of relationships between concurrent transactions. Expand
Dynamic contention management for distributed applications
TLDR
A model is presented for a contention management framework that schedules access using the expected execution inherent in the application domain to best inform the contention manager, and a backoff scheme is employed to create an access schedule. Expand
Creek: a General Mixed-Consistency Transactional Replication Scheme
TLDR
Creek is a low-latency, eventually consistent replication scheme that also enables execution of strongly consistent requests and uses multiversion concurrency control to efficiently handle requests' rollbacks and reexecutions resulting from the mismatch between the tentative and the final execution orders. Expand
P2P replica synchronization with vector sets
TLDR
An enhanced replica synchronization mechanism built in Microsoft's WinFS replica management system, that groups together multiple objects and represents their state in a single version-vector, and has potentially wide applicability as a mechanism for compactly handling synchronization of arbitrarily overlapping groups of objects. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Session guarantees for weakly consistent replicated data
Four per-session guarantees are proposed to aid users and applications of weakly consistent replicated data: "read your writes", "monotonic reads", "writes follow reads", and "monotonic writes". TheExpand
Resolving File Conflicts in the Ficus File System
TLDR
It is concluded from the experience that optimistic concurrency works well in at least one realistic environment, conflicts are rare, and a large proportion of those conflicts that do occur can be automatically solved without human intervention. Expand
Implementation of the Ficus Replicated File System
TLDR
The Ficus replicated le system for NFS is introduced and how it is layered on top of existing le systems is shown, in a manner analogous to object-oriented programming with inheritance. Expand
Providing high availability using lazy replication
TLDR
This paper describes a new way of implementing causal operations that performs well in terms of response time, operation-processing capacity, amount of stored state, and number and size of messages; it does better than replication methods based on reliable multicast techniques. Expand
Conflict detection tradeoffs for replicated data
TLDR
This paper examines the performance of these algorithms for update transactions as a function of data contention for various levels of data replication and “distributedness” of accesses to replicated data by using a detailed model of a distributed DBMS to study a set of representative algorithms. Expand
A Weak-Consistency Architecture for Distributed Information Services
TLDR
This architecture implements the replicas as a weak-consistency process group, which provides good scalability and availability, handles portable computer systems, and minimizes the effect of users on each other. Expand
Detection of Mutual Inconsistency in Distributed Systems
TLDR
A new approach, involving version vectors and origin points, is presented and shown to detect single file, multiple copy mutual inconsistency effectively and has been used in the design of LOCUS, a local network operating system at UCLA. Expand
Flexible and Safe Resolution of File Conflicts
TLDR
The design combines a rule-based approach to ASR selection with transactional encapsulation of ASR execution and shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness. Expand
Coda: A Highly Available File System for a Distributed Workstation Environment
The design and implementation of Coda, a file system for a large-scale distributed computing environment composed of Unix workstations, is described. It provides resiliency to server and networkExpand
The LOCUS distributed operating system
TLDR
The complete system architecture is outlined in this paper, and that experience in its use has been summarized. Expand
...
1
2
3
4
...