In:
McGill Science Undergraduate Research Journal, McGill University Library and Archives, Vol. 8, No. 1 ( 2013-03-31), p. 62-68
Abstract:
Modern cooperative software systems involve multiple concurrent users undertaking a common task in a real-time distributed environment, such as editing a shared text document. Maintaining data consistency, transaction causality, and replication convergence in such an environment, while providing fast client responsiveness, is a substantial challenge for classical distributed computing techniques. Operational transformation (OT) is a class of concurrency algorithms and data models that supports these functionalities, which has drawn significant research attention in the past decade. In this review, we discuss the basic components of operational transformation models, the algorithms involved, and their actual implementations in real-world networked systems. We compare several existing OT control algorithms, the transformation functions and properties supported by each of the algorithms, and the trade-offs that are made with respect to each one. The data and operational models used in OT are well suited for high- latency environments such as the Internet, making them more frequently used in modern web services. Although many different OT control algorithms exist, choosing the most effective one often depends on the particular operations that an application must support.
Type of Medium:
Online Resource
ISSN:
1718-0783
,
1718-0775
DOI:
10.26443/msurj.v8i1.113
Language:
Unknown
Publisher:
McGill University Library and Archives
Publication Date:
2013
detail.hit.zdb_id:
2418993-5
Permalink
