Comparing the performance of concurrent linked-list implementations in Haskell

Haskell has a rich set of synchronization primitives for implemented-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 to implement the same abstraction: a concurrent linked-list. Our results are somewhat surprising: there is a full two orders of magnitude difference in performance between the slowest and the fastest implementation. Our analysis of the performance results gives new insights into the relative performance of the programming models and their implementation. Finally, we suggest the addition of a single primitive which in our experiments improves the performance of one of the STM-based implementations by more than a factor of 7.

• Type: Conference
• Year: 2009
• Where: POPL
• Authors: Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
• Keywords: Concurrent Programming Models, Implemented-state Concurrency Abstractions, POPL 2009, Programming Languages, Programming Models