Bully algorithm: Difference between revisions

Revision as of 19:39, 30 June 2015

Revision as of 19:43, 30 June 2015

Line 15:

* 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)

* 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 harm the systemhappen?)

* 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)