Consensus (computer science)

consensusconsensus problemsdistributed consensusconsensus algorithmconsensus numberconsensus problemconsensus protocolFLP impossibility proof
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes.wikipedia
62 Related Articles

State machine replication

Examples of applications of consensus include whether to commit a transaction to a database, agreeing on the identity of a leader, state machine replication, and atomic broadcasts.
The problem of voting for a single value by a group of independent entities is called Consensus.

Atomic broadcast

Examples of applications of consensus include whether to commit a transaction to a database, agreeing on the identity of a leader, state machine replication, and atomic broadcasts.
Such considerations indicate that in systems with crash failures, atomic broadcast and consensus are equivalent problems.

Distributed computing

distributeddistributed systemsdistributed system
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes.
Examples of related problems include consensus problems, Byzantine fault tolerance, and self-stabilisation.

Paxos (computer science)

PaxosByzantine Paxosbasic Paxos protocol
The database is implemented on top of a fault-tolerant log layer which is based on the Paxos consensus algorithm.
Paxos is a family of protocols for solving consensus in a network of unreliable processors (that is, processors that may fail).

Dijkstra Prize

Edsger W. Dijkstra Prize in Distributed ComputingEdsger W. Dijkstra PrizePODC Influential Paper Award
This result is sometimes called the FLP impossibility proof named after the authors Michael J. Fischer, Nancy Lynch, and Mike Paterson who were awarded a Dijkstra Prize for this significant work.

Nancy Lynch

LynchNancy A. Lynch
This result is sometimes called the FLP impossibility proof named after the authors Michael J. Fischer, Nancy Lynch, and Mike Paterson who were awarded a Dijkstra Prize for this significant work.
Her 1985 work with Michael J. Fischer and Mike Paterson on consensus problems received the PODC Influential-Paper Award in 2001.

Michael J. Fischer

FischerMichael Fischer
This result is sometimes called the FLP impossibility proof named after the authors Michael J. Fischer, Nancy Lynch, and Mike Paterson who were awarded a Dijkstra Prize for this significant work.
His 1985 work with Nancy A. Lynch and Michael S. Paterson on consensus problems received the PODC Influential-Paper Award in 2001.

Byzantine fault

ByzantineByzantine FailuresByzantine fault tolerance
There are two types of failures a process may undergo, a crash failure or a Byzantine failure.
It is difficult for the other components to declare it failed and shut it out of the network, because they need to first reach a consensus regarding which component has failed in the first place.

Uniform consensus

Uniform consensus
In computer science, Uniform consensus is a distributed computing problem that is a similar to the consensus problem with one more condition which is no two processes (whether faulty or not) decide differently.

Multi-agent system

multi-agent systemsmulti-agentmultiagent systems
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes.

Leader election

Electionelection processleader
Examples of applications of consensus include whether to commit a transaction to a database, agreeing on the identity of a leader, state machine replication, and atomic broadcasts.

Clock synchronization

clock synchronisationlack of a global clocklocking" its clock
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

PageRank

page rankPRalgorithmic ranking model
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

Smart grid

Smart Gridssmart power gridsmart power grids
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

State observer

state estimationobserverstate estimator
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

Unmanned aerial vehicle

droneUAVdrones
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

Load balancing (computing)

load balancingload balancerload-balancing
The real world applications include clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs (and multiple robots/agents in general), load balancing and others.

Fault tolerance

fault-tolerantfault tolerantfault-tolerance
Some of the processes (agents) may fail or be unreliable in other ways, so consensus protocols must be fault tolerant or resilient.

Process (computing)

processprocessesprocessing
Protocols that solve consensus problems are designed to deal with limited numbers of faulty processes.

Big O notation

Obig-O notationΘ
Running time is given in Big O notation in the number of rounds of message exchange as a function of some input parameters (typically the number of processes and/or the size of the input domain).

Mike Paterson

PatersonMichael Stewart Paterson
This result is sometimes called the FLP impossibility proof named after the authors Michael J. Fischer, Nancy Lynch, and Mike Paterson who were awarded a Dijkstra Prize for this significant work.

Distributed lock manager

distributed lock serviceChubby Lock Servicelock manager
Google has implemented a distributed lock service library called Chubby.

Bitcoin

bitcoinsbitcoin walletBitcoin blockchain
Bitcoin uses proof of work to maintain consensus in its peer-to-peer network.

Proof-of-work system

proof-of-workproof of workreusable proof of work
Bitcoin uses proof of work to maintain consensus in its peer-to-peer network.

Peer-to-peer

P2Ppeer to peerpeer-to-peer network
Bitcoin uses proof of work to maintain consensus in its peer-to-peer network.