A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
A mean field model of work stealing in large-scale systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services
Performance Evaluation
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
| Hi-index | 0.00 |
In this paper we compare the performance of the pull and push strategy in a large homogeneous distributed system. When a pull strategy is in use, lightly loaded nodes attempt to steal jobs from more highly loaded nodes, while under the push strategy more highly loaded nodes look for lightly loaded nodes to process some of their jobs. Given the maximum allowed overall probe rate R and arrival rate λ, we provide closed form solutions for the mean response time of a job for the push and pull strategy under the infinite system model. More specifically, we show that the push strategy outperforms the pull strategy for any probe rate R 0 when λ R + 1)2 + 4(R + 1) − (R + 1). We also show that under the infinite system model, a hybrid pull and push strategy is always inferior to the pure pull or push strategy. The relation between the finite and infinite system model is discussed and simulation results that validate the infinite system model are provided.