Abstract
LHlf is a new hash table designed to allow very high levels of concurrency. The table is lock free and grows and shrinks auto-matically according to the number of items in the table. Insertions, lookups and deletions are never blocked. LHlf is based on linear hashing but adopts recursive split-ordering of the items within a bucket to be able to split and merge lists in a lock free manner. LHlf is as fast as the best previous lock-free design and in addition it offers stable performance, uses less space, and supports both expansions and contractions.
- Griswold, W. G. and Townsend, G. M. 1993. The Design and Implementation of Dynamic Hashing for Sets and Tables in Icon". Software - Practice and Experience, 23(4):351--67. Google Scholar
Digital Library
- Harris, T. L. 2001. A Pragmatic Implementation of Non-Blocking Linked-Lists. DISC '01: 300--314. Google Scholar
Digital Library
- Herlihy, M., Luchangco, V., and Moir, M. 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC '02: 339--353. Google Scholar
Digital Library
- Larson, P.-Å. 1988. Dynamic Hash Tables, CACM 31(4): 446--457. Google Scholar
Digital Library
- Litwin, W. 1980. Linear Hashing: A New Tool for File and Table Addressing, VLDB '80: 212--223. Google Scholar
Digital Library
- Michael, M. M. 2002. High Performance Dynamic Lock-free Hash Tables and List-based Sets. SPAA '02: 73--82. Google Scholar
Digital Library
- Michael, M. M. 2004. Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE TPDS 15(6): 491--504. Google Scholar
Digital Library
- Shalev, O. and Shavit, N. 2006. Split-ordered Lists: Lock-free Extensible Hash Tables. JACM 53(3): 379--405. Google Scholar
Digital Library
Index Terms
LHlf: lock-free linear hashing (poster paper)
Recommendations
LHlf: lock-free linear hashing (poster paper)
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel ProgrammingLHlf is a new hash table designed to allow very high levels of concurrency. The table is lock free and grows and shrinks auto-matically according to the number of items in the table. Insertions, lookups and deletions are never blocked. LHlf is based on ...
SRC: facilitating efficient parallelization of information storage and retrieval on large data sets
ICS '11: Proceedings of the international conference on SupercomputingThe purpose of this work is to develop a lock-free hash table that allows a large number of threads to concurrently insert, modify, or retrieve information. Lock-free or non-blocking designs alleviate the problems traditionally associated with lock-...
Enhanced chained and Cuckoo hashing methods for multi-core CPUs
A hash table is a fundamental data structure implementing an associative memory that maps a key to its associative value. Besides, the paradigm of micro-architecture design of CPUs is shifting away from faster uniprocessors toward slower chip ...







Comments