Lock free data structures using STM in haskell

Authors:
Anthony Discolo;Tim Harris;Simon Marlow;Simon Peyton Jones;Satnam Singh
Affiliations:
Microsoft, Redmond, WA;Microsoft Research, Cambridge, United Kingdom;Microsoft Research, Cambridge, United Kingdom;Microsoft Research, Cambridge, United Kingdom;Microsoft, Redmond, WA
Venue:
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Year:
2006

Citing 8
Cited 2

Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transactional memory: architectural support for lock-free data structures

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Software transactional memory

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Software transactional memory for dynamic-sized data structures

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Language support for lightweight transactions

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Programming with transactional coherence and consistency (TCC)

ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Composable memory transactions

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming

Integrating FPGAs in high-performance computing: programming models for parallel systems -- the programmer's perspective

Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
A high-level implementation of composable memory transactions in concurrent haskell

IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages

Quantified Score

Hi-index	0.01

Visualization

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.