Concurrency control in groupware systems
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Implicit locking in the ensemble concurrent object-oriented graphics editor
CSCW '92 Proceedings of the 1992 ACM conference on Computer-supported cooperative work
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A concurrency control framework for collaborative systems
CSCW '96 Proceedings of the 1996 ACM conference on Computer supported cooperative work
ACM Transactions on Computer-Human Interaction (TOCHI)
Optimal locking integrated with operational transformation in distributed real-time group editors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A distributed algorithm for graphic objects replication in real-time group editors
GROUP '99 Proceedings of the international ACM SIGGROUP conference on Supporting group work
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
Copies convergence in a distributed real-time collaborative environment
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
Consistency maintenance in real-time collaborative graphics editing systems
ACM Transactions on Computer-Human Interaction (TOCHI)
Optional and Responsive Fine-Grain Locking in Internet-Based Collaborative Systems
IEEE Transactions on Parallel and Distributed Systems
Concurrent Operations in a Distributed and Mobile Collaborative Environment
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A multi-versioning algorithm for intention preservation in distributed real-time group editors
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Conflict Control Locking in Distributed Cooperative Graphics Editors
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 1 - Volume 1
Response generation in collaborative negotiation
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An Efficient Consistency Management Algorithm for Real-Time Mobile Collaboration
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Mobile information exchange and integration: from query to application layer
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
F2FMI: A toolkit for facilitating face-to-face mobile interaction
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Mobile technology is particularly suited to a fully distributed (replicated) architecture for collaborative work. Users can maintain their own document copies, and can continue to work in the absence of a central server. However, in a replicated architecture, conflicts can occur when two or more users concurrently modify the same object in a shared document. Such conflicts can be classified as non-exclusive or exclusive. Non-exclusive conflicts, where conflicting operations can be realized at the same time, can be handled using conventional consistency management techniques such as operational transformation. On the other hand, exclusive conflicts can only be realised in different document versions. Although post-locking (Xue, Zhang, and Sun 2001) can be used to limit the number of versions that are created and thus reduce storage requirements in constrained mobile devices, it introduces two problems: a partial-intention problem and the need to synchronise locks before the conflict can be resolved. This paper introduces an algorithm that integrates operational transformation and multi-versioning to resolve the different types of conflict. The algorithm uses delayed post-locking to solve the partial-intention problem by making use of user intention locks. It also uses conflict tables to better facilitate the resolution of conflict as soon as possible without requiring sites to receive all operations.