A Lazy Concurrent List-Based Set Algorithm
Authors:
- 1 December 2007
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 17 (04) , 411-424
Abstract
We present a novel “lazy” list-based implementation of a concurrent set object. It is based on an optimistic locking scheme for inserts and removes and includes a simple wait-free membership test. Our algorithm improves on the performance of all previous such algorithms.Keywords
This publication has 3 references indexed in Scilit:
- A Pragmatic Implementation of Non-blocking Linked-lists2001
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990