Abstract
Concurrent data structures synchronized with locks do not scale well with the number of threads. As more scalable alternatives, concurrent data structures and algorithms based on widely available, however advanced, atomic operations have been proposed. These data structures allow for correct and concurrent operations without any locks. In this paper, we present a new fully lock-free open addressed hash table with a simpler design than prior published work. We split hash table insertions into two atomic phases: first inserting a value ignoring other concurrent operations, then in the second phase resolve any duplicate or conflicting values.
Our hash table has a constant and low memory usage that is less than existing lock-free hash tables at a fill level of 33% and above. The hash table exhibits good cache locality. Compared to prior art, our hash table results in 16% and 15% fewer L1 and L2 cache misses respectively, leading to 21% fewer memory stall cycles. Our experiments show that our hash table scales close to linearly with the number of threads and outperforms, in throughput, other lock-free hash tables by 19%.
- Papi. http://icl.cs.utk.edu/papi/. Retrieved: 2015-09-12.Google Scholar
- S. Feldman, P. LaBorde, and D. Dechev. Concurrent multi-level arrays: Wait-free extensible hash maps. in Proceedings - International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, 2013.Google Scholar
Cross Ref
- T. Harris. A pragmatic implementation of non-blocking linked-lists. in Proceedings of the 15th International Conference on Distributed Computing, 2001. Google Scholar
Digital Library
- M. Michael. High performance dynamic lock-free hash tables and list-based sets. in Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002. Google Scholar
Digital Library
- C. Purcell and T. Harris. Non-blocking hatables with open addressing. University of Cambridge Technical Report, 2005.Google Scholar
Index Terms
A scalable lock-free hash table with open addressing
Recommendations
A scalable lock-free hash table with open addressing
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingConcurrent data structures synchronized with locks do not scale well with the number of threads. As more scalable alternatives, concurrent data structures and algorithms based on widely available, however advanced, atomic operations have been proposed. ...
Transactional lock-free execution of lock-based programs
Special Issue: Proceedings of the 10th annual conference on Architectural Support for Programming Languages and Operating SystemsThis paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multi-threaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access ...






Comments