pith. sign in

arxiv: 1808.06348 · v1 · pith:5EDA42TUnew · submitted 2018-08-20 · 💻 cs.PL

Every Data Structure Deserves Lock-Free Memory Reclamation

classification 💻 cs.PL
keywords datalock-freememory-managementstructurestructuresoverheadschemesupport
0
0 comments X
read the original abstract

Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhead and does not rely on the lock freedom of any OS services.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.