Bully algorithm: Difference between revisions

Revision as of 20:19, 14 July 2016

Revision as of 09:36, 4 May 2017

Line 3:

{{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 mix 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.