Serialization of concurrent operations in a distributed collaborative environment

@article{Suleiman1997SerializationOC,
  title={Serialization of concurrent operations in a distributed collaborative environment},
  author={Maher Suleiman and Mich{\`e}le Cart and Jean Ferri{\'e}},
  journal={Proceedings of the 1997 ACM International Conference on Supporting Group Work},
  year={1997}
}
In a distributed groupware system, objects shared by users are subject to concurrency and real-time constraints. In order to satisfy these, various concurrency control algorithms 141 [ 1 l] have been proposed that exploit the semantic properties of operations. By ordering concurrent operations, they guarantee consistency of the different copies of each object. The drawback of these algorithms is that in some situations they can result in inconsistent copies, a non-respect of user’s intentions… 

Figures from this paper

Concurrent operations in a distributed and mobile collaborative environment

The principle objective of the paper is to present an algorithm that overcomes drawbacks in distributed and mobile collaborative environments based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.

Copies convergence in a distributed real-time collaborative environment

Two new algorithms are presented that are based upon the impleðmentation of a continuous global order which enables that condition to be released, and simplifies the operation inteðgration process.

Concurrent Undo Operations in Collaborative Environments Using Operational Transformation

This paper aims to highlight two general conditions that need to be satisfied by any transformation adapted to undo, and presents a general undo algorithm based on the definition of a generic undo-fitted transformation, which automatically verifies these conditions.

oodOPT: A semantics-based concurrency control framework for fully-replicated architecture

A novel semantics-based concurrency control framework,oodOPT, is proposed, to resolve conflicts by utilizing semantics of the operations and the accessed data objects and the strategies resolving these conflicts are analyzed.

oodOPT: a semantics-based concurrency control framework for fully-replicated architecture

A novel semantics-based concurrency control framework,oodOPT, is proposed, to resolve conflicts by utilizing semantics of the operations and the accessed data objects and the strategies resolving these conflicts are analyzed.

Using CSP for coordinating undo-based collaborative applications

To correctly manipulate undo for a shared object, it is proved that the set of operations of size n • 4 must be totally Commutative, while only a subset of commutative operations is necessary otherwise.

An Operation Transformation Based Concurrency Control Integrating Multicast Agent

The enhancement of madOPT over dOPT (distributed operation transformation) is that it reduces the number of queries in operation log during an operation transformation, and takes object attributes as the granularity of concurrency control and thus can support graph and image objects.

Operation transformation based concurrency control in group editors

This dissertation proposes a total order based framework including a new consistency model and the associated design methodology and proposes the first set of practical design guidelines in OT based on this model.

RCML: A Prescription for Safely Relaxing Synchrony

An extension of the MultiMLton compiler and runtime is built that implements CML communication asynchronously, but guarantees that the resulting execution is faithful to the synchronous semantics of CML, and presents an implementation that builds a decentralized dependence graph whose structure can be used to check the integrity of an execution with respect to this equivalence.

A Prescription for Safely Relaxing Synchrony

An extension of the MultiMLton compiler and runtime is built that implements CML communication asynchronously, but guarantees that the resulting execution is faithful to the synchronous semantics of CML, and presents an implementation that builds a decentralized dependence graph whose structure can be used to check the integrity of an execution with respect to this equivalence.
...

References

SHOWING 1-10 OF 19 REFERENCES

Concurrency control in groupware systems

An algorithm for concurrency control in real-time groupware systems is presented and its advantages are its simplicity of use and its responsiveness: users can operate directly on the data without obtaining locks.

An algorithm for distributed groupware applications

The authors begin by introducing the notion of a purely replicated architecture and then present GroupDesign, a shared drawing tool implemented with this architecture that gives the best response time for the interface and reduces the number of undo and redo operations when conflicts occur.

Real time groupware as a distributed system: concurrency control and its effect on the interface

The paper considers both human and technical considerations that designers should ponder before choosing a particular concurrency control method and reviews the work-in-progress designing and implementing a library of concurrency schemes in GROUPKIT, a groupware toolkit.

Commutativity-based concurrency control for abstract data types

  • W. Weihl
  • Computer Science
    [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track
  • 1988
Two novel concurrency control algorithms for abstract data types are presented and it is proved that both algorithms ensure a local atomicity property called dynamic atomicity, which means that they can be used in combination with any other algorithms that also ensureynamic atomicity.

Atomic data abstractions in a distributed collaborative editing system

This paper describes our experience implementing CES, a distributed Collaborative Editing System written in Argus, a language that includes facilities for managing long-lived distributed data. Argus

Distributed Concurrency Control in Real-time Cooperative Editing Systems

This paper focuses on the definition and verification of an integrated set of distributed concurrency control schemes based on a novel consistency model for solving three inconsistency problems: divergence, causality- Violation, and intention-violation in real-time cooperative editing systems.

DistView: support for building efficient collaborative applications using replicated objects

This paper suggests a simple synchronous collaboration paradigm in which the sharing of the views of user/application interactions occurs at the window level within a multi-user, multi-window application.

Time, clocks, and the ordering of events in a distributed system

A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events, and a bound is derived on how far out of synchrony the clocks can become.

Response-Requirements Specific Object Model for Workgroup Computing

A conceptual and technological framework for a class of workgroup computing applications characterized by an asynchronous distributed interaction during the development of shared artifacts is defined, called RESPONSE (REquirements SPecific Object Network System Environment).