Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
Artikel i vetenskaplig tidskrift, 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.

Författare

Panagiota Fatourou

Panepistimio Kritis

Ioannis Nikolakopoulos

Chalmers, Data- och informationsteknik, Nätverk och system

Marina Papatriantafilou

Chalmers, Data- och informationsteknik, Nätverk och system

Parallel Processing Letters

0129-6264 (ISSN)

Vol. 27 2 Article no 1750001 -

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1142/S0129626417500013