Revision as of 14:43, 30 June 2015 edit 37.11.126.80 (talk) No edit summary ← Previous edit		Revision as of 14:44, 30 June 2015 edit undo 37.11.126.80 (talk) No edit summary Next edit →
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 [[Distributed Computing#Coordinator Election\|coordinator]] or "General" election. ==Assumptions==

Bully algorithm: Difference between revisions