Consistent hashing with bounded loads

MaRDI QIDQ4607920zbMATH OpenFDO

Authors Mikkel Thorup, Morteza Zadimoghaddam, Vahab S. Mirrokni

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1608.01350, http://dl.acm.org/citation.cfm?id=3175309

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Recommendations

• Balanced allocations (extended abstract)
• Balanced Allocations
• Automata, Languages and Programming
• Balanced allocation and dictionaries with tightly packed constant size bins
• Perfectly balanced allocation

Cited in

(8)

• Efficiently extendible mappings for balanced data distribution
• Balanced allocation and dictionaries with tightly packed constant size bins
• Last-come-first-served hashing
• Round-hashing for data storage: distributed servers and external-memory tables
• Strongly Constrained Discrete Hashing
• Hashing, load balancing and multiple choice
• Automata, Languages and Programming
• Load Thresholds for Cuckoo Hashing with Overlapping Blocks

This page was built for publication: Consistent hashing with bounded loads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607920)