Haskell on a shared-memory multiprocessor

by: Tim Harris, Simon Marlow, Simon Peyton-Jones

(2005), pp. 49-61.

View FullText article

ACM, DOI

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

hamish, jrw, tautologico, voigt, msakai, neilc, benchambers, kazuya, brecknell

Find related articles with these CiteULike tags

compilers, computation, concurrency, distributed, fp, functional, functionalprogramming, functional-programming, haskell, haskelllang, language-implementation, languages, monads, multicore, parproc, software-transactional-memory, stm, transactional, transactional-memory

Abstract

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 in 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.

@inproceedings{citeulike:342280, abstract = {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 in 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.}, address = {New York, NY, USA}, author = {Harris, Tim and Marlow, Simon and Peyton-Jones, Simon }, booktitle = {Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell}, citeulike-article-id = {342280}, doi = {http://dx.doi.org/10.1145/1088348.1088354}, isbn = {159593071X}, keywords = {compilers, functional-programming, haskell, monads}, pages = {49--61}, posted-at = {2005-10-06 08:28:15}, priority = {2}, publisher = {ACM Press}, title = {Haskell on a shared-memory multiprocessor}, url = {http://dx.doi.org/10.1145/1088348.1088354}, year = {2005} }

RIS record

TY - CONF ID - citeulike:342280 L3 - citeulike-article-id:342280 TI - Haskell on a shared-memory multiprocessor T2 - Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell SP - 49 EP - 61 AD - New York, NY, USA PB - ACM Press SN - 159593071X N2 - 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 in 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. KW - compilers KW - functional-programming KW - haskell KW - monads AU - Harris, Tim AU - Marlow, Simon AU - Peyton-Jones, Simon PY - 2005/// UR - http://dx.doi.org/10.1145/1088348.1088354 ER -

RIS BibTeX