CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues

Panagiota Fatourou ; Yiannis Nikolakopoulos (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Marina Papatriantafilou (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
PARALLEL PROCESSING LETTERS (0129-6264). Vol. 27 (2017), 2, p. Article no 1750001 .
[Artikel, refereegranskad vetenskaplig]

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.



Denna post skapades 2017-08-23.
CPL Pubid: 251351

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)