Håkan Sundell

Lock-Free Concurrent Data Structures

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

2013

Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

Lock-free Concurrent Data Structures

A lock-free algorithm for concurrent bags

A Lock-Free Algorithm for Concurrent Bags

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency

Brushing the Locks out of the Fur: A Lock-Free Work Stealing Library

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

NOBLE: non-blocking programming support via lock-free shared abstract data types

Lock-Free Deques and Doubly Linked Lists

Practical and Efficient Lock-Free Garbage Collection Based on Reference Counting

Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

Wait-Free Reference Counting and Memory Management

Efficient and Practical Non-Blocking Data Structures

Simple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks

Scalable and Lock-Free Concurrent Dictionaries

Lock-Free and Practical Doubly Linked List-Based Deques using Single-Word Compare-And-Swap

Lock-Free and Practical Deques using Single-Word Compare-And-Swap

Wait-Free Reference Counting and Memory Management

Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems

NOBLE : A Non-Blocking Inter-Process Communication Library

Applications of Non-Blocking Data Structures to Real-Time Systems

Simple and Fast Wait-Free Snapshots for Real-Time Systems

Space Efficient Wait-Free Buffer Sharing in Multiprocessor Real-Time Systems Based on Timing Information