Synchronizing many filesystems in near linear time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F23%3A00575801" target="_blank" >RIV/67985556:_____/23:00575801 - isvavai.cz</a>
Result on the web
<a href="https://www.mdpi.com/1999-5903/15/6/198" target="_blank" >https://www.mdpi.com/1999-5903/15/6/198</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/fi15060198" target="_blank" >10.3390/fi15060198</a>
Alternative languages
Result language
angličtina
Original language name
Synchronizing many filesystems in near linear time
Original language description
Finding a provably correct subquadratic synchronization algorithm for many filesystem replicas 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 suite which synchronizes an arbitrary number of replicas. The result is provably correct, and the synchronized system is created in linear space and time after an initial sorting phase. It works by identifying conflicting command pairs and requesting one of the commands to be removed. The method can be guided to reach any of the theoretically possible synchronized states. The algorithm also allows asynchronous usage. After the client sends a synchronization request, the local replica remains available for further modifications. When the synchronization instructions arrive, they can be merged with the changes made since the synchronization request. The suite also works on filesystems with a directed acyclic graph-based path structure in place of the traditional tree-like arrangement. Consequently, our algorithms apply to filesystems with hard or soft links as long as the links create no loops.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Future Internet
ISSN
1999-5903
e-ISSN
1999-5903
Volume of the periodical
15
Issue of the periodical within the volume
6
Country of publishing house
CH - SWITZERLAND
Number of pages
26
Pages from-to
198
UT code for WoS article
001014411200001
EID of the result in the Scopus database
2-s2.0-85163789510