Live briefing
Everything about Distributed algorithm
Algorithm run on hardware built from interconnected processors
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Distributed algorithmA 5-minute orientation
- Skim a recent paper: Distributed Co-Evolutionary Memetic Algorithm for Distributed Hybrid Differentiation Flowshop Scheduling ProblemInfluential work since 2022
- Pick up a classic book: PreyThe most-reprinted book on the subject
- Read the landmark paper: A distributed mutual exclusion algorithmCited 225 times
- Go sideways: Consensus (computer science)A closely related topic
- Go sideways: Leader electionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A distributed mutual exclusion algorithm
Distributed deadlock detection algorithm
The BG distributed simulation algorithm
Another adaptive distributed shortest path algorithm
Coordination Algorithm for Distributed Testing
A Distributed Graph Algorithm: Knot Detection
Distributed Grover's algorithm
Distributed quantum algorithm for Simon's problem
🆕 Influential since 2022
Distributed Co-Evolutionary Memetic Algorithm for Distributed Hybrid Differentiation Flowshop Scheduling Problem
Distributed projection‐free algorithm for constrained aggregative optimization
A Proximal Atomic Coordination Algorithm for Distributed Optimization
Compressed Gradient Tracking Algorithm for Distributed Aggregative Optimization
Distributed exact Grover’s algorithm
📚 Books worth reading
PreyMichael Crichton · 2002
Distributed SystemsSukumar Ghosh · 2006
Parallel algorithmsHenri Casanova, Armand Legrand · 2008
Distributed computingAjay D. Kshemkalyani · 2008
Distributed AlgorithmsWan Fokkink · 2013- 📕Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction ProblemsMohamed Wahbi · 2013
Markov ChainsWai-Ki Ching · 2006
Introduction to distributed algorithmsGerard Tel · 1994
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Consensus (computer science) 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 In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers…
- Atomic broadcast In fault-tolerant distributed computing, an atomic broadcast or total order broadcast is a broadcast where all correct processes in a system of multiple…
- Paxos (computer science) In computer science, Paxos is a family of protocols for solving consensus in a network of unreliable or fallible processors. Consensus is the process of…
- Terminating Reliable Broadcast Terminating Reliable Broadcast (TRB) is a problem in distributed computing that encapsulates the task of broadcasting a message to a set of receiving processes…
- Chandra–Toueg consensus algorithm The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving consensus in a network of…
- Two-phase commit protocol In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP)…
- Two Generals' Problem In computing, the Two Generals' Problem (or Chinese Generals Problem) is a thought experiment meant to illustrate the pitfalls and design challenges of…