Lock-Free and Practical Deques using Single-Word Compare-And-Swap

Details Lock-Free and Practical Deques using Single-Word Compare-And-Swap Lock-Free and Practical Deques using Single-Word Compare-And-Swap

2004-08-05

arxiv.org/abs/cs/0408016v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible 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 doubly linked list, and only requires single-word compare-and-swap atomic primitives, even for dynamic memory sizes. We have performed an empirical study using full implementations of the most efficient algorithms of lock-free deques known. 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.

Affiliated with

Also associated with

No associations

Rating

Lock-Free and Practical Deques using Single-Word Compare-And-Swap does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lock-Free and Practical Deques using Single-Word Compare-And-Swap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lock-Free and Practical Deques using Single-Word Compare-And-Swap will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410129