Transactional Memory aims to provide a programming model that makes parallel
programming easier. Hardware implementations of transactional memory (HTM) suffer from …

In this paper, we present a Haskell Transactional Memory benchmark to provide a
comprehensive application suite for the use of Software Transactional Memory (STM) …

Safe memory reclamation (SMR) algorithms are crucial for preventing use-after-free errors in
optimistic data structures. SMR algorithms typically delay reclamation for safety and reclaim …

Haskell has a rich set of synchronization primitives for implementing shared-state
concurrency abstractions, ranging from the very high level (Software Transactional Memory) …

Transactional Memory (TM) is a key future technology for emerging many-cores. On the
other hand, OpenMP provides a vast established base for writing parallel programs …

Transactional boosting is a methodology used to transform highly concurrent linearizable
objects into highly concurrent transactional objects. In this paper we describe a STM Haskell …

Many researchers have developed applications using transactional memory (TM) with the
purpose of benchmarking different implementations, and studying whether or not TM is easy …

This paper describes an implementation of STM Haskell [11] in Haskell using the
Transactional Locking 2 (TL2) algorithm by Dice, Shalev, and Shavit. TL2 provides an …

This paper presents seven concurrent hash table implementations in Haskell, ranging from
low-level synchronization mechanisms to high-level ones such as transactional memories …

In many recent works in Transactional Memory (TM), researchers have profiled TM
applications based on execution data using lumped pertransaction averages. This approach …