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

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 al...

Full description

Saved in:
Bibliographic Details
Published in:2014 International Conference on Parallel, Distributed and Grid Computing pp. 457 - 460
Main Authors: Mishra, Balmukund, Singh, Ninni, Singh, Ravideep
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2014
Subjects:
Analytical models
Computational modeling
Computer crashes
Coordinator
Distributed computing
Grid computing
Master
Nominations and elections
Servers
Slave
ISBN:1479976822, 9781479976829
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 node gets crashed. Although these approaches provide different techniques to conduct elections and also to minimize the number of messages required. But these approaches have some drawbacks such as wastage of network bandwidth In order to overpower these drawbacks we proposed an algorithm for Coordinator selection that is used in the centralized distributed system. This gives a better performance than bully algorithm and the other existing proposed algorithm for coordinator selection. Our algorithm selects a coordinator in O (n) time as well as it handles the failure of nodes in less number of message exchange the message is O (n) message but practically it is very lower than O(n).
ISBN:1479976822
9781479976829
DOI:10.1109/PDGC.2014.7030789