A Matrix-Analytic Solution for Randomized Load Balancing Models with PH Service Times
- 672 Downloads
In this paper, we provide a matrix-analytic solution for randomized load balancing models (also known as supermarket models) with phase-type (PH) service times. Generalizing the service times to the phase-type distribution makes analysis of the supermarket models more difficult and challenging than that of the exponential service time case which has been extensively discussed in the literature. We describe the supermarket model as a system of differential vector equations, provide a doubly exponential solution to the fixed point of the system of differential vector equations, and analyze the exponential convergence of the current location of the supermarket model to its fixed point.
- 1.Bramson, M., Lu, Y., Prabhakar, B.: Randomized load balancing with general service time distributions. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 275–286 (2010)Google Scholar
- 7.Mitzenmacher, M.D.: The power of two choices in randomized load balancing. PhD thesis, University of California at Berkeley, Department of Computer Science, Berkeley, CA (1996)Google Scholar
- 8.Mitzenmacher, M.D.: Analyses of load stealing models using differential equations. In: Proceedings of the Tenth ACM Symposium on Parallel Algorithms and Architectures, pp. 212–221 (1998)Google Scholar
- 11.Mitzenmacher, M.D., Richa, A., Sitaraman, R.: The power of two random choices: a survey of techniques and results. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Handbook of Randomized Computing, vol. 1, pp. 255–312 (2001)Google Scholar
- 13.Telek, M., Heindl, A.: Matching moments for acyclic discrete and continuous phase-type distributions of second order. International Journal of Simulation: Systems, Science & Technology 3, 47–57 (2002)Google Scholar