Content deleted Content added
No edit summary |
No edit summary |
||
Line 22:
Compare with Ring algorithm:
* Assumes that system is synchronous (so you can have Delta and Cmax in order to calculate timeout as opposed to asynchronous systems)
* Uses timeout to detect process failure/crash (To=2*Delta+Cmax so timer knows when omision fails happens)
* 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> (This works exactly 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)
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 42:
* Witchel, Emmett (2005). [http://www.cs.utexas.edu/users/witchel/372/lectures/25.DistributedCoordination.ppt "Distributed Coordination"]. Retrieved May 4, 2005.
* Hector Garcia-Molina, Elections in a Distributed Computing System, IEEE Transactions on Computers, Vol. C-31, No. 1, January (1982) 48-59
* L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem [http://research.microsoft.com/en-us/um/people/lamport/pubs/byz.pdf]
[[Category:Distributed algorithms]]
| |||