Copies convergence in a distributed real-time collaborative environment

In real−time collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. In order to satisfy these, various algorithms, qualified as op− timistic, [3, 5, 13, 17, 14, 15, 18], have been proposed that exploit the semantic properties of operations to serialize concurrent operations and achieve copy convergence of replicated objects. Their drawback is that they either re− quire a condition on user’s operations which is hard to verify when possible to ensure, or they need undoing then redoing operations in some situations. The main purpose of this paper is to present two new algorithms that over− come these drawbacks. They 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. In the second algorithm, thanks to de− ferred broadcast of operations to other sites, this process becomes even more simplified.

• Type: Conference
• Year: 2000
• Where: CSCW
• Authors: Nicolas Vidot, Michèle Cart, Jean Ferrié, Maher Suleiman
• Keywords: Concurrent Operations, CSCW 2000, Real−time Collaborative Systems, Replicated Objects, Social Sciences