research-article

Performance of Balanced Fairness in Resource Pools: A Recursive Approach

Authors:

Fabien MathieuAuthors Info & Claims

Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 1, Issue 2

Article No.: 41, Pages 1 - 25

https://doi.org/10.1145/3154500

Published: 19 December 2017 Publication History

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.

References

[1]

D. P. Anderson. 2004. BOINC: A System for Public-Resource Computing and Storage. In Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing (GRID '04). IEEE Computer Society, Washington, DC, USA, 4--10.

Digital Library

[2]

S. A. Berezner and A. E. Krzesinski. 1996. Order independent loss queues. Queueing Systems 23, 1 (01 Mar 1996), 331--335.

[3]

T. Bonald and C. Comte. 2017. Balanced fair resource sharing in computer clusters. Performance Evaluation 116, Supplement C (Nov. 2017), 70--83.

Digital Library

[4]

T. Bonald, C. Comte, V. Shah, and G. Veciana. 2017. Poly-symmetry in Processor-sharing Systems. Queueing Syst. Theory Appl. 86, 3--4 (Aug. 2017), 327--359.

Digital Library

[5]

T. Bonald, L. Massoulié, A. Proutiere, and J. Virtamo. 2006. A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing systems 53, 1 (2006), 65--84.

Digital Library

[6]

T. Bonald and A. Proutière. 2003. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems 44, 1 (May 2003), 69--100.

Digital Library

[7]

T. Bonald and J. Virtamo. 2004. Calculating the flow level performance of balanced fairness in tree networks. Perf. Evaluation 58, 1 (Oct. 2004), 1--14.

Digital Library

[8]

K. Gardner, M. Harchol-Balter, E. Hyytiä, and R. Righter. 2017. Scheduling for efficiency and fairness in systems with redundancy. Performance Evaluation 116, Supplement C (Nov. 2017), 1--25.

Digital Library

[9]

K. Gardner, M. Harchol-Balter, A. Scheller-Wolf, M. Velednitsky, and S. Zbarsky. 2017. Redundancy-d: The Power of d Choices for Redundancy. Operations Research 65, 4 (April 2017), 1078--1094.

[10]

K. Gardner, S. Zbarsky, S. Doroudi, M. Harchol-Balter, E. Hyytiä, and A. Scheller-Wolf. 2016. Queueing with redundant requests: exact analysis. Queueing Systems 83, 3--4 (Aug. 2016), 227--259.

Digital Library

[11]

P. G. Harrison. 1985. On normalizing constants in queueing networks. Operations research 33, 2 (1985), 464--468.

Digital Library

[12]

A. E. Krzesinski. 2011. Order Independent Queues. In Queueing Networks, R. J. Boucherie and N. M. van Dijk (Eds.). Number 154 in International Series in Operations Research & Management Science. Springer US, 85--120.

[13]

K.-H. Lee, Y.-J. Lee, H. Choi, Y. D. Chung, and B. Moon. 2012. Parallel data processing with MapReduce: a survey. ACM SIGMOD Record 40, 4 (2012), 11--20.

Digital Library

[14]

L. Massoulié. 2007. Structural properties of proportional fairness: Stability and insensitivity. Ann. Appl. Probab. 17, 3 (2007), 809--839.

[15]

V. Shah and G. de Veciana. 2015. High-Performance Centralized Content Delivery Infrastructure: Models and Asymptotics. Trans. on Networking 23, 5 (Oct. 2015), 1674--1687.

Digital Library

[16]

V. Shah and G. de Veciana. 2016. Asymptotic independence of servers' activity in queueing systems with limited resource pooling. Queueing Systems 83, 1--2 (2016), 13--28.

Digital Library

[17]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. 2001. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. SIGCOMM Comput. Commun. Rev. 31, 4 (Aug. 2001), 149--160.

Digital Library

Cited By

Gardner KMoyal P(2024)Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancyQueueing Systems: Theory and Applications10.1007/s11134-024-09922-1107:3-4(199-203)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s11134-024-09922-1
Gardner KMoyal P(2024)Editorial introduction: special issue on product forms, stochastic matching, and redundancyQueueing Systems: Theory and Applications10.1007/s11134-024-09908-z106:3-4(193-198)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11134-024-09908-z
Gardner K(2022)Correlation in redundancy systemsQueueing Systems: Theory and Applications10.1007/s11134-022-09829-9100:3-4(197-199)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11134-022-09829-9
Show More Cited By

Index Terms

Performance of Balanced Fairness in Resource Pools: A Recursive Approach
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
      1. Cloud computing
2. Mathematics of computing
  1. Probability and statistics
    1. Stochastic processes
      1. Markov processes

Recommendations

Performance of Balanced Fairness in Resource Pools: A Recursive Approach
SIGMETRICS '18

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 ...
Performance of Balanced Fairness in Resource Pools: A Recursive Approach
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems

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 ...
Performance Evaluation of Load Balanced Web Proxies
WAINA '11: Proceedings of the 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications

A large university usually has many units that may locate far apart, and there are many proxy servers installed to give web access services to those units individually. However, some proxies may face the performance bottleneck when many users access the ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Measurement and Analysis of Computing Systems

Proceedings of the ACM on Measurement and Analysis of Computing Systems Volume 1, Issue 2

December 2017

480 pages

EISSN:2476-1249

DOI:10.1145/3175501

Editors:
Augustin Chaintreau
Columbia University
,
Aditya Akella
University of Wisconsin-Madison
,
Adam Wierman
California Institute of Technology

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 December 2017

Published in POMACS Volume 1, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
162
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gardner KMoyal P(2024)Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancyQueueing Systems: Theory and Applications10.1007/s11134-024-09922-1107:3-4(199-203)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s11134-024-09922-1
Gardner KMoyal P(2024)Editorial introduction: special issue on product forms, stochastic matching, and redundancyQueueing Systems: Theory and Applications10.1007/s11134-024-09908-z106:3-4(193-198)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11134-024-09908-z
Gardner K(2022)Correlation in redundancy systemsQueueing Systems: Theory and Applications10.1007/s11134-022-09829-9100:3-4(197-199)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11134-022-09829-9
Miguelez FDoncel JPrabhu B(2022)Load-balancing for multi-skilled servers with Bernoulli routingAnnals of Operations Research10.1007/s10479-022-04532-7312:2(949-971)Online publication date: 15-Jan-2022
https://doi.org/10.1007/s10479-022-04532-7
Bonald TComte CMathieu F(2019)Performance of Balanced Fairness in Resource PoolsACM SIGMETRICS Performance Evaluation Review10.1145/3308809.330887446:1(125-127)Online publication date: 17-Jan-2019
https://doi.org/10.1145/3308809.3308874
Gardner KHyytiä ERighter R(2019)A little redundancy goes a long way: Convexity in redundancy systemsPerformance Evaluation10.1016/j.peva.2019.02.001Online publication date: Feb-2019
https://doi.org/10.1016/j.peva.2019.02.001
Bonald TComte CMathieu F(2018)Performance of Balanced Fairness in Resource PoolsACM SIGMETRICS Performance Evaluation Review10.1145/3292040.321966946:1(125-127)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3292040.3219669
Bonald TComte CMathieu FPsounis KAkella AWierman A(2018)Performance of Balanced Fairness in Resource PoolsAbstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems10.1145/3219617.3219669(125-127)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3219617.3219669
Ayesta UBodas TVerloop I(2018)On a unifying product form framework for redundancy modelsPerformance Evaluation10.1016/j.peva.2018.09.008127-128(93-119)Online publication date: Nov-2018
https://doi.org/10.1016/j.peva.2018.09.008

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents