Lock Free Data Structures Using STM in Haskell

13 years 10 months ago

Download research.microsoft.com

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.

Anthony Discolo, Tim Harris, Simon Marlow, Simon L

Real-time Traffic

Automated Reasoning | FLOPS 2006 | Lock Free | Lock Free Code | Lock Free Implementations |

claim paper

» HighPerformance SpaceEfficient Automated Object Locking

» ASF AMD64 Extension for LockFree Data Structures and Transactional Memory

» Stretching transactional memory

» Transactional Memory Architectural Support for LockFree Data Structures

» McRTSTM a high performance software transactional memory system for a multicore runtime

» LockFree Parallel Algorithms An Experimental Study

» A Scalable LockFree Universal Construction with Best Effort Transactional Hardware

» Verifying Michael and Scotts LockFree Queue Algorithm using Trace Reduction

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FLOPS
Authors	Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh

Comments (0)

Sciweavers

Lock Free Data Structures Using STM in Haskell

Automated Reasoning | FLOPS 2006 | Lock Free | Lock Free Code | Lock Free Implementations |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers