Pascal Molli

Pascal Molli

Auto-generated profile, based on publicly available information

Pascal Molli


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2010 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SWStephane Weiss
Stephane Weiss
PUPascal Urso
Pascal Urso
PMPascal Molli
Pascal Molli
Peer-to-peer systems provide scalable content distribution for cheap and resist to censorship attempts. However, P2P networks mainly distribute immutable content and provide poor support for highly dynamic content such as produced by collaborative systems. A new class of algorithms called CRDT (Commutative Replicated Data Type), which ensures consistency of highly dynamic content on P2P networks, is emerging. However, if existing CRDT algorithms support the "edit anywhere, anytime” feature, they do not support the "undo anywhere, anytime” feature. In this paper, we present the Logoot-Undo CRDT algorithm, which integrates the "undo anywhere, anytime” feature. We compare the performance of the proposed algorithm with related algorithms and measure the impact of the undo feature on the global performance of the algorithm. We prove that the cost of the undo feature remains low on a corpus of data extracted from Wikipedia.

1 January 2003
Verified
Book Chapter
Closed access
PDF file
AIAbdessamad Imine
Abdessamad Imine
PMPascal Molli
Pascal Molli
GOGérald Oster
Gérald Oster
MRMichaël Rusinowitch
Michaël Rusinowitch

21 February 2006 in Theoretical Computer Science
Verified
Journal Article
Closed access
PDF file
AIAbdessamad Imine
Abdessamad Imine
MRMichaël Rusinowitch
Michaël Rusinowitch
GOGérald Oster
Gérald Oster
PMPascal Molli
Pascal Molli

1 November 2006
Verified
Conference Paper
Closed access
GOG/L=E'/Rald Oster
G/L=E'/Rald Oster
PMPascal Molli
Pascal Molli
PUPascal Urso
Pascal Urso
AIAbdessamad Imine
Abdessamad Imine
In collaborative editing, consistency maintenance of the copies of shared data is a critical issue. In the last decade, operational transformation (OT) approach revealed as a suitable mechanism for maintaining consistency. Unfortunately, none of the published propositions relying on this approach are able to satisfy the mandatory correctness properties TP1 and TP2 defined in the Ressel's framework. This paper addresses this correctness issue by proposing a new way to model shared state by retaining tombstones when elements are removed. An instantiation of the proposed model for a linear data structure and the related transformation functions are provided

30 October 2015
Verified
Book Chapter
Closed access
PDF file
GMGabriela Montoya
Gabriela Montoya
HSHala Skaf-Molli
Hala Skaf-Molli
PMPascal Molli
Pascal Molli
MVMaria-Esther Vidal
Maria-Esther Vidal

1 August 2017 in World Wide Web
Verified
Journal Article
Closed access
PDF file
BNBrice Nédelec
Brice Nédelec
JTJulian Tanke
Julian Tanke
DFDavide Frey
Davide Frey
PMPascal Molli
Pascal Molli
AMAchour Mostéfaoui
Achour Mostéfaoui