Lock-Free and Practical Doubly Linked List-Based Deques using Single-Word Compare-And-Swap
Artikel i vetenskaplig tidskrift, 2004

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 architecture. In addition, the proposed solution also implements a general doubly linked list, the first lock-free implementation that only needs the single-word compare-and-swap atomic primitive.

deque

doubly linked list

lock-free

shared memory

Författare

Håkan Sundell

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Philippas Tsigas

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 3544 240-255

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/11516798_18