A Comparative Analysis of Election Algorithm in Distributed Systems

Free registration required

Executive Summary

In distributed system, an important challenge faced is the adoption of efficient algorithms for coordinator election. The main role of an elected coordinator is to manage the use of a shared resource in an optimal manner. Among all the algorithms reported in the paper, the Bully and Ring algorithms have gained more popularity. This paper proposes a comparative analysis of the various election algorithms in distributed system and also presents a new approach for effective election.

  • Format: PDF
  • Size: 232.47 KB