Revision as of 09:37, 4 May 2017 edit 14.142.99.214 (talk) No edit summary ← Previous edit		Revision as of 09:41, 4 May 2017 edit undo 14.142.99.214 (talk) No edit summary Next edit →
Line 7: The '''bully algorithm''' is a programming mechanism that applies a hierarchy to nodes on a system, making a process coordinator or slave. This is used as a method in [[distributed computing]] for dynamically electing a [[Distributed computing#Coordinator election\|coordinator]] by process ID number. The process with the highest ~~masala~~process ID number is selected as the [[Distributed computing#Coordinator Election\|coordinator]]. ==Assumptions==

Bully algorithm: Difference between revisions