Bully Algorithm
The Bully Algorithm is a distributed leader election algorithm that selects the highest-identified process as the coordinator by initiating an election upon detection of a coordinator failure, distinguishing itself through its reliance on process id comparisons and message-based coordination among synchronized processes.
15
Publications
273
Citations
39
Authors
15
Institutions
Publications per year
2017–2026
2
Parents
15
Improved algorithms for leader election in distributed systems
MohammadReza EffatParvar, Nasser Yazdani, Mehdi Effatparvar et al. · 2010 · 44 citations
Leader Election in Distributed Systems with Crash Failures
Scott D. Stoller · 1999 · 30 citations
A New Approach for Election Algorithm in Distributed Systems
Majid Gholipour, Mohammad Sadegh Kordafshari, Mohsen Jahanshahi et al. · 2009 · 18 citations
1–5 of 15
39
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 39
15
Qazvin Islamic Azad University
Qazvin, Iran
5 h-index
15 publications
222 citations

Islamic Azad University, Tehran
Tehran, Iran
2 h-index
3 publications
48 citations
Islamic Azad University Ardabil
Ardabil, Iran
2 h-index
4 publications
112 citations
Chungnam National University
Daejeon, South Korea
1 h-index
2 publications
54 citations

Birla Institute of Technology and Science, Pilani
Pilāni, India
1 h-index
3 publications
39 citations
Islamic Azad University Central Tehran Branch
Tehran, Iran
1 h-index
1 publications
18 citations
Korea University
Seoul, South Korea
1 h-index
1 publications
27 citations
Technical University of Denmark
Kongens Lyngby, Denmark
1 h-index
2 publications
34 citations
1–8 of 15
Repository · 2 publications · 20 citations
2
h-index
1 publications · 13 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
IJEEE · 1 publications · 10 citations
1
h-index
1–4