Reproduce “Robust Scheduling for Flexible Processing Networks” 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
Ramtin Pedarsani, Jean Walrand, Yuan Zhong
The authors develop a queue-feedback scheduler for flexible networks that adjusts feasible server allocations from queue changes rather than estimating arrival and task-service rates. They prove rate stability for fork-join and probabilistically routed models when servers cooperate and service rates factor into task and server terms. A five-task simulation reports reduced queue 4 length; generic rates can defeat the guarantee.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.