In distributed networks, a single process is selected as the coordinator for each task to be performed. This coordinator process acts as the leader and synchronizes all the processes to execute a particular task. Hence, the leader is first elected before initiating the execution of the task. Two standard algorithms used for leader election are bully and ring election algorithms. But both these algorithms have their respective pitfalls. This paper focuses on combining these two algorithms with the help of hypergraphs to overcome these drawbacks. Initially, the two algorithms are discussed in detail, and their drawbacks are discussed. Further, the concept of hypergraphs is discussed to understand how the two algorithms can be combined, thus introducing a more efficient leader election algorithm.
CITATION STYLE
Subramanian, E. R. S., Sri Gurubaran, B., Sayee Shruthi, A. S., Aishwarya, V., Balaji, N., & Umamakeswari, A. (2020). A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems. In Lecture Notes in Networks and Systems (Vol. 103, pp. 437–445). Springer. https://doi.org/10.1007/978-981-15-2043-3_48
Mendeley helps you to discover research relevant for your work.