The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and ...
Generalized partial credit model: application of an EM algorithm. Appl Psychol Meas. 1992;16(2):159–76. doi:10.1177/014662169201600206. Article Google Scholar Olweus D. Bullying at school. What we know and what we can do. Oxford UK and Cambridge USA: Blackwell; 1993. Google Scholar ...
Nahar, "Modified bully algorithm using election commission". MASAUM Journal of Computing, vol.1 no.3, pp. 88- 96, October 2009.Rahman MM, Nahar A (2009) Modified bully algorithm using election commission. MASAUM J Comput (MJC) 1(3):439–446. ISSN 2076 0833...
In this algorithm the highest Id node is selected as a leader, but this algorithm has some drawbacks such as message passing complexity, heavy network traffic, redundancy etc. To overcome this problem, we are introducing an announcer based Bully election leader algorithm which is the modified ...