On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Allocating weighted jobs in parallel
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallel continuous randomized load balancing (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Simple competitive request scheduling strategies
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Randomized and adversarial load balancing
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Average-case analyses of first fit and random fit bin packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Infinite parallel job allocation (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
On Balls and Bins with Deletions
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Analyzing an Infinite Parallel Job Allocation Process
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
How asymmetry helps load balancing
Journal of the ACM (JACM)
Reducing Network Congestion and Blocking Probability through Balanced Allocation
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Balanced allocations: the weighted case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Approximated two choices in randomized load balancing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.01 |
We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following model: customers arrive as a Poisson stream of rate 驴n, 驴