A Lazy Concurrent List-Based Set Algorithm

Authors:

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.

This publication has 3 references indexed in Scilit: