Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap

Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a general lock-free doubly linked list, and only requires single-word compare-and-swap atomic primitives. It also allows pointers with full precision, and thus supports dynamic deque sizes. We have performed an empirical study using full implementations of the most efficient known algorithms of lock-free deques. For systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory...

• Type: Conference
• Year: 2004
• Where: OPODIS
• Authors: Håkan Sundell, Philippas Tsigas
• Keywords: Atomic Primitive, Disjoint Accesses, Lock-free, OPODIS 2004, OPODIS 2007