Bully algorithm: Difference between revisions

Revision as of 06:05, 21 March 2015

Revision as of 00:16, 2 April 2015

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 mix between an algorithm description and a comparison with another algorithm (which one even?) |date=January 2015}}

}}

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]].

Line 15 ⟶ 8:

* Prior information about other process id's must be known.

==Electionelection type==

* Election Message: Sent to announce fasterleader election

* Answer Message: Respond to the election message

* Coordinator message: Sent to announce the identity of the elected process

Line 35 ⟶ 28:

== See also ==

*[[Distributed Computing#Coordinator electionElection]]

*[[Chang and Roberts algorithm]]