Metraipolis › archive › dc_7fe7f411ec11
Budgeted Admission from Timestamped Capacity Records in Shared Clusters — arXiv:2610.28392
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.28392
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-21T07:11:24.856Z
- SHA-256 of the archived text
fd6213579da27acd1c1e876a413840326bdf6e17a8307a20b43b46686e9eab4c- Stable URL of this page
https://metraipolis.com/documento/dc_7fe7f411ec11
How to cite
Budgeted Admission from Timestamped Capacity Records in Shared Clusters — arXiv:2610.28392 — arXiv (en), https://arxiv.org/abs/2610.28392 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fe7f411ec11 (Metraipolis archive dc_7fe7f411ec11, sha256 fd6213579da27acd1c1e876a413840326bdf6e17a8307a20b43b46686e9eab4c)
BibTeX
@misc{dc7fe7f411ec11,
title = {Budgeted Admission from Timestamped Capacity Records in Shared Clusters — arXiv:2610.28392},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.28392},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fe7f411ec11; sha256 fd6213579da27acd1c1e876a413840326bdf6e17a8307a20b43b46686e9eab4c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.28392. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A cluster admission gate can receive a capacity record that no longer matches current schedulability. We study one exogenous binary schedulability unit under a bound on the joint probability of admission and unavailability. For a symmetric Markov state, we derive the stationary admission frontier for a fixed observation delay and apply finite likelihood allocation to a delay-tagged delivered record. A one-sided exact binomial endpoint calibrates each fitted policy, and exact enumeration confirms the per-policy confidence target in every tested parameter cell. A separate deterministic guard charges every unresolved admission against the realized allowance and bounds unavailable-state admissions at every prefix under truthful outcome feedback. An executable admission procedure composes the allocation and guard. The controlled system binds source sampling, NATS delivery, randomized admission, Kubernetes objects, and API-derived outcomes in one append-only record. Independent audit finds no missing event, identity mismatch, or state mismatch in the completed functional block. A separate CPU request-accounting check preserves Job and Pod identity across an unschedulable-to-complete transition. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.28392 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-21T07:06:13.129Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).