Distributed algorithm

distributed algorithmsdistributed
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.wikipedia
72 Related Articles

Distributed computing

distributeddistributed systemsdistributed system
Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control.
The word distributed in terms such as "distributed system", "distributed programming", and "distributed algorithm" originally referred to computer networks where individual computers were physically distributed within some geographical area.

Algorithm

algorithmsalgorithm designcomputer algorithm
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.

Two-phase commit protocol

two-phase committwo phase commit2-phase commit
It is a distributed algorithm that coordinates all the processes that participate in a distributed atomic transaction on whether to commit or abort (roll back) the transaction (it is a specialized type of consensus protocol).

Parallel algorithm

parallel algorithmsparallelparallelized
Distributed algorithms are a sub-type of parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having limited information about what the other parts of the algorithm are doing.
A subtype of parallel algorithms, distributed algorithms are algorithms designed to work in cluster computing and distributed computing environments, where additional concerns beyond the scope of "classical" parallel algorithms need to be addressed.

Three-phase commit protocol

In computer networking and databases, the three-phase commit protocol (3PC) is a distributed algorithm which lets all nodes in a distributed system agree to commit a transaction.

Graph coloring

chromatic numbercoloredcoloring
In the field of distributed algorithms, graph coloring is closely related to the problem of symmetry breaking.

Computer hardware

hardwarepersonal computer hardwaredevice
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.

Central processing unit

CPUprocessorprocessors
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.

Telecommunication

telecommunicationscommunicationstelecom
Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control.

Computational science

scientific computingscientific computationcomputational
Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control.

Information processing

processingprocessprocessing of information
Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control.

Process control

controlindustrial process controlProcess Controls
Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control.

Leader election

election processleaderminimum leader
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Consensus (computer science)

consensusconsensus problemsdistributed consensus
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Search algorithm

searchsearchingkeyword search
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Mutual exclusion

mutexesmutexmutex locks
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Resource allocation

allocationallocation of resourcesallocate
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Concurrency (computer science)

concurrencyconcurrentconcurrently
Distributed algorithms are a sub-type of parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having limited information about what the other parts of the algorithm are doing.

Non-blocking algorithm

non-blocking synchronizationLock-free and wait-free algorithmslock-free
; Non-blocking data structures

Spanning tree

spanning forestspanning treesspanning forests
Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Brooks–Iyengar algorithm

Brooks – Iyengar algorithmBrooks-Iyengar algorithm
The Brooks–Iyengar algorithm or Brooks–Iyengar hybrid algorithm is a distributed algorithm that improves both the precision and accuracy of the interval measurements taken by a distributed sensor network, even in the presence of faulty sensors.

Google Code Jam

Programming Ability Index
Between 2015 and 2018, Google also runs Distributed Code Jam, with the focus on distributed algorithms.