Non-blocking Hashtables with Open Addressing
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 108-121
- https://doi.org/10.1007/11561927_10
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Advanced contention management for dynamic software transactional memoryPublished by Association for Computing Machinery (ACM) ,2005
- Non-blocking Hashtables with Open AddressingLecture Notes in Computer Science, 2005
- Split-ordered listsPublished by Association for Computing Machinery (ACM) ,2003
- High performance dynamic lock-free hash tables and list-based setsPublished by Association for Computing Machinery (ACM) ,2002
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writesPublished by Association for Computing Machinery (ACM) ,2002
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Concurrent reading and writingCommunications of the ACM, 1977