摘要
Traditional locking mechanism is fit for the concurrency controlling and data consistency maintenance undercentralized architecture, but its response is slow, so it can not be used as concurrency controlling strategy for real-time distributed cooperative editing system. Moreover, operation transformation and data consistency maintenancetechnology are able to assure of quick response and unconstraint, but can't solve the context-specific inconsistencyproblems. Enlightened by the idea of operation transformation and optimistic locking mechanism, we bring forwardthe concurrency control algorithm of optimistic locking based on relative position. In this algorithm, the start positionof locking region and the position of operation are relative, and they are not transformed into absolute position untiloperations are sent to cooperative sites. Furthermore, any coeditor can edit in advance before his/her locking is con-firmed. If his/her locking is successful, the previous operations go into effect, or else undo these previous operations.We have analyzed the actual applications and can find that the possibility of undoing the previous editing operationsbecause of locking conflict is very little. So this concurrency controlling algorithm has virtues of quick response, nicedata consistency maintenance etc.
Traditional locking mechanism is fit for the concurrency controlling and data consistency maintenance under centralized architecture, but its response is slow, so it can not be used as concurrency controlling strategy for realtime distributed cooperative editing system. Moreover, operation transformation and data consistency maintenance technology are able to assure of quick response and unconstraint, but can't solve the context-specific inconsistency problems. Enlightened by the idea of operation transformation and optimistic locking mechanism, we bring forward the concurrency control algorithm of optimistic locking based on relative position. In this algorithm, the start position of locking region and the position of operation are relative, and they are not transformed into absolute position until operations are sent to cooperative sites. Furthermore, any coeditor can edit in advance before his/her locking is confirmed. If his/her locking is successful, the previous operations go into effect, or else undo these previous operations. We have analyzed the actual applications and can find that the possibility of undoing the previous editing operations because of locking conflict is very little. So this concurrency controlling algorithm has virtues of quick response, nice data consistency maintenance etc.
出处
《计算机科学》
CSCD
北大核心
2003年第7期126-129,共4页
Computer Science
基金
国家自然科学基金(60273040)
教育部科学技术研究重点项目
江苏省高校自然科学基金项目(02KJB520003)
关键词
实时分布式协同编辑系统
乐观锁
并发控制算法
相对位置
应用软件
CSCW
Real-time distributed cooperative editing, Relative position, Optimistic locking mechanism, Concurrency controlling, Consistency