Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Chang and Roberts algorithmDistributed computingLeader electionList of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
An Adaptive Bully Algorithm for Leader Elections in Distributed Systems
Leader election is a classical problem in distributed system applications. There are many leader election algorithms, but we… 
2015
2015
Optimized Bully Algorithm
All distributed systems require one process to act as a coordinator , initiator or otherwise perform some special role .In… 
2015
2015
PROJEKT BUDI COOL, NE BUDI BULLY
Sažetak Većina ljudi se u djetinjstvu susrela sa međuvršnjačkim nasiljem bilo kao sudionik, bilo kao promatrač. U Hrvatskoj je… 
2014
2014
Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification
In distributed computing, the leadership election has been used to distributively designate a node as the central controlleri… 
2012
2012
Highly Available Hadoop NameNode Architecture
In past few years Hadoop Distributed File System (HDFS) has been used by many organizations with gigantic data sets and streams… 
2011
2011
Improved bully election algorithm in distributed systems
In centralized algorithm for mutual exclusion, one process is elected as a coordinator. Whenever a process wants to go to… 
2008
2008
Optimal Algorithm Based on Bully Algorithm
As a result of transmitting larges numbers of messages in bully algorithm of distributed algorithm, the performance of the… 
2005
2005
Modified bully election algorithm in distributed systems
Leader election is a fundamental problem in distributed computing, and regards a wide number of applications. In order to solve… 
2005
2005
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
Leader election is an important problem in distributed computing, and it is applied in many scientific fields such as… 
2002
2002
The Fast Bully Algorithm: For Electing a Coordinator Process in Distributed Systems
Many of software in distributed systems require a special process called the coordinator or the leader. The coordinator is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)