Metraipolis › archive › dc_2a43ededc2a0

Minimizing Bottleneck Overload Risk in Online Edge Task Placement under Workload Uncertainty — arXiv:2611.04425

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04425
License (as archived)
CC0-1.0
Archived
2026-11-04T18:40:33.197Z
SHA-256 of the archived text
4b56981b70eb4fb5c2a50eb9d5d1a5fe49d7206547c8d0db6b10c2aaef4eab6d
Stable URL of this page
https://metraipolis.com/documento/dc_2a43ededc2a0

How to cite

Minimizing Bottleneck Overload Risk in Online Edge Task Placement under Workload Uncertainty — arXiv:2611.04425 — arXiv (en), https://arxiv.org/abs/2611.04425 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2a43ededc2a0 (Metraipolis archive dc_2a43ededc2a0, sha256 4b56981b70eb4fb5c2a50eb9d5d1a5fe49d7206547c8d0db6b10c2aaef4eab6d)
BibTeX
@misc{dc2a43ededc2a0,
  title = {Minimizing Bottleneck Overload Risk in Online Edge Task Placement under Workload Uncertainty — arXiv:2611.04425},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04425},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2a43ededc2a0; sha256 4b56981b70eb4fb5c2a50eb9d5d1a5fe49d7206547c8d0db6b10c2aaef4eab6d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04425. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In edge computing, tasks must be placed on servers of finite capacity before workloads are realized, often with only workload means and variances known. An assignment balanced on expected load can still leave a server with more fluctuations than its residual capacity can absorb. Per-server risk constraints can enforce a prescribed overload tolerance but do not distinguish the assignments that meet it by how close the riskiest server comes to the limit. We show that, for independent tasks, placement preserves a period's total variance and total residual capacity, and decides only how fluctuation, measured by standard deviation, is paired with residual capacity across servers. The risk ratio, the ratio of fluctuation to residual capacity, parameterizes a server's worst-case overload probability over all aggregate workload distributions with given mean and variance. We minimize the largest risk ratio, attained at the risk bottleneck. Risk-Bottleneck Placement (RBP) places tasks in descending order of standard deviation, each on the server with the smallest post-assignment risk ratio, and refines the assignment with relocations and swaps within a finite per-period online budget. On small instances solved exactly by enumerating every assignment, minimizing the maximum expected utilization leaves the largest risk ratio 25.66-29.19% above its exact minimum on average, even with risk-minimizing tie-breaking, and the corresponding gap for RBP is 1.77-2.64%. In trace-derived multi-period simulations at two workload pressures, RBP reduces the worst-server overload probability by 26.0% and 18.0% relative to the best baseline and remains the lowest at every tested pressure and scale.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2611.04425 — 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-11-04T18:33:07.103Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).