Bully algorithm: Difference between revisions

Content deleted Content added
m Assumptions: copy-edit
Line 14:
* Election Message: Sent to announce faster election
* Answer Message: Respond to the election message
* Coordinator message: Sent to announce the identity of the elected process
 
Compared with Ring election algorithm:
* Assumes that system is synchronous
* Uses timeout to detect process failure/crash
* Each processor knows which processor has the higher identifier number and communicates with 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>
 
==Bully algorithm structure==