Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-10-09
MASAUM Journal of Computing(MJC),Vol.1 No.3,pp.439-446,October 2009, ISSN 2076-0833
Computer Science
Distributed, Parallel, and Cluster Computing
8 pages,6 figures
Scientific paper
Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and well-known approaches in coordinator election process. This paper will present a modified version of bully election algorithm using a new concept called election commission. This approach will not only reduce redundant elections but also minimize total number of elections and hence it will minimize message passing, network traffic, and complexity of the existing system.
Nahar Afroza
Rahman Muhammad Mahbubur
No associations
LandOfFree
Modified Bully Algorithm using Election Commission does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modified Bully Algorithm using Election Commission, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Bully Algorithm using Election Commission will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-220961