Groupware: some issues and experiences
Communications of the ACM
A Case Study of CES: A Distributed Collaborative Editing System Implemented in Argus
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Operational transformation in real-time group editors: issues, algorithms, and achievements
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
Optimal locking integrated with operational transformation in distributed real-time group editors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Undo any operation at any time in group editors
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
Optional and Responsive Fine-Grain Locking in Internet-Based Collaborative Systems
IEEE Transactions on Parallel and Distributed Systems
An Internet Collaborative Environment for Sharing Java Applications
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
A general multi-user undo/redo model
ECSCW'95 Proceedings of the fourth conference on European Conference on Computer-Supported Cooperative Work
Hi-index | 0.00 |
In order to meet the requirements of high responsiveness and unconstrained collaboration in real-time collaborative editing systems, this paper proposes a novel multi-granularity optimistic locking scheme for concurrency control in collaborative editing systems based on relative position. In the proposed scheme, reading lock and editing lock are taken into account, and the start position of locking region and that of operation are relative, and they are not transformed into absolute positions until operations are sent to collaborative sites or locks are added into lock table. Additionally, the granularity of lock can be selected by co-editors optionally, and any co-editor can edit the locking region without being blocked before his/her requested lock is confirmed. The application case study shows that this concurrency control scheme has advantages of high responsiveness, unconstrained collaboration, and good data consistency maintenance.