Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Concurrency control in groupware systems
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
An adaptive causal ordering algorithm suited to mobile computing environments
Journal of Parallel and Distributed Computing
Operational transformation in real-time group editors: issues, algorithms, and achievements
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
Copies convergence in a distributed real-time collaborative environment
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
The IceCube approach to the reconciliation of divergent replicas
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Architecture for Group Communication in Mobile Systems
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
An Efficient Consistency Management Algorithm for Real-Time Mobile Collaboration
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Operation context and context-based operational transformation
CSCW '06 Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work
Coordination Model for Real-Time Collaborative Editors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Analyzing convergence in consistency models for distributed objects
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Towards synchronizing linear collaborative objects with operational transformation
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Applying a theorem prover to the verification of optimistic replication algorithms
Rewriting Computation and Proof
| Hi-index | 0.01 |
This paper describes some preliminary steps towards defining a consistency criteria for mobile replicated systems using operational transformations. Our criterion lies between traditional strong criteria, preventing divergence, and traditional weak criteria, not enforcing any eventual form of convergence. We give a precise definition of our criterion and discuss its use to state the correctness and incorrectness of some existing practical algorithms.