Comparing load balancing algorithms for distributed queueing networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
. We consider a network serving a patchwork of overlapping regions where jobs from a local region are assigned to a collection of local servers. Copies of these jobs are simultaneously queued at all the local servers. When a copy of the job begins service at one of the servers it is removed from the other queues. The system is equivalent to one in which the exact service requirement of each job is known at arrival time, and each job joins the local queue with the shortest waiting time. We describe how the amount of work in the network becomes large in the simple case of two servers, with one arrival stream for each server and a third, routeable arrival stream. If the proportion of routeable jobs is large enough then the waiting times at the servers become large in tandem when the total workload becomes large, thus delaying overload as long as possible. The fact that this resource pooling can be attained with a local routing policy not dependent on the state of the network has engineeri...
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it