Revision as of 14:07, 18 May 2017 edit Person54 (talk \| contribs) Extended confirmed users 1,224 edits →Component calls ← Previous edit		Revision as of 14:07, 18 May 2017 edit undo Person54 (talk \| contribs) Extended confirmed users 1,224 edits →Assumptions Next edit →
Line 3: ==Assumptions== 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 algorithm assumes that:~~ * the system is synchronous and timeouts identify process failure. * processes may crash during execution of algorithm. * * message delivery between processes is reliable. * process ids are known.

Bully algorithm: Difference between revisions