Wed 7 Nov 2018 10:30 - 10:52 at Studio 2 - Parallelism and Performance Chair(s): Arjun Guha

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 to redesign 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 can be applied automatically via a compiler plugin. In addition to the simplicity of incorporating, this scheme provides low overhead and does not rely on the lock-freedom of any OS services.

Wed 7 Nov

Displayed time zone: Guadalajara, Mexico City, Monterrey change

10:30 - 12:00
Parallelism and PerformanceOOPSLA at Studio 2
Chair(s): Arjun Guha University of Massachusetts Amherst
10:30
22m
Talk
Every Data Structure Deserves Lock-Free Memory Reclamation
OOPSLA
Nachshon Cohen EPFL, Switzerland
10:52
22m
Talk
Parallelization of Dynamic Languages: Synchronizing Built-in Collections
OOPSLA
Benoit Daloze JKU Linz, Austria, Arie Tal Technion, Stefan Marr University of Kent, Hanspeter Mössenböck JKU Linz, Austria, Erez Petrank Technion
Pre-print
11:15
22m
Talk
Virtual Machine Design for Parallel Dynamic Programming Languages
OOPSLA
Remigius Meier ETH Zurich, Switzerland, Armin Rigo PyPy.org, Switzerland, Thomas Gross ETH Zurich
11:37
22m
Talk
goSLP: Globally Optimized Superword Level Parallelism Framework
OOPSLA