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.
- 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. Google Scholar
Digital Library
- S. A. Berezner and A. E. Krzesinski. 1996. Order independent loss queues. Queueing Systems 23, 1 (01 Mar 1996), 331--335.Google Scholar
- T. Bonald and C. Comte. 2017. Balanced fair resource sharing in computer clusters. Performance Evaluation 116, Supplement C (Nov. 2017), 70--83. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- T. Bonald and A. Proutière. 2003. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems 44, 1 (May 2003), 69--100. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- P. G. Harrison. 1985. On normalizing constants in queueing networks. Operations research 33, 2 (1985), 464--468. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- L. Massoulié. 2007. Structural properties of proportional fairness: Stability and insensitivity. Ann. Appl. Probab. 17, 3 (2007), 809--839.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
Index Terms
Performance of Balanced Fairness in Resource Pools: A Recursive Approach
Recommendations
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 SystemsUnderstanding 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 '18Understanding 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 ApplicationsA 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