Wait-free concurrent graph objects with dynamic traversals

DOI10.4230/LIPICS.OPODIS.2015.27MaRDI QIDQ5363818zbMATH OpenOpenAlexFDO

Authors Nikolaos D. Kallimanis, Eleni Kanellou

Publication date 29 September 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/opodis/opodis2015.html#KallimanisK15

zbMATH Keywords

concurrent data structuregraphshared memorysnapshot

Mathematics Subject Classification ID

Data structures (68P05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A concurrent implementation of skip graphs
• Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
• scientific article; zbMATH DE number 2006660
• Local linearizability for concurrent container-type data structures
• A concurrent dynamic task graph

Cited in

(1)

• Wait-free concurrent memory management by create and read until deletion (CaRuD)

This page was built for publication: Wait-free concurrent graph objects with dynamic traversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363818)