Session guarantees for weakly consistent replicated data

Terry, Douglas B.; Demers, Alan; Petersen, Karin Anna; Spreitzer, Mike; Theimer, Marvin; Welch, Brent

doi:10.1109/pdis.1994.331722

Cited by 250 publications

(208 citation statements)

References 18 publications

Supporting

Mentioning

206

Contrasting

Order By: Relevance

“…Bayou addresses the issues of tentative data values [78] and session guarantees for weakly-consistent replicated data [75]. To illustrate these concepts, the authors have ported calendar and E-mail applications and built a bibliographic database tool.…”

Section: Relocatable Dynamic Objectsmentioning

confidence: 99%

“…Applications offer clients services (e.g., the server-side portion of the E-mail browser offers E-mail service, the server-side web browser proxy offers HTTP service, etc.). Sessions are a precursor to supporting replicated servers, however, Rover does not provide any additional support for applications (e.g., session guarantees across different servers [76]). …”

Section: Using Qrpcmentioning

confidence: 99%

See 1 more Smart Citation

Mobile computing with the Rover toolkit

Joseph¹,

Tauber

Kaashoek

1997

IEEE Trans. Comput.

165

View full text Add to dashboard Cite

Rover is one of the first architectures that supports the construction of both mobileadaptive applications and mobile-adaptive proxies for mobile-transparent applications. To excel in the harsh conditions of a mobile environment, mobile-adaptive applications are aware of and take an active part in adapting to those conditions. The mobile-transparent approach is appealing because it allows applications to be run without alteration. The contributions of this thesis include the Rover architecture and a reference implementation, the Rover Toolkit. Together, the architecture and toolkit support a set of programming and communication abstractions that enable and simplify the construction of both mobile-adaptive proxies for mobile-transparent applications and new mobile-adaptive applications. The programming abstractions include Relocatable Dynamic Objects, a form of code-and data-shipping, along with remote invocation and method logging, that allows mobile-adaptive applications to dynamically adapt to environmental changes, and programming language extensions for reliable execution of applications at servers. The communication abstractions are based upon Queued Remote Procedure Call, a form of remote invocation that provides asynchronous, reliable delivery of requests and results. Using the Rover abstractions, applications obtain increased availability, concurrency, resource allocation efficiency, code reuse, fault tolerance, data consistency, application adaptation to environmental changes, and more efficient scheduling and utilization of communication channels. Experimental evaluation of a suite of mobile applications built with the toolkit demonstrates that such application-level control can be obtained with relatively little programming overhead and allows correct operation, increases interactive performance, and reduces network utilization under intermittently connected conditions. John Guttag also deserves thanks for mentoring me over the years. I thank him for the guidance he has given me, especially when I was changing research groups and during my search for a job.I thank David Gifford for his efforts during the design stages of the Rover toolkit, in particular his ideas for the semantics of QRPC.I thank my parents for the motivation they instilled in me, for all the support they have provided, and for their faith in me.I owe a lot of thanks to the rest of the Rover project team: Joshua Tauber, George Candea, Constantine Cristakos, Alan F. deLespinasse, and Michael Shurpik. Special thanks go to Josh for all the great design arguments/discussions we shared that helped shape the Rover architecture and for his help in building and debugging applications.I thank the Parallel and Distributed Operating Systems group for reading many drafts of the papers behind this thesis (thanks Massimiliano Poletto, Eddie Kohler, and Greg Ganger) and for providing me with a fun, exciting, and sometimes loud (thanks David Mazieres and Emmett Witchel), research environment. Thanks also to Neena Lyall for making the administ...

show abstract

Section: Relocatable Dynamic Objectsmentioning

confidence: 99%

Section: Using Qrpcmentioning

confidence: 99%

Mobile computing with the Rover toolkit

Joseph¹,

Tauber

Kaashoek

1997

IEEE Trans. Comput.

165

View full text Add to dashboard Cite

show abstract

“…Both quasi-copies [ALON90] and epsilon serializability [PU91] permit value-based and temporal divergence control on the underlying data. Bayou [TERR94] takes a slightly dierent approach, providing various kinds of intuitive consistency guarantees for each user \session" by controlling data divergence as well as using information specic to a session's read/write dependencies.…”

Section: Related Workmentioning

confidence: 99%

Data replication in Mariposa

Sidell¹,

Aoki²,

Sah³

et al.

Proceedings of the Twelfth International Conference on Data Engineering

View full text Add to dashboard Cite

The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. In this paper, we present extensions to the economic model which support replica management, as well as our mechanisms for propagating updates among replicas. We show h o w our replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization. We present a rule-based conict resolution mechanism, which can be used to enhance traditional time-stamp serialization. We discuss the eects of our replica system on query processing for both read-only and read-write queries. We further demonstrate how the replication model and mechanisms naturally support name service in Mariposa.

show abstract

“…Consider a replicated password database [Birrell et al 1982;Terry et al 1994]. A user may change her password on one site and later fail to log in from another site using the new password, because the change has not reached the latter site.…”

Section: Enforcing Read/write Orderingmentioning

confidence: 99%

“…Session guarantees are a mechanism to generate dependencies automatically from a user-chosen combination of the following predefined policies [Terry et al 1994]:…”

Section: Session Guaranteesmentioning

confidence: 99%

Optimistic Replication

SpringerReference

View full text Add to dashboard Cite

Data replication is a key technology in distributed data sharing systems, enabling higher availability and performance. This paper surveys optimistic replication algorithms that allow replica contents to diverge in the short term, in order to support concurrent work practices and to tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication techniques are different from traditional "pessimistic" ones. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This paper identifies key challenges facing optimistic replication systems -ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence -and provides a comprehensive survey of techniques developed for addressing these challenges.

show abstract

Session guarantees for weakly consistent replicated data

Cited by 250 publications

References 18 publications

Mobile computing with the Rover toolkit

Mobile computing with the Rover toolkit

Data replication in Mariposa

Optimistic Replication

Contact Info

Product

Resources

About