Telex: Principled System Support for Write-Sharing in Collaborative Applications
📝 Abstract
The Telex system is designed for sharing mutable data in a distributed environment, particularly for collaborative applications. Users operate on their local, persistent replica of shared documents; they can work disconnected and suffer no network latency. The Telex approach to detect and correct conflicts is application independent, based on an action-constraint graph (ACG) that summarises the concurrency semantics of applications. The ACG is stored efficiently in a multilog structure that eliminates contention and is optimised for locality. Telex supports multiple applications and multi-document updates. The Telex system clearly separates system logic (which includes replication, views, undo, security, consistency, conflicts, and commitment) from application logic. An example application is a shared calendar for managing multi-user meetings; the system detects meeting conflicts and resolves them consistently.
💡 Analysis
The Telex system is designed for sharing mutable data in a distributed environment, particularly for collaborative applications. Users operate on their local, persistent replica of shared documents; they can work disconnected and suffer no network latency. The Telex approach to detect and correct conflicts is application independent, based on an action-constraint graph (ACG) that summarises the concurrency semantics of applications. The ACG is stored efficiently in a multilog structure that eliminates contention and is optimised for locality. Telex supports multiple applications and multi-document updates. The Telex system clearly separates system logic (which includes replication, views, undo, security, consistency, conflicts, and commitment) from application logic. An example application is a shared calendar for managing multi-user meetings; the system detects meeting conflicts and resolves them consistently.
📄 Content
arXiv:0805.4680v3 [cs.OS] 10 Jun 2008 apport
de recherche SN 0249-6399 ISRN INRIA/RR–6546–FR+ENG Thème COM INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Telex: Principled System Support for Write-Sharing in Collaborative Applications Lamia Benmouffok — Jean-Michel Busca — Joan Manuel Marquès — Marc Shapiro — Pierre Sutra — Georgios Tsoukalas N° 6546 9 May 2008 Centre de recherche INRIA Paris – Rocquencourt Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le Chesnay Cedex Téléphone : +33 1 39 63 55 11 — Télécopie : +33 1 39 63 53 30 T elex: Prin ipled System Supp ort for W rite-Sharing in Collab orativ e Appli ations∗ Lamia Benmouok†‡ , Jean-Mi hel Bus a†‡ , Joan Man uel Marquès§‡ , Mar Shapiro†‡ , Pierre Sutra†‡ , Georgios T souk alas¶ Thème COM Systèmes omm uni an ts Équip e-Pro jet Regal Rapp ort de re her he n° 6546 9 Ma y 2008 28 pages Abstra t: The T elex system is designed for sharing m utable data in a dis- tributed en vironmen t, parti ularly for ollab orativ e appli ations. Users op erate on their lo al, p ersisten t repli a of shared do umen ts; they an w ork dis on- ne ted and suer no net w ork laten y . The T elex approa h to dete t and orre t on i ts is appli ation indep enden t, based on an a tion- onstrain t graph (A CG) that summarises the on urren y seman ti s of appli ations. The A CG is stored e ien tly in a multilo g stru ture that eliminates on ten tion and is optimised for lo alit y . T elex supp orts m ultiple appli ations and m ulti-do umen t up dates. The T elex system learly separates system logi (whi h in ludes repli ation, views, undo, se urit y , onsisten y , on i ts, and ommitmen t) from appli ation logi . An example appli ation is a shared alendar for managing m ulti-user meetings; the system dete ts meeting on i ts and resolv es them onsisten tly . Key-w ords: No k eyw ords ∗ This resear h is supp orted in part b y Respire (ANR, F ran e, respire.lip6.fr ), Grid4All (FP6, EU, www.grid4all.eu ) and gran t JC2007-00213 (Spain). † INRIA, P aris-Ro quen ourt, F ran e ‡ LIP6, P aris, F ran e § Univ ersitat Ob erta de Catalun y a, Bar elona, Spain ¶ National T e hni al Univ ersit y of A thens, Gree e T elex : un système de partage en é riture p our les appli ations ollab orativ es, basé sur un mo dèle formel Résumé : Le système T elex est onçu p our le partage des données mo di ables dans un en vironnemen t réparti, prin ipalemen t p our des appli ations ollab ora- tiv es. Les utilisateurs op èren t sur une opie lo ale et p ersistan te des do umen ts qu’ils partagen t ils p euv en t tra v ailler en mo de dé onne té, et ne son t pas ra- len tis par la laten e du réseau. T elex utilise une appro
he indép endan te de l’appli ation p our déte ter et orriger les on its, qui se base sur un graphe a tions- on train tes (A CG) qui résume la séman tique de on urren e des appli- ations. L’A CG est sto
k é de façon e a e dans une stru ture dite multi-journal qui élimine la on ten tion et est optimisée p our la lo alité. Des appli ations dif- féren tes s’exé uten t sur T elex, qui p ermet de mettre à jour plusieurs do umen ts de façon o ordonnée. T elex sépare propremen t la logique système ( e qui in lut la répli ation, les vues, le undo , la sé urité, la ohéren e, les on its, et la nalisation) de la logique appli ativ e. Un exemple d’appli ation est un alen- drier partagé, p our gérer des réunions m ulti-utilisateur le système déte te les on its de réunion et les résout de façon ohéren te. Mots- lés : P as de mot lef T elex: Prin iple d Sys. Supp ort for W rite-Sharing in Col lab. Apps. 3 1 In tro du tion The T elex system pro vides no v el solutions for write-sharing data in o-op erativ e and dis onne ted w ork settings. Existing approa hes ha v e sev ere limitations. F or instan e state ma hine repli ation [5 ℄ imp oses high laten y and do es not supp ort dis onne ted op era- tion. The p opular last-writer-wins algorithm [11 ℄ do es not ensure an y high-lev el orre tness guaran tees. 1 In on trast, T elex is based on a prin ipled approa h that om bines exibilit y and orre tness, and leanly separates appli ation logi from system logi . Appli ation logi transmits to T elex a tions (op erations) and onstrain ts ( on urren y in v arian ts), and applies exe ution s hedules transmitted b y T elex. In return, T elex tak es are of: repli ation, onsisten y , storage and a ess on- trol; olle ting, transmitting and p ersisting op erations; dete ting on i ts and omputing high-qualit y on i t-free s hedules; forw ard exe ution and rollba k;
he kp oin ting; ommitmen t; and a ess on trol. T elex supp orts m ulti-do umen t up dates and ross-appli ation s enarios out of the b o x. T elex is based on a prin ipled approa h, the A tion-Constrain t Graph (A CG) [12 ℄. W e designed the multilo g data stru ture to store A CG-based do
umen ts in a distributed le system. Multilogs elimin
This content is AI-processed based on ArXiv data.