Non-blocking Hashtables with Open Addressing
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 108-121
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Advanced contention management for dynamic software transactional memory2005
- Non-blocking Hashtables with Open Addressing2005
- Almost wait-free resizable hashtables2004
- Split-ordered lists2003
- High performance dynamic lock-free hash tables and list-based sets2002
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes2002
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Concurrent reading and writingCommunications of the ACM, 1977