Operational Transformation for Real-time Synchronization of Shared Workspace in Cloud Storage

Ng, Agustina; Sun, Changyin

doi:10.1145/2957276.2957278

Cited by 25 publications

(20 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They describe a state-based approach [21] with three stages, update detection, reconciliation and propagation. In contrast, operation-based approaches like [13,15] rely on a complete log of operations. Because some file systems (e.g.…”

Section: File Synchronizersmentioning

confidence: 99%

“…-Identity-vs. path-based model : as discussed in [23, section 3] the file system and its operations can be modeled using the identity-based approach where each object is identified by a unique ID, or by a path-based approach where objects are only identified by their path. ID-based approaches include [23,3,[10][11][12][13], for path-based approaches see [2,15,4,24]. -Hardlink support for files: an identity-based model may support that a specific file is linked exactly once, or several times.…”

Section: File System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Syncpal: A Simple and Iterative Reconciliation Algorithm for File Synchronizers

Shekow

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Today file synchronizers are tools often used to facilitate collaboration scenarios and data management across multiple devices. They replicate the file system, e.g. from a cloud storage to a device disk, achieving convergence by only transmitting detected changes. A popular variant available in a plethora of products are state-based file synchronizers such as the Dropbox client. They detect operations by computing the difference between a previously persisted state and the respective current state. However, state-based synchronization is difficult because we need to detect and resolve conflicting operations as well as the propagation order of non-conflicting operations. This work presents Syncpal, an algorithm that reconciles two divergent file systems using an iterative approach. It first handles conflicts, one at a time, making sure that resolving one conflict does not negatively affect other ones, while avoiding conflicts whenever possible. It then finds order dependencies (and breaks cycles) between the remaining non-conflicting operations to avoid the violation of operation preconditions during propagation. This work is relevant for file synchronizer researchers and developers who want to improve their products with an algorithm whose iterative nature reduces the overall complexity and the probability of bugs. In addition to our proposed algorithm and a formal analysis of the underlying problem, our validation approach for the proposed algorithm includes the presentation of a fullscale implementation of an exemplary file system model.

show abstract

Section: File Synchronizersmentioning

confidence: 99%

Section: File System Modelmentioning

confidence: 99%

Syncpal: A Simple and Iterative Reconciliation Algorithm for File Synchronizers

Shekow

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Similar to file-level editing operations, when two project-level editing operations target source code items in one directory or in hierarchically-related directories, they may also conflict with each other and result in inconsistent source code trees. To support consistency maintenance in project-level sessions, we have adopted conflict resolution and consistency maintenance techniques that have been proposed and widely applied in prior studies [39][40][41].…”

Section: Consistency Maintenance In Project-level Sessionsmentioning

confidence: 99%

CoVSCode: A Novel Real-Time Collaborative Programming Environment for Lightweight IDE

Fan

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

Real-time collaborative programming is an emerging approach that supports a team of programmers to view and edit shared source code at the same time. Each programmer can edit any part of the source code, and changes become instantly visible at other collaborating sites. With a broad range of application scenarios and benefits, real-time collaborative programming has attracted increasing interest from academia and industry. Lightweight integrated development environments (lightweight IDEs) have rapidly grown in popularity in the recent years, but there are serious problems and limitations with existing real-time collaboration support for lightweight IDEs. In this study, we contribute a novel real-time collaborative programming environment named CoVSCode that supports unconstrained and flexible real-time collaboration based on Visual Studio Code, one of the most popular and widely used lightweight IDEs. We present design objectives and rationales, the workflow and functional design from collaborating programmers’ perspectives, major technical issues and solutions, and prototype implementation, as well as a set of experimental evaluations that have demonstrated the technical feasibility and good performance of the prototype system. All approaches, techniques and solutions derived in this work are generic, which can also be applied in building real-time collaborative programming environments for other lightweight IDEs.

show abstract

“…Human-to-human collaboration is becoming more and more critical in modern highly dispersed organizations and teams. Computer-supported collaborative systems enable geographically separated people working together to achieve a common goal through computer networks [1][2][3][4][5][6][7][8][9][10][11]. These systems provide strong technical supports for human-to-human collaboration [12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

“…As an optimistic concurrency control approach, OT coordinates concurrent editing operations by transforming and executing the operations in the transformed forms rather than the original forms. Transformation of operations is the key for OT technique to support a wide range of collaborative applications [2,8,9,[16][17][18].…”

Section: Introductionmentioning

confidence: 99%

A semi-transparent selective undo algorithm for multi-user collaborative editors

Cai

et al. 2021

Front. Comput. Sci.

View full text Add to dashboard Cite

Multi-user collaborative editors are useful computer-aided tools to support human-to-human collaboration. For multi-user collaborative editors, selective undo is an essential utility enabling users to undo any editing operations at any time. Collaborative editors usually adopt operational transformation (OT) to address concurrency and consistency issues. However, it is still a great challenge to design an efficient and correct OT algorithm capable of handling both normal do operations and user-initiated undo operations because these two kinds of operations can interfere with each other in various forms. In this paper, we propose a semi-transparent selective undo algorithm that handles both do and undo in a unified framework, which separates the processing part of do operations from the processing part of undo operations. Formal proofs are provided to prove the proposed algorithm under the well-established criteria. Theoretical analysis and experimental evaluation are conducted to show that the proposed algorithm outperforms the prior OT-based selective undo algorithms.

show abstract

Operational Transformation for Real-time Synchronization of Shared Workspace in Cloud Storage

Cited by 25 publications

References 24 publications

Syncpal: A Simple and Iterative Reconciliation Algorithm for File Synchronizers

Syncpal: A Simple and Iterative Reconciliation Algorithm for File Synchronizers

CoVSCode: A Novel Real-Time Collaborative Programming Environment for Lightweight IDE

A semi-transparent selective undo algorithm for multi-user collaborative editors

Contact Info

Product

Resources

About