Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming

  title={Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming},
  author={Josh Triplett and Paul E. McKenney and Jonathan Walpole},
  booktitle={USENIX Annual Technical Conference},
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow ReadCopy Update (RCU) hash tables to maintain constanttime performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers. We call the resulting data structure a relativistic hash table. Benchmarks of relativistic hash tables in the Linux kernel show that lookup… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS
38 Extracted Citations
26 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 38 extracted citations

58 Citations

Citations per Year
Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 26 references

The Art of Multiprocessor Programming

  • ch. Chapter 13: Concurrent Hashing and Natural…
  • 2008
Highly Influential
6 Excerpts

ddds: “dynamic dynamic data structure” algorithm, for adaptive dcache hash table sizing

  • Linux kernel mailing list. http: //…
  • 2008
Highly Influential
4 Excerpts

Relativistic red - black trees

  • J.
  • 2011 pdfs/tr1006.pdf

  • P. W. HOWARD
  • AND WALPOLE, J. Relativistic red-black trees…
  • 2011
1 Excerpt

Lockless hash table lookups while performing key update on hash table element

  • US Patent 7668851,
  • 2010
3 Excerpts

bridge: Add core IGMP snooping support

  • H XU
  • Linux netdev mailing list. http://…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…