Metraipolis › archive › dc_b3accbfb0da4
Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness — arXiv:2611.07905
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07905
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:54:24.453Z
- SHA-256 of the archived text
a5bc8706b4d4748b89b86e7ab787f5a3b570d45bf220e4a82197a9508c090e29- Stable URL of this page
https://metraipolis.com/documento/dc_b3accbfb0da4
How to cite
Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness — arXiv:2611.07905 — arXiv (en), https://arxiv.org/abs/2611.07905 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3accbfb0da4 (Metraipolis archive dc_b3accbfb0da4, sha256 a5bc8706b4d4748b89b86e7ab787f5a3b570d45bf220e4a82197a9508c090e29)
BibTeX
@misc{dcb3accbfb0da4,
title = {Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness — arXiv:2611.07905},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07905},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3accbfb0da4; sha256 a5bc8706b4d4748b89b86e7ab787f5a3b570d45bf220e4a82197a9508c090e29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07905. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Dominant Resource Fairness (DRF) is an influential policy for sharing multiple resources among jobs with heterogeneous demands. It combines sharing incentive, strategy-proofness, envy-freeness, and Pareto efficiency, making it particularly attractive for shared computing systems. DRF has been implemented in major resource-management frameworks, including Apache Mesos and Hadoop YARN. DRF is also nonclairvoyant: it requires no advance knowledge of job sizes, making it practical when processing requirements are difficult to predict. This motivates understanding its completion-time performance relative to an optimal schedule that knows all job sizes. However, elementary arguments can only give an $\Omega(\sqrt D)$ lower bound and an $O(D)$ upper bound for total completion time, where $D$ is the number of resource types. In this paper, we close this gap by proving that DRF is $\Theta(\sqrt D)$-competitive. More generally, for every fixed real $q\geq1$, we show that DRF is $\Theta(D^{1/(q+1)})$-competitive for the $\ell_q$ norm of completion times, with larger $q$ placing greater emphasis on late-finishing jobs. These bounds hold with arbitrary release times. We also give a refined analysis of total completion time for small $D$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.07905 — 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-06T14:26:57.632Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).