Abstract
The supermarket model is a popular load balancing model where each incoming job is assigned to a server with the least number of jobs among d randomly selected servers. Several authors have shown that the large scale limit in case of processor sharing servers has a unique insensitive fixed point, which naturally leads to the belief that the queue length distribution in such a system is insensitive to the job size distribution as the number of servers tends to infinity. Simulation results that support this belief have also been reported. However, global attraction of the unique fixed point of the large scale limit was not proven except for exponential job sizes, which is needed to formally prove asymptotic insensitivity. The difficulty lies in the fact that with processor sharing servers, the limiting system is in general not monotone.
In this paper we focus on the class of hyperexponential distributions of order 2 and demonstrate that for this class of distributions global attraction of the unique fixed point can still be established using monotonicity by picking a suitable state space and partial order. This allows us to formally show that we have asymptotic insensitivity within this class of job size distributions. We further demonstrate that our result can be leveraged to prove asymptotic insensitivity within this class of distributions for other load balancing systems.
- M. Bramson, Y. Lu, and B. Prabhakar. 2010. Randomized load balancing with general service time distributions. In ACM SIGMETRICS 2010. 275--286. https://doi.org/10.1145/1811039.1811071Google Scholar
Digital Library
- M. Bramson, Y. Lu, and B. Prabhakar. 2012. Asymptotic independence of queues under randomized load balancing. Queueing Syst., Vol. 71, 3 (2012), 247--292. https://doi.org/10.1007/s11134-012--9311-0Google Scholar
Cross Ref
- Shelby L. Brumelle. 1978. A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates. Mathematics of Operations Research, Vol. 3, 1 (1978), 10--16. http://www.jstor.org/stable/3689615Google Scholar
Digital Library
- D.L. Eager, E.D. Lazowska, and J. Zahorjan. 1986. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Perform. Eval., Vol. 6, 1 (1986), 53--68. https://doi.org/10.1016/0166--5316(86)90008--8Google Scholar
Cross Ref
- S.N. Ethier and T.C. Kurtz. 1986. Markov processes: characterization and convergence. Wiley.Google Scholar
- A. Ganesh, S. Lilienthal, D. Manjunath, A. Proutiere, and F. Simatos. 2010. Load Balancing via Random Local Search in Closed and Open Systems. SIGMETRICS Perform. Eval. Rev., Vol. 38, 1 (June 2010), 287--298. https://doi.org/10.1145/1811099.1811072Google Scholar
Digital Library
- N. Gast and B. Gaujal. 2010. A Mean Field Model of Work Stealing in Large-scale Systems. SIGMETRICS Perform. Eval. Rev., Vol. 38, 1 (June 2010), 13--24. https://doi.org/10.1145/1811099.1811042Google Scholar
Digital Library
- T. Hellemans, T. Bodas, and B. Van Houdt. 2019. Performance Analysis of Workload Dependent Load Balancing Policies. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 3, 2 (2019), 35. https://doi.org/10.1145/3376930.3376936Google Scholar
Digital Library
- T. Hellemans and B. Van Houdt. 2018. On the Power-of-d-choices with Least Loaded Server Selection. Proc. ACM Meas. Anal. Comput. Syst. (June 2018).Google Scholar
- M.W. Hirsch and H. Smith. 2006. Monotone dynamical systems. Handbook of differential equations: ordinary differential equations, Vol. 2 (2006), 239----357.Google Scholar
- I.A. Horváth, Z. Scully, and B. Van Houdt. 2019. Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 3, 3 (2019).Google Scholar
- X. Liu, K. Gong, and L. Ying. 2020. Steady-State Analysis of Load Balancing with Coxian-2 Distributed Service Times. arXiv preprint (2020). https://arxiv.org/abs/2005.09815Google Scholar
- W. Minnebo and B. Van Houdt. 2014. A Fair Comparison of Pull and Push Strategies in Large Distributed Networks. IEEE/ACM Transactions on Networking, Vol. 22 (2014), 996--1006. Issue 3.Google Scholar
Digital Library
- M. Mitzenmacher. 2001. The Power of Two Choices in Randomized Load Balancing. IEEE Trans. Parallel Distrib. Syst., Vol. 12 (October 2001), 1094--1104. Issue 10.Google Scholar
Digital Library
- S. Shneer and S. Stolyar. 2020. Large-scale parallel server system with multi-component jobs. arXiv preprint (2020). https://arxiv.org/abs/2006.11256Google Scholar
- B. Van Houdt. 2019. Global Attraction of ODE-based Mean Field Models with Hyperexponential Job Sizes. Proc. ACM Meas. Anal. Comput. Syst., Vol. 3, 2 (June 2019), Article 23. https://doi.org/10.1145/3326137Google Scholar
Cross Ref
- T. Vasantam, A. Mukhopadhyay, and R. R. Mazumdar. 2018a. The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy. Performance Evaluation, Vol. 127--128 (2018), 120 -- 153. https://doi.org/10.1016/j.peva.2018.09.010Google Scholar
Cross Ref
- T. Vasantam, A. Mukhopadhyay, and R. R. Mazumdar. 2018b. The mean-field behavior of processor sharing systems with general job lengths under the sq(d) policy. Performance Evaluation, Vol. 127--128 (2018), 120--153.Google Scholar
Cross Ref
- N.D. Vvedenskaya, R.L. Dobrushin, and F.I. Karpelevich. 1996. Queueing System with Selection of the Shortest of Two Queues: an Asymptotic Approach. Problemy Peredachi Informatsii, Vol. 32 (1996), 15--27.Google Scholar
Index Terms
On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems
Recommendations
On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems
SIGMETRICS '21The supermarket model is a popular load balancing model where each incoming job is assigned to a server with the least number of jobs among d randomly selected servers. Several authors have shown that the large scale limit in case of processor sharing ...
On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems
SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsThe supermarket model is a popular load balancing model where each incoming job is assigned to a server with the least number of jobs among d randomly selected servers. Several authors have shown that the large scale limit in case of processor sharing ...
Sojourn times in a processor sharing queue with multiple vacations
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are ...






Comments