Revision as of 13:08, 24 November 2011 edit BehrangBina (talk \| contribs) 2 edits No edit summary ← Previous edit		Revision as of 13:10, 24 November 2011 edit undo BehrangBina (talk \| contribs) 2 edits No edit summary Next edit →
Line 1: The '''bully algorithm''' is a method in [[distributed computing]] for dynamically selecting a coordinator by process ID number. Assumptions : * The system is synchronous and uses timeout for identifing process failure Message types -: * Election Message : Sent to announce the election * Answer Message : Respond to the election message * Cordinator message: sent to announce the identity elected process Compare with Ring algorithm : * Assumes that system is synchorinous * Uses time-out to detect process failure/crash

Bully algorithm: Difference between revisions