Master-slave group based model for co-ordinator selection, an improvement of bully algorithm

@article{Mishra2014MasterslaveGB,
  title={Master-slave group based model for co-ordinator selection, an improvement of bully algorithm},
  author={Balmukund Mishra and Ninni Singh and Ravideep Singh},
  journal={2014 International Conference on Parallel, Distributed and Grid Computing},
  year={2014},
  pages={457-460}
}
In a distributed system to coordinate various jobs among processes, there is a need of a Leader Node or Coordinating Node. Selection of coordinator node in distributed environment plays an important role in the system performance. In the real world, it is not possible that the coordinator node is always available because of some failure occur sometimes it get crashed, out of service. In literature various approaches have been proposed in order to conduct an election mechanism when coordinator… 
3 -Phase Leader Election Algorithm for Distributed Systems
TLDR
A novel method known as "3-Phase Leader Election Algorithm" that consists of three phases that identifies and filters the nodes for election and improves the efficiency of the system via following performance metrics such as Time and Communication complexity.
An Adaptive Bully Algorithm for Leader Elections in Distributed Systems
TLDR
The analytical equations show that the ABA algorithm is more efficient rather than BA algorithm, in both, the number of message passing and the latency, and the message passing complexity decreased to O(n).
A Low-overhead Cluster Management Mechanism Based on Node Information Storage of Max-Heap Tree
  • Meng Yang, Hongxia Bie
  • Computer Science
    2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)
  • 2019
TLDR
The experimental results and analysis show that the mechanism of node information storage based on Max-Heap Tree reduces the occupation of storage resources of the cluster comparing with the traditional storage method.

References

SHOWING 1-10 OF 11 REFERENCES
DR: Divided Ring Leader Election Algorithm
TLDR
This work proposed divided algorithm in ring topology and it tries to reduce latency in the broad networks optionally and reduces the latency against messages but a bit because latency is more important than number of messages.
Elections in a Distributed Computing System
TLDR
This paper discusses elections and reorganizations of active nodes in a distributed computing system after a failure, and two types of reasonable failure environments are studied.
Coordinator selection in distributed systems: Cellular automata model based approach
  • K. Mahata, Sukanta Das
  • Computer Science
    2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)
  • 2009
This paper reports a scheme that selects a process as a coordinator from a set of n processes of a distributed system. The scheme demands only O(n) messages in worst case to select a leader. In the
Distributed Computing: Principles, Algorithms, and Systems
TLDR
This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing, and is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science.
An improved algorithm for decentralized extrema-finding in circular configurations of processes
This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and
Distributed Computing: Fundamentals, Simulations and Advanced Topics
TLDR
This chapter discusses how to improve the Fault Tolerance of Algorithms in Message-Passing Systems andSimulating Synchrony, and some of the approaches taken in this chapter to achieve this aim.
On an improved algorithm for decentralized extrema finding in circular configurations of processors
This note presents a more efficient algorithm for finding the largest element in a circular list of processors when messages can be passed in either direction. It passes 2<italic>N</italic>*floor(lg
An improved algorithm for decentralized extrema-finding in circular configurations of processes
This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and...
Distributed operating systems - concepts and design
TLDR
Distributed operating systems will provide engineers, educators, and researchers with an in-depth understanding of the full range of distributed operating systems components.
...
1
2
...