How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
- 26 August 2024
- book chapter
- Published by Springer Nature
- p. 119-133
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Upper and Lower Bounds for Deterministic Approximate Objects2021
- Scal: A Benchmarking Suite for Concurrent Data Structures2015
- Quiescent Consistency: Defining and Verifying Relaxed Linearizability2014
- Fast concurrent queues for x86 processors2013
- Performance, Scalability, and Semantics of Concurrent FIFO Queues2012
- On the Inherent Sequentiality of Concurrent ObjectsSIAM Journal on Computing, 2012
- Data structures in the multicore ageCommunications of the ACM, 2011
- A scalable lock-free stack algorithmJournal of Parallel and Distributed Computing, 2010
- Randomized parallel algorithms for backtrack search and branch-and-bound computationJournal of the ACM, 1993
- Concurrent reading while writing II: The multi-writer case1987