Split-ordered lists: lock-free extensible hash tables

We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations with an expected O(1) cost. It consists of very simple code, easily implementable using only load, store, and compareand-swap operations. The new mathematical structure at the core of our algorithm is recursive splitordering, a way of ordering elements in a linked list so that they can be repeatedly “split” using a single compare-and-swap operation. Metaphorically speaking, our algorithm differs from prior known algorithms in that extensibility is derived by “moving the buckets among the items” rather than “the items among the buckets.” Though lock-free algorithms are expected to work best in multiprogrammed environments,empiricaltestsweconductedonalargesharedmemorymultiprocessorshowthatevenin non-multiprogrammed environments, the new algorithm performs as well as the most efficient known lock-ba...

• Type: Conference
• Year: 2003
• Where: PODC
• Authors: Ori Shalev, Nir Shavit
• Keywords: Algorithm, Distributed And Parallel Computing, PODC 2003, Resizable Hash-table Algorithm, first Lock-free Implementation