Bully algorithm: Difference between revisions

Revision as of 07:24, 13 May 2016

Revision as of 20:19, 14 July 2016

Line 18:

* 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 ID 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 severalsseveral 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==