Performance of Balanced Fairness in Resource Pools: A Recursive Approach

Abstract : Understanding the performance of a pool of servers is crucial for proper dimensioning. One of the main challenges is to take into account the complex interactions between servers that are pooled to process jobs. In particular, a job can generally not be processed by any server of the cluster due to various constraints like data locality. In this paper, we represent these constraints by some assignment graph between jobs and servers. We present a recursive approach to computing performance metrics like mean response times when the server capacities are shared according to balanced fairness. While the computational cost of these formulas can be exponential in the number of servers in the worst case, we illustrate their practical interest by introducing broad classes of pool structures that can be exactly analyzed in polynomial time. This extends considerably the class of models for which explicit performance metrics are accessible.
Document type :
Journal articles
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01630420
Contributor : Céline Comte <>
Submitted on : Monday, December 18, 2017 - 5:21:26 PM
Last modification on : Thursday, October 17, 2019 - 12:36:59 PM

Files

bf_in_pools.pdf
Files produced by the author(s)

Identifiers

Citation

Thomas Bonald, Céline Comte, Fabien Mathieu. Performance of Balanced Fairness in Resource Pools: A Recursive Approach. Proceedings of the ACM on Measurement and Analysis of Computing Systems , ACM, 2017, 1 (2), ⟨10.1145/3154500⟩. ⟨hal-01630420v2⟩

Share

Metrics

Record views

491

Files downloads

500