Bully algorithm: Difference between revisions

Revision as of 22:11, 18 May 2017

Revision as of 01:04, 19 May 2017

Line 4:

The algorithm assumes that:<ref>Jean Dollimore, Tim Kindberg, George F. Coulouris, "Distributed systems : concepts and design (Third Edition)," in ''Distributed systems : concepts and design (Third Edition)''. Addison–Wesley, 2003.</ref>

* the system is synchronous and timeouts identify process failure.

* processes may crashfail at any time, including during execution of the algorithm.

* a process fails by stopping and returns from failure by restarting.

* there is a failure detector which detects failed processes.

* message delivery between processes is reliable.

* each process knows theits own process id and address, and that of every other process.

==Algorithm==