Revision as of 20:51, 30 June 2015 edit 37.11.126.80 (talk) No edit summary ← Previous edit		Revision as of 20:53, 30 June 2015 edit undo 37.11.126.80 (talk) No edit summary Next edit →
Line 16: * 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,replication,DoS may happen?) * Prior information about other process id's must be known. (This works as ~~<ref>~~ Leslie Lamport solution for Byzantine dilema ~~</ref>~~, 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 coordinator and slaves) ==Component calls==

Bully algorithm: Difference between revisions