Content deleted Content added
Undid revision 654566059 by 2620:0:1000:2101:6108:EA9E:8F25:86DD (talk) |
No edit summary |
||
Line 6:
}}
The '''bully algorithm''' is a method in [[distributed computing]] for dynamically electing a [[Distributed Computing#Coordinator Election|coordinator]] by process ID number. The process with the highest process ID number is selected as the [[Distributed Computing#Coordinator Election|coordinator]]. This, is one optimized solution from The Byzantine Generals Problem in order to improve ( for some Distributed Sistems ) the Coordinator or "General" election.
==Assumptions==
| |||