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.

distributed-systems

View on GitHub

5 Stars

5 Forks

5 Watchers

Java Language

mit License

Cost to Build

$594

Market Value

$500

How is this calculated?

Growth over time

3 data points · 2021-07-01 → 2022-11-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about bully-algorithm

Question copied to clipboard

What is the frddl/bully-algorithm GitHub project? Description: "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.". Written in Java. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone bully-algorithm

Clone via HTTPS

git clone https://github.com/frddl/bully-algorithm.git

Clone via SSH

[email protected]:frddl/bully-algorithm.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the bully-algorithm issue tracker:

Open GitHub Issues

Similar to bully-algorithm

dubbo etcd incubator-mxnet xgboost nsq awesome-scalability Qix akka finagle seaweedfs micro nats-server orleans go-micro rqlite bit translations pachyderm jocko oklog service-fabric tendermint lagom dubbo-spring-boot-project awesome-distributed-systems habitat moleculer dkron sandglass gleam