The Optimistic Locking Concurrency Controlling Algorithm Based on Relative Position and Its Application in Real-time Collaborative Editing System
Locking mechanism is a popular concurrency controlmechanism in distributed computing and database systemused to ensure data integrity by prohibiting concurrentconflicting updates on shared data objects. The responseof traditional locking is slow, so it cant be used asconcurrency controlling strategy for real-time distributedcollaborative systems. In this paper, we proposed a novelresponsive fine-grain optimistic locking concurrencycontrolling algorithm based on relative position forconsistency maintenance in real-time distributedcollaborative systems. In this algorithm, reading lock andediting lock are taken into account. Moreover, the startposition of locking region and the position of operationare relative, and they are not transformed into absoluteposition until operations are sent to cooperative sites orlocks are added into LT. Additionally, the lockinggranularity can be selected by editors optionally. And anycoeditor can edit in advance before his/her requested lockis confirmed. If the request is confirmed, the previousoperations go into effect, or else undo these previousoperations. In the end, this algorithm is used in ourcooperative editing system, and we can find that thepossibility of undo the previous editing operationsbecause of locking conflict is very little. So thisconcurrency controlling algorithm has virtues of quickresponsiveness, unconstraint collaboration and nice dataconsistency maintenance etc.
Qirong Mao Jinfeng Wang Yongzhao Zhan
Computer Science Dept.of Jiangsu University,Zhengjiang,China
国际会议
厦门
英文
99-105
2004-05-26（万方平台首次上网日期，不代表论文的发表时间）