Power of d choices with simple tabulation

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Dokumenter

We consider the classic d-choice paradigm of Azar et al. [STOC'94] in which m balls are put into n bins sequentially as follows: For each ball we are given a choice of d bins chosen according to d hash functions and the ball is placed in the least loaded of these bins, breaking ties arbitrarily. The interest is in the number of balls in the fullest bin after all balls have been placed. In this paper we suppose that the d hash functions are simple tabulation hash functions which are easy to implement and can be evaluated in constant time. Generalising a result by Dahlgaard et al. [SODA'16] we show that for an arbitrary constant d ≥ 2 the expected maximum load is at mostlg lg lg d n + O(1). We further show that by using a simple tie-breaking algorithm introduced by Vöcking [J.ACM'03] the expected maximum load is reduced tod lg lg lg ϕ n d + O(1) where ϕd is the rate of growth of the d-ary Fibonacci numbers. Both of these expected bounds match those known from the fully random setting. The analysis by Dahlgaard et al. relies on a proof by P tra cu and Thorup [J.ACM'11] concerning the use of simple tabulation for cuckoo hashing. We require a generalisation to d > 2 hash functions, but the original proof is an 8-page tour de force of ad-hoc arguments that do not appear to generalise. Our main technical contribution is a shorter, simpler and more accessible proof of the result by P tra cu and Thorup, where the relevant parts generalise nicely to the analysis of d choices.

OriginalsprogEngelsk
Titel45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
RedaktørerChristos Kaklamanis, Daniel Marx, Ioannis Chatzigiannakis, Donald Sannella
Antal sider14
ForlagSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publikationsdato1 jul. 2018
Artikelnummer5
ISBN (Elektronisk)9783959770767
DOI
StatusUdgivet - 1 jul. 2018
Begivenhed45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 - Prague, Tjekkiet
Varighed: 9 jul. 201813 jul. 2018

Konference

Konference45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
LandTjekkiet
ByPrague
Periode09/07/201813/07/2018
SponsorAvast, RSJ
NavnLeibniz International Proceedings in Informatics, LIPIcs
Vol/bind107
ISSN1868-8969

Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk


Ingen data tilgængelig

ID: 211949902