Geek Answers Handbook

Are there general algorithms for achieving final consistency in distributed systems?

Are there any algorithms that are commonly used to achieve ultimate consistency in distributed systems?

There are algorithms that were developed for ACID transactions in distributed systems, Paxos in particular, but is there a similar theory structure designed for BASE scenarios with weaker sequence guarantees?

Edit: This seems to be a field of research that is just starting to develop. Mcdowella's answer shows that there has been at least some work in this area.

+5
source share
2 answers

If "Anti-entropy protocols for restoring replicated data that work by comparing replicas and reconciling differences." suitable for your definition at http://en.wikipedia.org/wiki/Gossip_protocol

+4
source

BASE and weaker consistency boil down to convergence of copies in a replication scenario. There is a lot of literature on replication in a distributed system, with impatient or lazy replication, with group or main copy, etc.

Consensus - , . /. . , . , , , , .

, , , :

+2

More articles:


All Articles