Batu, Tugkan 
ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin
(2011)
Chains-into-bins processes.
In: Iliopoulos, Costas S. and Smyth, William F., (eds.)
Combinatorial Algorithms.
Lecture notes in computer science (6460).
Springer Berlin / Heidelberg, pp. 314-325.
ISBN 9783642192210
Abstract
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 ((ln ln m)/ln d) + O(1) with probability 1−O(1md−1) .
| Item Type: | Book Section |
|---|---|
| Official URL: | http://www.springerlink.com/ |
| Additional Information: | © 2011 Springer |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 23 Jan 2012 14:46 |
| Last Modified: | 11 Dec 2024 17:32 |
| URI: | http://eprints.lse.ac.uk/id/eprint/41646 |
Actions (login required)
 |
View Item |
