Modified Bully Algorithm Incorporating the Concept of Election Commission- Crimson publishers
Modified Bully Algorithm Incorporating the Concept of Election Commission by Gajendra Sharma in Integrative Journal of Conference Proceedings
Distributed computing system comprises of several nodes performing multiple task or same task in parallel. It is usually desirable to have a single node which governs the activity of all these nodes known as coordinator. The purpose of this study is to propose a suitable algorithm for selection of the coordinator in efficient manner. In this work we have developed a new algorithm based on the concept of special type of node, Election Commission (EC), which conducts the activity of selecting the coordinator through election procedure. We have compared out work with the most popular election algorithm, Bully Algorithm, by Garcia Molina and the Improved Bully Algorithm. It was found that our study outperformed other two in context of memory efficiency and message generation in the system. In this work we assumed the EC as an ideal one so for future work we can upgrade the study by assuming the realistic behavior of the EC.
Read more articles in our site: https://crimsonpublishers.com/icp/index.php
For more articles in our journal click on: https://crimsonpublishers.com/icp/fulltext/ICP.000507.php
Comments
Post a Comment