TY - JOUR
AU - Michael, Maged M.
AB -  High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NY 10598 USA magedm@us.ibm.com ABSTRACT Lock-free (non-blocking) shared data structures promise more robust performance and reliability than conventional lockbased implementations. However, all prior lock-free algorithms for sets and hash tables su €er from serious drawbacks that prevent or limit their use in practice. These drawbacks include size in ‚exibility, dependence on atomic primitives not supported on any current processor architecture, and dependence on highly-ine ƒcient or blocking memory management techniques. Building on the results of prior researchers, this paper presents the rst CAS-based lock-free list-based set algorithm that is compatible with all lock-free memory management methods. We use it as a building block of an algorithm for lock-free hash tables. In addition to being lock-free, the new algorithm is dynamic, linearizable, and space-e ƒcient. Our experimental results show that the new algorithm outperforms the best known lock-free as well as lock-based hash table implementations by signi cant margins, and indicate that it is the algorithm of choice for implementing shared hash tables. Categories and Subject Descriptors: D.1.3 [Programming Techniques]: Concurrent Programming; D.4.1 [Operating Systems]: Process 
TI - High performance dynamic lock-free hash tables and list-based sets
DO - 10.1145/564870.564881
DA - 2002-08-10
UR - https://www.deepdyve.com/lp/association-for-computing-machinery/high-performance-dynamic-lock-free-hash-tables-and-list-based-sets-0BXAFgTCNe
DP - DeepDyve
ER -