Locking without blocking
John Turek, Dennis E. Shasha, Sundeep Prakash · 1992
Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.
Cited by 88 works. doi:10.1145/137097.137873 Open-access PDF
Authors
References
- Concurrency of operations on B-trees
- Efficient locking for concurrent operations on B-trees
- Concurrent manipulation of binary search trees
- Impossibility and universality results for wait-free synchronization
- Sticky bits and universality of consensus
- Concurrent search structure algorithms
- A nonblocking algorithm for shared queues using compare-and-swap
- Performance of B-tree concurrency control algorithms
- Multi-version memory: software cache management for concurrent B-trees
- A simple and correct shared-queue algorithm using compare-and-swap