ICA3PP 2009: Algorithms and Architectures for Parallel Processing pp 90-99 | Cite as
DR: Divided Ring Leader Election Algorithm
Abstract
Extending distributed system require new strategy for management and maintenance. For managing distributed system we need one leader like other process in system. Problem is when leader like other process crashed. For solving these problems like these researchers has proposed a number of local based strategies that is each region try to do its work by itself and the results will be gathered in a distributed manner. Leader election is the process of determining a process as the manager of some task distributed among several processes (computers). We suppose like network topologies our distributed system topologies are token and star. We proposed new schemes and discussed about some aspects of them. We proposed divided algorithm in ring topology and we try to reduce latency in the broad networks optionally. Our algorithm reduces the latency against messages but a bit because latency is more important than number of messages. At the end we see how using of n in Divided (n).
Keywords
Distributed systems Leader Election coordinator bully ring algorithm and topologyPreview
Unable to display preview. Download preview PDF.
References
- 1.Tanenbaum, S., Steen, M.V.: DISTRIBUTED SYSTEMS: Principles and Paradigms, p. 2e. Prentice Hall, Inc, Englewood Cliffs (2007)MATHGoogle Scholar
- 2.EffatParvar, M., Effatparvar, M., Bemana, A., Dehghan, M.: Determining a Central Controlling Processor with Fault Tolerant Method in Distributed System. In: ITNG 2007, April 2-4, 2007, pp. 658–663 (2007)Google Scholar
- 3.Heutelbeck, D., Hemmje, M.: Distributed Leader Election in P2P Systems for Dynamic Sets. In: MDM 2006, May 7, 2006, p. 29 (2006)Google Scholar
- 4.Francis, P., Saxena, S.: Optimal distributed leader election algorithm for synchronouscomplete network. In: TENCON 1998, vol. 1, pp. 86–88 (1998)Google Scholar
- 5.Vasudevan, S., DeCleene, B., Immerman, N., Kurose, J., Towsley, D.: Leader Election Algorithms for Wireless Ad Hoc Networks. In: DARPA Information Survivability Conference and Exposition, April 2003, pp. 261–272 (2003)Google Scholar
- 6.Jaggi, N., Gopinath, K.: Verification of a leader election algorithm in timed asynchronous systems. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 207–218. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 7.Kim, E.H., Kim, J.K.: A leader election algorithm in a distributed computing system. In: FTDCS 1995, p. 481 (1995)Google Scholar
- 8.Zargarnataj, M.: New Election Algorithm based on Assistant in Distributed Systems. In: AICCSA 2007, May 2007, pp. 324–331 (2007)Google Scholar
- 9.Park, S.-H.: A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 10.Park, S.-H., Kim, Y., Hwang, J.S.: An efficient algorithm for leader-election in synchronousdistributed systems. In: TENCON 1999, December 1999, pp. 1091–1094 (1999)Google Scholar
- 11.Attiya, H., Welch, J.: Distributed Computing, Fundamentals, Simulations, and Advanced Topics. McGraw-Hill Publishing Company, UK (1998)MATHGoogle Scholar
- 12.Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing. The Benjamin/ Cumminy Publishing Company Inc., Redwood City (2003)MATHGoogle Scholar
- 13.Chow, R., Johnson, T.: Distributed Operating Systems and Algorithms. Addison-Wesley, Reading (1997)Google Scholar
- 14.Singh, G.: Leader Election in the Presence of Link Failures, pp. 231–236 (March 1996)Google Scholar
- 15.Naim, R.M., Ajlouni, M.: Leader election algorithm in hypercube with the presence of one link failure. In: DMIN 2005, Las Vegas DATA MINING (June 2005)Google Scholar
- 16.Stoller, S.D.: Leader Election in Asynchronous Distributed Systems. IEEE Transactions on Computers, 283–284 (March 2000)Google Scholar