Low-contention data structures

DOI10.1016/j.jpdc.2011.10.018zbMath1242.68079OpenAlexW2064418086MaRDI QIDQ433458

David Eisenstat, James Aspnes, Yitong Yin

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.10.018

zbMATH Keywords

memory contentiondata structurecell-probe model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Cites Work

• Unnamed Item
• A complexity theory of efficient parallel algorithms
• An optimal parallel dictionary
• Universal classes of hash functions
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Should Tables Be Sorted?
• Contention in shared memory algorithms
• Cuckoo hashing
• Probability Inequalities for Sums of Bounded Random Variables
• Parallelism in random access machines
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Low-contention data structures