Comparing the performance of concurrent linked-list implementations in Haskell

@inproceedings{Sulzmann2009ComparingTP,
  title={Comparing the performance of concurrent linked-list implementations in Haskell},
  author={Martin Sulzmann and Edmund Soon Lee Lam and Simon Marlow},
  booktitle={DAMP},
  year={2009}
}

• Martin Sulzmann, Edmund Soon Lee Lam, Simon Marlow
• Published 2009 in DAMP
• DOI:10.1145/1481839.1481845

Haskell has a rich set of synchronization primitives for implementing shared-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very low level (mutable variables with atomic read-modify-write). In this paper we perform a systematic comparison of these different concurrent programming models by using them… CONTINUE READING

Save

Watch Paper

Cite

View on ACM