Bully algorithm: Difference between revisions

Revision as of 09:41, 4 May 2017

Revision as of 13:57, 18 May 2017

Line 1:

{{Multiple issues|

{{Confusing|reason=is it unclear what is non-trivial about this algorithm|date=January 2015}}

{{Confusing|reason=is the communication model missing, is it all-to-all communication?|date=January 2015}}

{{Contradict|about=the assumption of being synchronous (having a rounds for all processes) and using timeouts|date=January 2015}}

{{Confusing|reason=is the section about "Election Type" a masala

between an algorithm description and a comparison with another algorithm (which one even?) |date=January 2015}}}}

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 process ID number is selected as the [[Distributed computing#Coordinator Election|coordinator]].