A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
SIAM Journal on Computing
Optimal FPGA module placement with temporal precedence constraints
Proceedings of the conference on Design, automation and test in Europe
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
How asymmetry helps load balancing
Journal of the ACM (JACM)
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Balanced Allocations: The Heavily Loaded Case
SIAM Journal on Computing
Balanced allocations: the weighted case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The study of balls-into-bins processes or occupancy problems has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins process is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this paper, we analyze the maximum load for the chains-into-bins problem, which is defined as follows. There are n bins, and m objects to be allocated. Each object consists of balls connected into a chain of length @?, so that there are m@? balls in total. We assume the chains cannot be broken, and that the balls in one chain have to be allocated to @? consecutive bins. We allow each chain d independent and uniformly random bin choices for its starting position. The chain is allocated using the rule that the maximum load of any bin receiving a ball of that chain is minimized. We show that, for d=2 and m@?@?=O(n), the maximum load is ((lnlnm)/lnd)+O(1) with probability 1-O@?(1/m^d^-^1).