Dynamic-sized nonblocking hash tables
Authors:
Open Access
- 15 July 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 242-251
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Practical Non-blocking Unordered ListsLecture Notes in Computer Science, 2013
- A methodology for creating fast wait-free data structures2012
- Hopscotch Hashing2008
- Split-ordered listsJournal of the ACM, 2006
- Non-blocking Hashtables with Open Addressing2005
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Concurrent operations on extendible hashing and its performanceCommunications of the ACM, 1990
- Concurrency in linear hashingACM Transactions on Database Systems, 1987
- Extendible hashing for concurrent operations and distributed data1983
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974