The future(s) of shared data structures

DOI10.1145/2611462.2611496MaRDI QIDQ2943609zbMATH OpenOpenAlexFDO

Authors Alex Kogan, Maurice Herlihy

Publication date 3 September 2015

Published in Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2611462.2611496

zbMATH Keywords

combiningconcurrent data structureseliminationfutureslinearizability

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Local linearizability for concurrent container-type data structures
• Toward a model for shared data abstraction with performance
• scientific article; zbMATH DE number 1263230
• Pipelining with futures
• Analyzing the performance of lock-free data structures: a conflict-based model

Cited in

(9)

• Toward a model for shared data abstraction with performance
• scientific article; zbMATH DE number 1705160 (Why is no real title available?)
• The ramifications of sharing in data structures
• Study on multi-core data structure in shared-memory
• Of concurrent data structures and iterations
• Dependence analysis for safe futures
• A framework for correctness criteria on weak memory models
• A Wait-free Queue with Polylogarithmic Step Complexity
• A wait-free queue with polylogarithmic step complexity

This page was built for publication: The future(s) of shared data structures

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