Balanced Allocation Through Random Walk
Authors:
Preprint
Abstract
We consider the allocation problem in which $m \leq (1-\epsilon) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin locations $p_i=h_1(x_i),q_i=h_2(x_i)$ via hash functions $h_1,h_2$. We consider a random walk procedure for inserting items and show that the expected time insertion time is constant provided $\epsilon = \Omega\left(\sqrt{ \frac{ \log d}{d}} \right).$
Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- On the Insertion Time of Cuckoo HashingSIAM Journal on Computing, 2013
- An Analysis of Random-Walk Cuckoo HashingSIAM Journal on Computing, 2011
- Balanced allocation and dictionaries with tightly packed constant size binsTheoretical Computer Science, 2007
- Space Efficient Hash Tables with Worst Case Constant Access TimeLecture Notes in Computer Science, 2003