Bully algorithm: Difference between revisions

Revision as of 11:58, 29 August 2015

Revision as of 17:29, 5 December 2015

Line 16:

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

* Message delivery between processes should be reliable.(Coordinator dilemma,¿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 dilemma, where coordinator needs a key and idID for each process and where processors hierarchy stipulates nodes as Generals, Commanders and Lieutenants but without a key and with only coordinator and slaves)

Notice that this algorithm can be applied over distributed or centralized systems , because processes can be located on one machine or over severals as you can make multicast calls or system calls or both if your system is hybrid (for example a multithread server working with several clients)