Non-blocking hashtables with open addressing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3724 LNCS, Issue , 2005, Pages 108-121

  Purcell, Chris ^a   Harris, Tim ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COST EFFECTIVENESS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

GARBAGE COLLECTOR; MEMORY ALLOCATOR SCHEMES; NON-BLOCKING HASHTABLES;

BUFFER STORAGE;

EID: 33646385601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_10     Document Type: Conference Paper

References (11)

1. GAO, H., GROOTE, J. AND HESSELINK, W. Almost Wait-Free Resizable Hashtables In Proceedings of the 18th International Parallel and Distributed Processing Symposium, April 2004, p.50a.
2. FRASER, K. Practical Lock-Freedom. University of Cambridge Computer Laboratory, Technical Report number 579, February 2004.
3. KNUTH, D. The Art of Computer Programming. Part 3, Sorting and Searching. Addison-Wesley, 1973.
4. LAMPORT, L. Concurrent Reading and Writing. In Communications of the ACM, 1977, pp.806-811.
5. MARTIN, D. AND DAVIS, R. A Scalable Non-Blocking Concurrent Hash Table Implementation with Incremental Rehashing. Unpublished manuscript, 1997.
6. MELLOR-CRUMMEY, J. AND SCOTT, M. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. In A CM Transactions on Computer Systems, Volume 9, Issue 1, February 1991, pp. 21-65.
7. MICHAEL, M. Safe Memory Reclamation for Dynamic Lock-Free Objects using Atomic Reads and Writes. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, July 2002, pp.21-30.
8. MICHAEL, M. High performance dynamic lock-free hash tables and list-based sets In Proceedings of the 14th Annual Symposium on Parallel Algorithms and Architectures, August 2002, pp.73-82.
9. SHALEV, O. AND SHAVIT, N. Split-Ordered Lists: Lock-free Extensible Hash Tables. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, July 2003, pp.102-111.
10. SCHERER, W. AND SCOTT, M. Contention Management in Dynamic Software Transactional Memory. In PODC Workshop on Concurrency and Synchronization in Java Programs, July 2004, pp.70-79.
11. PURCELL, C. AND HARRIS, T. Non-blocking Hashtables with Open Addressing. University of Cambridge Computer Laboratory, Technical Report number 639, September 2005.