LICRA: A replicated-data management algorithm for distributed synchronous groupware applications

38Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Replicated data consistency is a key issue in the design of distributed real time groupware applications. In this paper, we propose a new protocol to cope with this problem. The proposed algorithm guarantees an optimal response time while ensuring data consistency at system quiescence. The originality of our proposition relies on the fact that neither locks nor clocks nor global information are required to establish data consistency. Instead, direct dependency relations between generated operations as well as operation transformation mechanism are used. The coupling of the above two mentioned mechanisms is shown to realize a good trade-off between the different requirements of groupware applications. Advantages of our approach are illustrated by comparing the algorithm to two well known optimistic concurrency control protocols for groupware applications: dOPT and ORESTE.

Cite

CITATION STYLE

APA

Kanawati, R. (1997). LICRA: A replicated-data management algorithm for distributed synchronous groupware applications. Parallel Computing, 22(13), 1733–1746. https://doi.org/10.1016/s0167-8191(96)00074-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free