High Performance Dynamic Lock-Free Hash Tables and List-Based Sets

Prior lock-free algori hms for sets and hash ables suffer from one or more serious drawbacks:size infelexibility,dependence on atomic primitives no supported on any curren processor architecture,susceptibility o live-lock,or dependence on problematic and highly-in efficient memory management techniques. This paper presents a lock-free list-based set algorithm that also can be used as a building block of dynamic lock-free hash tables.The new algorithm is dynamic,linearizable,livelock-free,CAS-based,and compatible with all Efficient lock-free memory managemen methods.