Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
Fast Jackson Networks with Dynamic Routing
Problems of Information Transmission
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Randomized load balancing with general service time distributions
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
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.