Number of the records: 1
Synchronizing many filesystems in near linear time
- 1.
SYSNO ASEP 0575801 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Synchronizing many filesystems in near linear time Author(s) Csirmaz, E. P. (HU)
Csirmaz, Laszlo (UTIA-B) ORCIDNumber of authors 2 Article number 198 Source Title Future Internet. - : MDPI - ISSN 1999-5903
Roč. 15, č. 6 (2023)Number of pages 26 s. Publication form Online - E Language eng - English Country CH - Switzerland Keywords file synchronization ; algebraic model ; optimistic synchronization ; linear complexity Subject RIV BA - General Mathematics OECD category Applied mathematics Method of publishing Open access Institutional support UTIA-B - RVO:67985556 UT WOS 001014411200001 EID SCOPUS 85163789510 DOI https://doi.org/10.3390/fi15060198 Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2024 Electronic address https://www.mdpi.com/1999-5903/15/6/198
Number of the records: 1