Work

Versioned Programming: A Simple Technique for Implementing Efficient, Lock-Free, and Composable Data Structures

Year: 2016
Type: conference-paper
Abstract: This paper introduces versioned programming, a technique that can be used to convert pointer-based data structures into efficient, lock-free implementations. Versioned programming allows arbitrary composition of pointer modifications. Taking linked-lists as an example, VLISTs, or versioned lists, support features missing in other lock-free implementations, such as double linking and atomic moves among lists.
Language: English
Open Access status: bronze
OpenAlex ID: W2415349938
FWCI: 1.026
Cites: 35
Cited by: 10
Related to: 10