A Scalable Conflict-Free Replicated Set Data Type

Deftu, Andrei; Griebsch, Jan

doi:10.1109/icdcs.2013.10

Cited by 9 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For instance, LogootSplit seems more stable than TreeDoc, and RGA seems more stable than WOOTH. 7 https://github.com/popular/starred In remote execution, the results are more surprising compared to the synchronous experiments. SOCT2/TTF performances remain the worst, requiring hundreds time more than the average CRDT.…”

Section: Corpus Obtainedmentioning

confidence: 85%

“…For the set data types, in [7] the authors improved OR-Set algorithm and presented the result of its performance. The authors implemented a Java client library and perform the experiment in the real database, but the tool used remains private.…”

Section: Related Workmentioning

confidence: 99%

“…These repositories are selected among the most popular projects available on GitHub web site. 7 General performance The Table 7 presents the execution time of the different algorithms on three git repositories (git/git, joyent/node and twitter/bootstrap). The "commit" measure is the time required to execute all the local operations affecting the files in a repository divided by the number of commits.…”

Section: Corpus Obtainedmentioning

confidence: 99%

“…For each data type, many algorithms were proposed and claim that satisfy the EC model and suitable for users devices [7,17,26,30,33,35]. Among of them, some need a central server to order the updates, while the other supports decentralized architecture.…”

Section: Introductionmentioning

confidence: 99%

“…Among of them, some need a central server to order the updates, while the other supports decentralized architecture. CRDT [1,7,24,26,31,45] approaches were proposed in order to ensure convergence without blocking client operations and without having to deal with consensus. OT approaches [8,27] for a decentralized architecture have been proposed also.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Framework for Performance Evaluation of Decentralized Eventual Consistency Algorithms

Ahmed-Nacer¹,

Urso²

2017

EAI Endorsed Transactions on Collaborative Computing

View full text Add to dashboard Cite

Eventual Consistency (EC) model is adopted by numerous large-scale distributed systems. To ensure performance and scalability, this model allows any replica to accept updates without remote synchronization. Nowadays, many EC algorithms are developed to control the behavior of the replicated data in the face of concurrent updates. Among them, those using a central server to order the updates, while others support the decentralization. In this paper, we focus on decentralized EC algorithms. Suitability of such algorithms under users and devices constraints such as execution time, memory requirements, messages size and quality of the result remains to be investigated under different conditions. Evaluate such algorithms in different context and under different parameters require a framework.In this paper, we propose a generic framework designed to evaluate different decentralized EC algorithms, in different context by controlling different parameters. Our framework provides a generic simulator that generates a runnable data following different parameters.

show abstract

Section: Corpus Obtainedmentioning

confidence: 85%

Section: Related Workmentioning

confidence: 99%

Section: Corpus Obtainedmentioning

confidence: 99%