Anzeige
Erschienen in:
2020 | OriginalPaper | Buchkapitel
A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems
verfasst von : E. R. S. Subramanian, B. Sri Gurubaran, A. S. Sayee Shruthi, V. Aishwarya, N. Balaji, A. Umamakeswari
Erschienen in: Innovations in Computer Science and Engineering
Verlag: Springer Singapore
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
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.