Concurrent hash tables: fast and general?(!)

@article{Maier2016ConcurrentHT,
  title={Concurrent hash tables: fast and general?(!)},
  author={Tobias Maier and P. Sanders and R. Dementiev},
  journal={Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
  year={2016}
}
Concurrent hash tables are one of the most important concurrent data structures with numerous applications. Since hash table accesses can dominate the execution time of the overall application, we need implementations that achieve good speedup. Unfortunately, currently available concurrent hashing libraries turn out to be far away from this requirement in particular when contention on some elements occurs. Our starting point for better performing data structures is a fast and simple lock-free… Expand
Concurrent Hash Tables
Concurrent Chaining Hash Maps for Software Model Checking
High-Quality Shared-Memory Graph Partitioning
High-Quality Shared-Memory Graph Partitioning
Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
Concurrent Hash Tables
Teseo and the Analysis of Structural Dynamic Graphs
DisGCo: A Compiler for Distributed Graph Analytics
...
1
2
...

References

SHOWING 1-4 OF 4 REFERENCES
Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming
Lock-free parallel dynamic programming
Hash table util. concurrent. concurrenthashmap, revision 1.3. JSR-166, the proposed Java Concurrency Package
  • http://gee. cs. oswego. edu/cgi-bin/viewcvs
  • 2003
Intel R ©
  • Threading Building Blocks. J. Comput. Sci. Coll.,
  • 2008