Revision as of 16:37, 4 May 2005 edit Canthony (talk \| contribs) 45 edits Corrected grammar ← Previous edit		Revision as of 17:47, 4 May 2005 edit undo Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,800 edits m cat Next edit →
Line 1: The '''bully ~~alorithm~~algorithm''' is a method in [[distributed computing]] for dynamically selecting a coordinator by process ID number. When a process P determines that the current coordinator is down because of message timeouts or failure of the coordinator to initiate a handshake, it performs the following sequence of actions: Line 12: * Witchel, Emmett (2005). [http://www.cs.utexas.edu/users/witchel/372/lectures/25.DistributedCoordination.ppt "Distributed Coordination"]. Retrieved May 04, 2005. [[Category:Algorithms]]

Bully algorithm: Difference between revisions