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.
Authors: Yang Zhan, Donald E. Porter
Institution: Stony Brook University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: TWC: Medium: Collaborative: Trustworthy Programs Without A Trustworthy Operating System, CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System, II-New: Secure and Efficient Cloud Infrastructure and Accessibility Services, CSR: Medium: CloudTracker: Transparent, Secure Provenance Tracking and Security Policy Enforcement in Clouds, NSFSaTC-BSF: TWC: Small: Practical Plausibly Deniable Encryption through Low-Level Storage Device Behavior, CAREER: Beyond Virtual Hardware: VMM/OS Co-Design for Lightweight, Flexible Virtualization
OpenAlex ID: W2415349938
