Bully algorithm: Difference between revisions

Revision as of 19:43, 30 June 2015

Revision as of 19:47, 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 optimizedan approach to the solution fromof The Byzantine Generals Problem [1] in order to improvemake the [[Distributed Computing#Coordinator Election|coordinator]] or "General" election.

==Assumptions==

Line 16:

* Allows processes to crash during execution of algorithm. (To=2*Delta+Cmax so timer knows when omision fails happens)

* Message delivery between processes should be reliable.(Coordinator dilema,¿is it trustworthy; or suplantation,inyection,replication,DoS may happen?)

* Prior information about other process id's must be known. (This works as Leslie Lamport solution for Byzantine dilema, where coordinator needs a key and id for each process and where processors hierachy stipulates nodes as Generals, Commanders and Liutenants but without a key and with only coordinators and slaves)

==Election type==