Bully algorithm: Difference between revisions

Revision as of 19:47, 30 June 2015

Revision as of 20:08, 30 June 2015

Line 7:

The '''bully algorithm''' is a programming mechanism that applies a hierachy to nodes on a distributed system making them Coordinator or Slaves.

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]]. This, is one an approach to the solution of The Byzantine Generals Problem [1] in order to make the [[Distributed Computing#Coordinator Election|coordinator]] or "General" election.

==Assumptions==

As this algorithm is part from othera distributed system model wich tries to make it fail-free (like algorithm[1]), we need some assumptions as the whole point of the algorithmmodel is to make a distributed system free from arbitrary failures (evennot from processing ones) while saving some computational costs.

* The system is synchronous and uses timeout for identifying process failure. (so you can have Delta and Cmax in order to calculate timeout as opposed to asynchronous systems)