Presentation is loading. Please wait.

Presentation is loading. Please wait.

ACM Group 2005 Conference Consistency Maintenance Based on the Mark & Retrace Technique in Groupware Systems Ning Gu, Jiang-Ming Yang and Qi-Wei Zhang.

Similar presentations


Presentation on theme: "ACM Group 2005 Conference Consistency Maintenance Based on the Mark & Retrace Technique in Groupware Systems Ning Gu, Jiang-Ming Yang and Qi-Wei Zhang."— Presentation transcript:

1 ACM Group 2005 Conference Consistency Maintenance Based on the Mark & Retrace Technique in Groupware Systems Ning Gu, Jiang-Ming Yang and Qi-Wei Zhang Fudan University Jiang-Ming Yang

2 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory2 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

3 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory3 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

4 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory4 INTRODUCTION Whats Group Editors? Most commonly used groupware applications. Multiple users participation User can edit and modify shared data objects, such as word, graphics, and media documents, using a computer network. Techniques for building group editors have been widely applied and practiced. A Powerful research vehicles in exploring solution to consistency problems.

5 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory5 MOTIVATION & CHALLENGE In the past decade, OT method has been gradually improved. Control Algorithms OT Functions An OT algorithm which can maintains the CCI model and solved TP2 puzzle and false-tie (ERV) puzzle will be very intricate.

6 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory6 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

7 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory7 ADDRESS SPACE TRANSFORMATION Example 1: Initial document is abd. O 4 and O 5 are two concurrent operations. In OT Technique, due to the existence of concurrent operation O 4, O 5 shall be transformed to Insert [c, 2] before execution on site U 1.

8 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory8 ADDRESS SPACE TRANSFORMATION

9 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory9 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

10 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory10 THE STRUCTURE OF MARK & RETRACE A document is a liner structure composed of characters. Each character may have several operations targeting itself while each operation targets only one character. Add the effective / ineffective mark information to every node in the liner structure. The address space can be expressed as the effective character nodes from left to right.

11 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory11 THE RETRACING PROCEDURE The goal of the Retracing procedure is to retrace the address space to the state at a given timestamp SV. Consider the following four situations. if SV Oins SV, then this node is marked ineffective; if SV Oins SV and there is no Delete targeting this character node, then this node is marked effective; if SV Oins SV and SV Odel SV, then this node is marked effective; if SV Oins SV but SV Odel SV, then this node is marked ineffective.

12 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory12 THE CONTROL ALGORITHM Control-Algorithm (Doc S, O), execute O on Doc S. Retracing(Doc S, SV O ) Execute the operation O, and attach the operation with its timestamp to the character node. SV S [R] SV S [R] + 1 Retracing(Doc S, SV S )

13 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory13 EXAMPLE 1: Effective node & ineffective node User U 1 intends to execute operation Insert[c, 3] with timestamp. Users view is ad.

14 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory14 EXAMPLE 1: First, retrace the document to the state at the time of timestamp. Conceal the effect of operation Delete[b, 2]. Character node b become Effective. Users view is abd.

15 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory15 EXAMPLE 1: The documents state at the time of timestamp is the state at the time of operations ( Insert [c, 3] ) generation. Operation Insert [c, 3] can be executed directly in this new address space.

16 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory16 EXAMPLE 1: The State Vector of the local site has been adjusted to after the execution is finished. And then it retraces to the view acd of new State Vector by restoring the effect of operation Delete[b, 2] and adding the execution effect of the new operation Insert[c, 3].

17 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory17 OPERATION EXECUTION The Delete operations execution is simple. The process is to find the corresponding character node, attach the operation on the character node and then perform the Retracing procedure to give this node a correct effective/ineffective mark. The Insert is to search for an Inserting position in the address space, which is corresponding to a range in document between two effective character nodes. There may exist some other ineffective character nodes in this range. A Range-Scan process to determine the right-and-left relation between the new Insert and these ineffective character nodes and then find an accurate position.

18 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory18 OPERATION EXECUTION To realize the comparability between two Insert operations, define a TOrder function: Given two character nodes CN a and CN b. The attached operations are generated at site a and site b, and are timestamped by SV a and SV b. TOrder(CN a ) < TOrder(CN b ), iff sum(SV a ) < sum(SV b ) a < b, when sum(SV a ) = sum(SV b ) Where sum(SV) =

