BULLY
ALGORITHM
- 22BIT0279 DHARSITH
WHAT IS BULLY ALGORITHM ?
◦ The Bully Algorithm is a popular method for electing a coordinator
in distributed systems. When nodes or processes in a system need
a leader to manage tasks or make decisions, this algorithm helps
them choose one, even if some nodes fail. The process involves
nodes “bullying” each other by checking who has the highest ID,
and the one with the highest ID becomes the coordinator
IMPLEMENTATION WITH EXAMPLE
USE OF BULLY ALGORITHM
[Link] Databases (e.g., Apache ZooKeeper, Google Spanner, MongoDB)
[Link] Computing & Microservices (e.g., Kubernetes, Docker Swarm)
[Link] Balancing in Web Servers (e.g., Amazon AWS, Google Cloud Load Balancer)
[Link] Networks & IoT (e.g., Smart Cities, Industrial IoT)
[Link] & Financial Systems (e.g., Blockchain, Transaction Processing)
[Link] Online Games (e.g., Game Servers & Matchmaking)
[Link] & Aerospace Systems (e.g., NASA, SpaceX, Satellite Networks)
[Link] Vehicle Networks (e.g., Self-Driving Car Fleets)