Convexity properties of the Erlang loss formula
Operations Research
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Traffic models in broadband networks
IEEE Communications Magazine
Access-efficient Balanced Bloom Filters
Computer Communications
| Hi-index | 0.00 |
We show that when memory is bounded, i.e. memory buckets are finite, dynamic hash tables that allow insertions and deletions behave significantly worse than their static counterparts that only allow insertions. This behavior differs from previous results in which, when memory is unbounded, the two models behave similarly. We show the decrease in performance in dynamic hash tables using several hash-table schemes. We also provide tight upper and lower bounds on the achievable overflow fractions in these schemes. Finally, we propose an architecture with content-addressable memory (CAM), which mitigates this decrease in performance.