Lock -Free Data Structures using STMs in Haskell Export

@article{citeulike:683893, 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.}, author = {Discolo, Anthony and Harris, Tim and Marlow, Simon and Peyton and Singh, Satnamproxy}, booktitle = {Eighth International Symposium on Functional and Logic Programming}, citeulike-article-id = {683893}, citeulike-linkout-0 = {http://research.microsoft.com/~simonpj/papers/stm/lock-free.htm}, keywords = {haskell, transactional-memory}, month = {April}, posted-at = {2006-06-04 21:53:38}, priority = {2}, title = {Lock -Free Data Structures using STMs in Haskell}, url = {http://research.microsoft.com/~simonpj/papers/stm/lock-free.htm}, year = {2006} }

TY - JOUR ID - citeulike:683893 L3 - citeulike-article-id:683893 N2 - 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. TI - Lock -Free Data Structures using STMs in Haskell T2 - Eighth International Symposium on Functional and Logic Programming KW - haskell KW - transactional-memory AU - Discolo, Anthony AU - Harris, Tim AU - Marlow, Simon AU - Peyton AU - Singh, Satnamproxy PY - 2006/04// UR - http://research.microsoft.com/~simonpj/papers/stm/lock-free.htm ER -