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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Discolo, A., Harris, T., Marlow, S., Jones, S. P., & Singh, S. (2006). Lock free data structures using STM in haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3945 LNCS, pp. 65–80). https://doi.org/10.1007/11737414_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
