Distributed algorithm

A distributed algorithm is an algorithm that tries to solve a typical problem in distributed computing.

Here is a list of distributed algorithms by problem:

Leader Election

Consensus

Consensus Algorithms try to solve the problem of a number of processes agreeing on a common decision. More precisely, a Consensus protocol must satisfy the four formal properties below.

• Termination: every correct process decides some value.
• Validity: if all processes propose the same value ${\displaystyle v}$ , then every correct process decides ${\displaystyle v}$ .
• Integrity: every correct process decides at most one value, and if it decides some value ${\displaystyle v}$ , then ${\displaystyle v}$  must have been proposed by some process.
• Agreement: if a correct process decides ${\displaystyle v}$ , then every correct process decides ${\displaystyle v}$ .

A typical algorithm for solving consensus is the paxos algorithm.

Atomic commit

The atomic commit problem is a variant of the consensus Algorithms for solving the atomic commig protocol include the two-phase commit protocol and the three-phase commit protocol.

Reliable Broadcast

Causal Order/Total Order

Replication

ROWA, ROWAA, QA