Reproduce “Balanced Fair Resource Sharing in Computer Clusters” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Thomas Bonald, Céline Comte

The authors introduce a scheduler that interrupts jobs at random, returns them to a shared virtual queue, and reallocates compatible servers as jobs resume. This changes resource sharing without restricting jobs to one server. In 100-server random-assignment simulations, one interruption per job on average brought mean service-rate and mean-delay close to balanced fairness, a result not guaranteed for other systems.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.