Live briefing
Everything about Bully algorithm
Method for electing a coordinator in distributed computing
In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes. The process with the highest process ID number from amongst the non-failed processes is selected as the coordinator. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bully algorithmA 5-minute orientation
- Skim a recent paper: Modification of Traditional Bully Algorithm using Priority Queuing Technique Applied in CPU Memory AllocationInfluential work since 2022
- Pick up a classic book: Darwin's dangerous ideaThe most-reprinted book on the subject
- Read the landmark paper: Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed SystemsCited 11 times
- Go sideways: Leader electionA closely related topic
- Go sideways: Chang and Roberts algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Enhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems
Optimized Bully Algorithm
Bully Algorithm for Election in Distributed Systems
Modified Bully Algorithm Incorporating the Concept of Election Commission
Modified Bully Election Algorithm for Crash Recovery in Distributed Systems
A WAITING TIME-BASED BULLY ALGORITHM FOR LEADER NODE SELECTION IN DISTRIBUTED SYSTEMS
🆕 Influential since 2022
📚 Books worth reading
Darwin's dangerous ideaDaniel C. Dennett · 1995- 📕Decision Making HandbookJerry Ramonyai · 2022
Commonsense methods for children with special educational needsPeter S. Westwood · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Chang and Roberts algorithm The Chang and Roberts algorithm is a ring-based coordinator election algorithm, employed in distributed computing. It was initially published by Ernest…
- 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…
- 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…
- 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…
- Distributed algorithm A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used…
- Distributed computing Distributed computing is a field of computer science that studies distributed systems, defined as computer systems whose inter-communicating components…
- 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…