Pragmatic Primitives for Non-blocking Data Structures

18 December 2017

Papers citing "Pragmatic Primitives for Non-blocking Data Structures"

15 / 15 papers shown

Title
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures Trevor Brown William Sigouin Dan Alistarh 16 6 0 19 Dec 2022
Implementing and Breaking Load-Link / Store-Conditional on an ARM-Based System Evan Tilley Alexander Y Liebeskind Rafael Asensio 23 0 0 19 Jul 2022
Lock-Free Locks Revisited N. Ben-David G. Blelloch Yuanhao Wei 39 8 0 03 Jan 2022
Elimination (a,b)-trees with fast, durable updates Anubhav Srivastava Trevor Brown 28 14 0 31 Dec 2021
Efficient Multi-word Compare and Swap R. Guerraoui Alex Kogan Virendra J. Marathe I. Zablotchi 39 13 0 06 Aug 2020
Adapting Persistent Data Structures for Concurrency and Speculation Thomas D. Dickerson 84 2 0 16 Mar 2020
The Amortized Analysis of a Non-blocking Chromatic Tree Jeremy Ko 27 2 0 14 Nov 2018
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries P. Fatourou Eric Ruppert 16 34 0 12 May 2018
A General Technique for Non-blocking Trees Trevor Brown Faith Ellen Eric Ruppert 35 114 0 18 Dec 2017
Techniques for Constructing Efficient Lock-free Data Structures Trevor Brown 96 22 0 14 Dec 2017
A Template for Implementing Fast Lock-free Trees Using HTM Trevor Brown 44 10 0 16 Aug 2017
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors Maya Arbel-Raviv Trevor Brown 24 15 0 05 Aug 2017
PI : a Parallel in-memory skip list based Index Zhongle Xie Qingchao Cai H. V. Jagadish Beng Chin Ooi Weng-Fai Wong 30 9 0 02 Jan 2016
Non-Blocking Doubly-Linked Lists with Good Amortized Complexity Niloufar Shafiei 52 9 0 08 Aug 2014
Non-blocking Patricia Tries with Replace Operations Niloufar Shafiei 63 29 0 14 Mar 2013