skip to main content
research-article

Performance of Balanced Fairness in Resource Pools: A Recursive Approach

Published:19 December 2017Publication History
Skip Abstract Section

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

Index Terms

  1. Performance of Balanced Fairness in Resource Pools: A Recursive Approach

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!