• Corpus ID: 12818469

Eventually Returning to Strong Consistency

@article{Vukolic2016EventuallyRT,
  title={Eventually Returning to Strong Consistency},
  author={Marko Vukolic},
  journal={IEEE Data Eng. Bull.},
  year={2016},
  volume={39},
  pages={39-44}
}
  • M. Vukolic
  • Published 2016
  • Computer Science
  • IEEE Data Eng. Bull.
Eventually and weakly consistent distributed systems have emerged in the past decade as an answer to scalability and availability issues associated with strong consistency semantics, such as linearizability. However, systems offering strong consistency semantics have an advantage over systems based on weaker consistency models, as they are typically much simpler to reason about and are more intuitive to developers, exhibiting more predictable behavior. Therefore, a lot of research and… 
View Paper
20 Citations
Highly Influential Citations
1
Background Citations
11

20 Citations

Consistency models in distributed systems: A survey on definitions, disciplines, challenges and applications

TLDR
This research proposes two different categories of consistency models, which are categorized into three groups of data-centric, client-centric and hybrid models, each of which is then grouped into three subcategories of traditional, extended, and novel consistency models.

ENGAGE: Session Guaranties for the Edge

TLDR
ENGAGE is presented, a storage system that combines the use of vector clocks and distributed metadata propagation services to offer efficient support for session guarantees in a partially replicated edge storage.

Making Speculative BFT Resilient with Trusted Monotonic Counters

TLDR
SACZyzzyva is proved to be optimally robust and that trusted components cannot increase fault tolerance unless they are present in at least two-thirds of replicas, demonstrating low latency and high scalability.

Revisiting Practical Byzantine Fault Tolerance Through Blockchain Technologies

TLDR
It is highlighted that Byzantine fault tolerance should be considered a practical and fundamental building block for modern long-running and safety critical systems and that the principles, mechanisms, and blockchain technologies themselves could help improve the security and quality of such systems.

SoK: Communication Across Distributed Ledgers

TLDR
This Systematization of Knowledge (SoK) offers a comprehensive guide for designing protocols bridging the numerous distributed ledgers available today and aims to facilitate clearer communication between academia and industry in the cross-chain setting.

Consensus in the Age of Blockchains

TLDR
A systematic and comprehensive study of blockchain consensus protocols is conducted, developing a framework to evaluate their performance, security and design properties, and using it to systematize key themes in the protocol categories described above.

SoK: Consensus in the Age of Blockchains

TLDR
This survey highlights the various building blocks of blockchain consensus design, along with a discussion on their security and performance properties, and identifies research gaps and insights for the community to consider in future research endeavours.

Blockchains: Distributed Consensus Protocols

  • Computer Science, Mathematics
  • 2017
TLDR
It is suggested that the Proof-of-Capacity (PoC) protocol can be future proofed, better than the alternative protocols, against resource centralisation.

SoK: Exploring Blockchains Interoperability

  • Gang Wang
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 2021
TLDR
This paper provides a systematic and comprehensive review of the current progress of blockchain interoperability and surveys and compares the state-of-the-art solutions to deal with the interoperability of blockchains in detail.

Renovating blockchain with distributed databases: An open source system

...
...

References

SHOWING 1-10 OF 48 REFERENCES

Consistency in Non-Transactional Distributed Storage Systems

TLDR
This article provides a structured and comprehensive overview of different consistency notions that appeared in distributed systems, and in particular storage systems research, in the last four decades, and defines precisely many of these, in particular where the previous definitions were ambiguous.

No compromises: distributed transactions with consistency, availability, and performance

TLDR
It is shown that a main memory distributed computing platform called FaRM can provide distributed transactions with strict serializability, high performance, durability, and high availability in modern data centers.

Conflict-Free Replicated Data Types

TLDR
This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions and studies a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and considers in depth the more complex Graph data type.

Towards robust distributed systems (abstract)

TLDR
Several issues in an attempt to clean up the way the authors think about distributed systems, including the fault model, high availability, graceful degradation, data consistency, evolution, composition, and autonomy are looked at.

Managing update conflicts in Bayou, a weakly connected replicated storage system

TLDR
The motivation for and design of these mechanisms for conflict detection and per -write conflict resolution based on client-provid ed procedures are presented and the experiences gained with an initial implementation of the system are described.

Designing Distributed Systems Using Approximate Synchrony in Data Center Networks

TLDR
This paper explores network-level mechanisms for providing Mostly-Ordered Multicast (MOM): a best-effort ordering property for concurrent multicast operations, and designs Speculative Paxos, a state machine replication protocol that relies on the network to order requests in the normal case.

Spanner: Google's Globally-Distributed Database

TLDR
This article describes how Spanner is structured, its feature set, the rationale underlying various design decisions, and a novel time API that exposes clock uncertainty, critical to supporting external consistency and a variety of powerful features.

Consensus in a Box: Inexpensive Coordination in Hardware

TLDR
It is shown that consensus (atomic broadcast) can be removed from the critical path of performance by moving it to hardware by using an FPGA and combined with a mainmemory key value store running on specialized microservers results in a distributed service similar to Zookeeper that exhibits high and stable performance.

Linearizability: a correctness condition for concurrent objects

TLDR
This paper defines linearizability, compares it to other correctness conditions, presents and demonstrates a method for proving the correctness of implementations, and shows how to reason about concurrent objects, given they are linearizable.

DARE: High-Performance State Machine Replication on RDMA Networks

TLDR
A new set of protocols based on Remote Direct Memory Access (RDMA) primitives, using a strongly consistent key-value store, are proposed that enable operators to fully utilize the new capabilities of the quickly growing number of RDMA-capable datacenter networks.
...
...