Every data structure deserves lock-free memory reclamation

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.

Published in:
Proceedings of the ACM on Programming Languages, 2, OOPSLA, 1-24
Presented at:
2018 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Boston, Massachusetts, USA, October 7-9, 2018
Nov 07 2018
Other identifiers:

 Record created 2018-11-07, last modified 2020-10-24

Rate this document:

Rate this document:
(Not yet reviewed)