Of concurrent data structures and iterations

DOI10.1007/978-3-319-24024-4_20zbMATH Open1331.68065DBLPconf/birthday/NikolakopoulosG15aOpenAlexW1458136925WikidataQ57583876 ScholiaQ57583876MaRDI QIDQ3464481FDOQ3464481

Authors: Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas 

Publication date: 27 January 2016

Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_20

Recommendations

• Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
• In the search for optimal concurrency
• On the inherent sequentiality of concurrent objects
• The future(s) of shared data structures
• A closer look at concurrent data structures and algorithms

zbMATH Keywords

consistencyiterationlock-freeconcurrent data structuresin-memory computationrange-queries

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• On interprocess communication. II: Algorithms
• Time-Lapse Snapshots
• Time-space tradeoffs for implementations of snapshots
• New Data Structures for Orthogonal Range Queries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Purely Functional Data Structures
• An optimal multi-writer snapshot algorithm
• Of concurrent data structures and iterations
• Leaplist: lessons learned in designing TM-supported range queries
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner

Cited In (2)

• Title not available (Why is that?)
• Of concurrent data structures and iterations

Uses Software

• Intel TBB
• Python
• Noble

This page was built for publication: Of concurrent data structures and iterations

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