ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1708.01797
  4. Cited By
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away
  Descriptors

Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors

5 August 2017
Maya Arbel-Raviv
Trevor Brown
ArXiv (abs)PDFHTML

Papers citing "Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors"

5 / 5 papers shown
Title
PathCAS: An Efficient Middle Ground for Concurrent Search Data
  Structures
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures
Trevor Brown
William Sigouin
Dan Alistarh
18
6
0
19 Dec 2022
Memory Bounds for Concurrent Bounded Queues
Memory Bounds for Concurrent Bounded Queues
Vitaly Aksenov
N. Koval
Petr Kuznetsov
A. Paramonov
15
0
0
30 Apr 2021
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations
  using only pointer-width CAS
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS
G. Blelloch
Yuanhao Wei
29
11
0
21 Nov 2019
Lock-Free Hopscotch Hashing
Lock-Free Hopscotch Hashing
R. Kelly
Barak A. Pearlmutter
Phil Maguire
16
5
0
08 Nov 2019
Concurrent Robin Hood Hashing
Concurrent Robin Hood Hashing
R. Kelly
Barak A. Pearlmutter
Phil Maguire
21
3
0
12 Sep 2018
1