Revision as of 21:01, 30 June 2015 edit 37.11.126.80 (talk) No edit summary ← Previous edit		Revision as of 21:04, 30 June 2015 edit undo 37.11.126.80 (talk) No edit summary Next edit →
Line 18: * 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 coordinator and slaves) Notice that this algorithm can be aplied over distributed or centrilized systems also, 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) ==Component calls==

Bully algorithm: Difference between revisions