Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel randomized load balancing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
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
Analyzing an Infinite Parallel Job Allocation Process
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Randomized Allocation Processes
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Load balancing and density dependent jump Markov processes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Anonymous distribution of encryption keys in cellular broadcast systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Hi-index | 0.00 |
We consider the problem of extending the analysis of balls and bins processes where a ball is placed in the least loaded of d randomly chosen bins to cover deletions. In particular, we are interested in the case where the system maintains a fixed load, and deletions are determined by an adversary before the process begins. We show that with high probability the load in any bin is O(log log n). In fact, this result follows from recent work by Cole et al. concerning a more difficult problem of routing in a butterfly network. The main contribution of this paper is to give a different proof of this bound, which follows the lines of the analysis of Azar, Broder, Karlin, and Upfal for the corresponding static load balancing problem. We also give a specialized (and hence simpler) version of the argument from the paper by Cole et al. for the balls and bins scenario. Finally, we provide an alternative analysis also based on the approach of Azar, Broder, Karlin, and Upfal for the special case where items are deleted according to their age. Although this analysis does not yield better bounds than our argument for the general case, it is interesting because it utilizes a two-dimensional family of random variables in order to account for the age of the items. This technique may be of more general use.