Revision as of 20:08, 30 June 2015 edit 37.11.126.80 (talk) No edit summary ← Previous edit		Revision as of 20:21, 30 June 2015 edit undo 37.11.126.80 (talk) No edit summary Next edit →
Line 18: * Prior information about other process id's must be known. (This works as Leslie Lamport solution for Byzantine dilema, where coordinator needs a key and id for each process and where processors hierachy stipulates nodes as Generals, Commanders and Liutenants but without a key and with only coordinators and slaves) ==~~Election~~Component ~~type~~calls== This ~~is how we apply~~are the Bully-algorithm components: * Election Message: Sent to announce faster election Line 30: * 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> ==Algorithm structure== 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:

Bully algorithm: Difference between revisions