https://github.com/frddl/bully-algorithm
In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes. The process with the highest process ID number from amongst the non-failed processes is selected as the coordinator.
https://github.com/frddl/bully-algorithm
bully-algorithm distributed-systems java
Last synced: about 1 month ago
JSON representation
In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes. The process with the highest process ID number from amongst the non-failed processes is selected as the coordinator.
- Host: GitHub
- URL: https://github.com/frddl/bully-algorithm
- Owner: frddl
- License: mit
- Created: 2017-12-05T20:08:37.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-12-05T20:21:07.000Z (about 8 years ago)
- Last Synced: 2025-10-13T15:54:37.903Z (4 months ago)
- Topics: bully-algorithm, distributed-systems, java
- Language: Java
- Size: 9.77 KB
- Stars: 7
- Watchers: 1
- Forks: 6
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE