Skip to content
Benchmark code for the Power-of-two-choices (p2c) algorithm
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
diagrams
plot
README.md
do-bench.sh
do-report.sh
edge.cfg
lg-full-start-all.sh
lg-service-restart-all.sh
lg-sidecar-restart-all.sh
lg-sidecar-update-all.sh
lg-sysctl-all.sh
lg-upload-all.sh
service.sh
sidecar.cfg.ext
sidecar.cfg.lc
sidecar.cfg.po2
sidecar.cfg.rnd
sidecar.cfg.rr
sidecar.sh
svc-log.conf
svc-log.py
svc-mytime.conf
svc-mytime.py
svc-time.conf
svc-time.py
svc-user.conf
svc-user.py

README.md

Comparing Power-of-Two-Choices, Random, Round-robin and Leastconn.

The benchmark using this code is described here.

This dummy application is purposely written using widely available tools like Python's SimpleHTTPServer (now http.server) which are commonly found on simple services, in order to make it easy to test in other environments to experiment with other deployment architectures, or even future algorithms that other load balancers may implement.

You can’t perform that action at this time.