Revision as of 17:04, 18 May 2017 edit Person54 (talk \| contribs) Extended confirmed users 1,224 edits No edit summary ← Previous edit		Revision as of 22:11, 18 May 2017 edit undo Person54 (talk \| contribs) Extended confirmed users 1,224 edits No edit summary Next edit →
Line 1: In [[distributed computing]], the '''bully algorithm''' is a method for dynamically electing a [[Distributed computing#Coordinator election\|coordinator]] or leader from a group of distributed computer processes. The process with the highest process ID number from ~~the~~ amongst the non-failed processes is selected as the coordinator. ==Assumptions==

Bully algorithm: Difference between revisions