Definition
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.
Related concepts
AlgorithmAtomic commitCentral processing unitComputer hardwareConcurrency (computer science)Consensus (computer science)Data processingDistributed computingInter-process communicationLeader electionMorgan Kaufmann PublishersMutual exclusionNon-blocking data structuresParallel algorithmPaxos algorithmProcess controlRaft (computer science)Replication (computer science)Resource allocationScientific computingSearch algorithmSpanning treeSpanning tree (mathematics)TelecommunicationsTerminating Reliable BroadcastThree-phase commit protocolTwo-phase commit protocolVertex coloring
2 concepts already in your glossary