Bully algorithm

The bully algorithm is a programming mechanism that applies a hierarchy to nodes on a system, making a process coordinator or slave.This is used as a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Electing a leader is a classical problem in distributed computing system. Synchronization between processes often requires one… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 6
Is this relevant?
2013
2013
In distributed system environment like human life environment we need a manager to coordinate the job of all processes. We call… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
Is this relevant?
2012
2012
In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
In centralized algorithm for mutual exclusion, one process is elected as a coordinator. Whenever a process wants to go to… (More)
Is this relevant?
2010
2010
Many distributed algorithms require one process to act as a unique process to play a particular role in distributed systems… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
An important challenge confronted in distributed systems is the adoption of suitable and efficient algorithms for coordinator… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2009
2009
— Electing leader is a vital issue not only in distributed computing but also in communication network [1, A leader is required… (More)
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2005
2005
  • M. S. Kordafshar
  • 2005
-Leader election is an i fields such as communication netwo IPC, Berkeley algorithm, etc. Sy coordinator. The coordinator migh… (More)
Is this relevant?
2004
2004
Many distributed algorithms require one process to act as a unique process to play a particular role in distributed systems… (More)
  • figure 1
  • figure 2
Is this relevant?