Haskell on a shared-memory multiprocessor

Tim Harris, Simon Marlow, Simon Peyton Jones
2005 Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05  
Multi-core processors are coming, and we need ways to program them. The combination of purely-functional programming and explicit, monadic threads, communicating using transactional memory, looks like a particularly promising way to do so. This paper describes a full-scale implementation of shared-memory parallel Haskell, based on the Glasgow Haskell Compiler. Our main technical contribution is a lock-free mechanism for evaluating shared thunks that eliminates the major performance bottleneck
more » ... parallel evaluation of a lazy language. Our results are preliminary but promising: we can demonstrate wall-clock speedups of a serious application (GHC itself), even with only two processors, compared to the same application compiled for a uni-processor.
doi:10.1145/1088348.1088354 dblp:conf/haskell/HarrisMJ05 fatcat:byqyevi3bbhndaw7sdzinhyiba