Lock -Free Data Structures using STMs in Haskell

Anthony Discolo, Tim Harris, Simon Marlow, Simon Peyton Jones, and Satnam Singh.
Eighth International Symposium on Functional and Logic Programming, April 2006 (FLOPS'06).

Abstract

This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of Software Transactional Memory (STM). Preliminary experimental results are presented which show that for multi-processor systems the simpler lock free implementations offer competitive or superior performance when compared to their corresponding the lock based implementations.