Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
Journal article, 2017

Shared data object implementations that allow non-blocking concurrent operations are useful for in-memory data-processing, especially when they support consistent bulk operations like iterations. We propose an algorithmic implementation for concurrent iterators on shared double-ended queues (deques), building on and complementing a known lock-free deque implementation by M. Michael. The proposed construction is linearizable and wait-free. Moreover, it is read-only, so it does not execute expensive synchronization primitives and it does not interfere with update operations.

Author

Panagiota Fatourou

Panepistimio Kritis

Ioannis Nikolakopoulos

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Marina Papatriantafilou

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Parallel Processing Letters

0129-6264 (ISSN)

Vol. 27 2 Article no 1750001 -

Subject Categories

Computer and Information Science

DOI

10.1142/S0129626417500013

More information

Created

10/8/2017