Exploring data reliability tradeoffs in replicated storage systems

A Gharaibeh, M Ripeanu - Proceedings of the 18th ACM international …, 2009 - dl.acm.org
This paper explores the feasibility of a cost-efficient storage architecture that offers the
reliability and access performance characteristics of a high-end system. This architecture …

Probabilistically bounded staleness for practical partial quorums

P Bailis, S Venkataraman, MJ Franklin… - arXiv preprint arXiv …, 2012 - arxiv.org
Data store replication results in a fundamental trade-off between operation latency and data
consistency. In this paper, we examine this trade-off in the context of quorum-replicated data …

Don't settle for eventual: scalable causal consistency for wide-area storage with COPS

W Lloyd, MJ Freedman, M Kaminsky… - Proceedings of the …, 2011 - dl.acm.org
Geo-replicated, distributed data stores that support complex online applications, such as
social networks, must provide an" always-on" experience where operations always complete …

Addressing the read-performance impact of reconfigurations in replicated key-value stores

A Papaioannou, K Magoutis - IEEE Transactions on Parallel …, 2021 - ieeexplore.ieee.org
Raw data are often orders of magnitude larger than main memory for many applications. As
the performance of storage devices is still significantly slower than main memory, systems …

A new adaptive causal consistency approach in edge computing environment

A Khelaifa, S Benharzallah… - International Journal of …, 2022 - journals.uob.edu.bh
Edge computing is a new computing paradigm that has emerged to offload computation and
storage to edge devices in order to get a shorter response time and more efficient …

[PDF][PDF] Chain Replication for Supporting High Throughput and Availability.

R Van Renesse, FB Schneider - OSDI, 2004 - usenix.org
Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The
approach is intended for supporting large-scale storage services that exhibit high throughput …

Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed Study

SP Kumar, S Lefebvre, R Chiky, O Hermant - Advances in Knowledge …, 2018 - Springer
In multi-writer, multi-reader systems, data consistency is ensured by the number of replica
nodes contacted during read and write operations. Contacting a sufficient number of nodes …

Paris: Causally consistent transactions with non-blocking reads and partial replication

K Spirovska, D Didona… - 2019 IEEE 39th …, 2019 - ieeexplore.ieee.org
Geo-replicated data platforms are the backbone of several large-scale online services.
Transactional Causal Consistency (TCC) is an attractive consistency level for building such …

Causal Broadcast: How to Forget?

B Nédelec, P Molli, A Mostéfaoui - The 22nd International Conference …, 2018 - hal.science
Causal broadcast constitutes a fundamental communication primitive of many distributed
protocols and applications. However, state-of-the-art implementations fail to forget obsolete …

[图书][B] URA: A universal data replication architecture

J Zheng - 2008 - search.proquest.com
Data replication is a key building block for large-scale distributed systems to improve
availability, performance, and scalability. Because there is a fundamental trade-off between …