Synchronizing Many Filesystems in Near Linear Time

by   Elod P. Csirmaz, et al.

Finding a provably correct subquadratic synchronization algorithm for many filesystems is one of the main theoretical problems in Operational Transformation (OT) and Conflict-free Replicated Data Types (CRDT) frameworks. Based on the Algebraic Theory of Filesystems, which incorporates non-commutative filesystem commands natively, we developed and built a proof-of-concept implementation of an algorithm which synchronizes an arbitrary number of replicas. It is provably correct, and has linear complexity after an initial sorting phase. It works by identifying conflicting command pairs and requesting one of them to be removed; can be guided to reach any of the theoretically possible synchronized states. The algorithm allows asynchronous usage. After the client sends a synchronization request, the local replica remains available for further modification. When the synchronization instructions arrive, they can be merged with the changes made since the synchronization request. It also works on filesystems with directed acyclic graph-based path structure in place of the traditional tree-like one. Thus it can be applied to filesystems with hard or soft links as long as the links create no loops.


page 1

page 2

page 3

page 4


Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle

We correct a paper previously submitted to CoRR. That paper claimed that...

A Precedence-Driven Approach for Concurrent Model Synchronization Scenarios using Triple Graph Grammars

Concurrent model synchronization is the task of restoring consistency be...

Efficient Synchronization of State-based CRDTs

Data consistency often needs to be sacrificed in order to ensure high-av...

Data Synchronization: A Complete Theoretical Solution for Filesystems

Data reconciliation in general, and filesystem synchronization in partic...

Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars

Model synchronization, i.e., the task of restoring consistency between t...

Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Reconfigurable broadcast networks provide a convenient formalism for mod...

Please sign up or login with your details

Forgot password? Click here to reset