Revision as of 15:24, 30 June 2015 edit 37.11.126.80 (talk) No edit summary ← Previous edit		Revision as of 19:39, 30 June 2015 edit undo 37.11.126.80 (talk) No edit summary Next edit →
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=2Delta+Cmax so timer knows when omision fails happens) Message delivery between processes should be reliable. (Coordinator dilema, ¿is it trustworthy? or suplantation,inyection,DoS,... may harm the system) * 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)

Bully algorithm: Difference between revisions