Bully algorithm: Difference between revisions

Revision as of 16:42, 2 March 2013

Revision as of 04:31, 3 March 2013

Line 1:

The '''bully algorithm''' is a method in [[distributed computing]] for dynamically selectingelecting 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]].

==Assumptions==

Line 28:

== See also ==

*[[Distributed Computing#Coordinator Election]]

*[[Leader election]]

*[[Chang and Roberts algorithm]]