19 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory19 OPERATION EXECUTION INSERT RULES: 1) The new character node should be inserted in the range. 2) If there is a existed character node CN, the insert operation of CN is causally before CN new, CN new should be inserted on the left of CN. 3) If there is a existed character node CN 1, TOrder(CN new )TOrder(CN 2 ) CN 2 is causally before CN 1

20 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory20 OPERATION EXECUTION INSERT EXECUTION: Scan the range from left to right. If there is a existed character node meets the rule 2, return this position immediately. If there is a existed character node meets the rule 3, record this position into a variable P. If the record meets the rule 4, clean the record.

21 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory21 CAUSALITY PRESERVATION To achieve causality preservation, we only need to ensure that every remote operation is causally- ready before its execution, which we call execution condition. It should be noted that even if causality is preserved, the execution order of the operations would still be different because of their different orders of arrival at different sites.

22 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory22 CONVERGENCE The Proof 2 operations Same Scan-Ranges Different Scan-Ranges n operations

23 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory23 INTENTION PRESERVATION Since a Insert operation can find the correct scan-range and a Delete operation can find its corresponding character node at any sites and they do not interfere with other operations, those satisfy operations definition. However, there are still some arguments about the proof of achieving intention preservation, we plan to present more about intentions formal definition and the complete proof in the next future.

24 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory24 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

25 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory25 OPERATION EXECUTION EFFICIENCY Reorganize the character nodes to a Red-Black Tree and ensure the result of pre-order traversal of the Black-Red tree is the original linear order. Every node of the tree saves two additional data the two numbers of the effective character nodes of left sub-tree and right sub-tree. The amortized costs of Insert and Delete are both O(logn).

26 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory26 EFFICIENCY OPTIMIZATION OF RETRACING Use the Garbage Collection method to handle a operation list containing the operations which havent been executed at some sites. Suppose the length of operation list is h which means we need to check and change at most h character nodes effective/ineffective mark during Retracting process. In the second Retracing process, we restore the changed nodes instead of the Retracing process. After then, we only need to deal with the targeting character node of the new operation.

27 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory27 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

28 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory28 UNDO SUPPORTED Given an Undo operation O 2, Undo[O 1 ], in which O 1 s target position is P 1 and timestamped by SV O1. The execution process can be performed as follow. Retrace the address space to the state at the time SV O1 ; count to the P 1 th effective character node and attach O 2 on it. Then the second Retracing process takes this new Undo into consideration and gives this node the correct effective / ineffective mark. Append a Delete counter to every character node to realize the Multi-version / Single-display strategy.

29 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory29 OUTLINE Introduction & Motivation Address Space Transformation Mark & Retrace Technique Efficiency Analysis Undo Supported Related Works & Conclusions

30 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory30 RELATED WORKS The initial concept of Mark & Retrace was proposed early in Document Mark Technique but was not able to solve the dOPT puzzle. dOPT, adOPTed and GOTO cannot fully satisfy TP2. NICE and SOCT3/4 is not able to resolve the false-tie (ERV) puzzle. GOT fail in the case of complicated false-tie (ERV) scenarios. Imine et al. tried to support TP2 by expanding IT function but fails in solving dOPT puzzle. A solution of false-tie (ERV) has been realized in Co-Word system, it is still not published. Li et al. also reported a solution and gave the proof.

31 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory31 CONCLUSIONS In this paper we propose a strategy which can maintain CCI model and is different from OT. It does not ensure the operations execution correctness by modifying the operations address but by transforming the address space of the document. Since the Mark & Retrace processes do not affect the relative position (left or right) between characters, it is easier to maintain operations order. It can not only achieve all the consistency criteria, but can support any Undo as well.

32 ACM Group 2005 Conference February 15, 2014Fudan University, Cooperative Information and Systems Laboratory32 Thanks!


Download ppt "ACM Group 2005 Conference Consistency Maintenance Based on the Mark & Retrace Technique in Groupware Systems Ning Gu, Jiang-Ming Yang and Qi-Wei Zhang."

Similar presentations


Ads by Google