Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
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 the problem of assignning jobs to servers in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪ N) different types according to their processing capacities or speeds. Jobs of random sizes arrive at the system according to a Poisson process with rate Nλ. Upon each arrival, some servers of each type are sampled uniformly at random. The job is then assigned to one of the sampled servers based on their states. We propose two schemes, which differ in the metric for choosing the destination server for each arriving job. Our aim is to reduce the mean sojourn time of the jobs in the system. It is shown that the proposed schemes achieve the maximal stability region, without requiring the knowledge of the system parameters. The performance of the system operating under the proposed schemes is analyzed in the limit as N → ∞. This gives rise to a mean field limit. The mean field is shown to have a unique, globally asymptotically stable equilibrium point which approximates the stationary distribution of load at each server. Asymptotic independence among the servers is established using a notion of intra-type exchangeability which generalizes the usual notion of exchangeability. It is further shown that the tail distribution of server occupancies decays doubly exponentially for each server type. Numerical evidence shows that at high load the proposed schemes perform at least as well as other schemes that require more knowledge of the system parameters.
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.001 | 0.001 |
| 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.000 | 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