Lock Free Data Structures Using STM in Haskell

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. Experimental results are presented which show that for multi-processor systems the simpler lock free implementations offer superior performance when compared to their corresponding lock based implementations.

• Type: Conference
• Year: 2006
• Where: FLOPS
• Authors: Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh
• Keywords: Automated Reasoning, FLOPS 2006, Lock Free, Lock Free Code, Lock Free Implementations