Parallel Haskell implementations of the N-body problem

Prabhat Totoo*, Hans-Wolfgang Loidl

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


This paper provides an assessment of high-level parallel programming models for multi-core programming by implementing two versions of the n-body problem. We compare three different parallel programming models on the basis of parallel Haskell, differing in the ways how potential parallelism is identified and managed. We assess the performance of each implementation, discuss the sequential and parallel tuning steps leading to the final versions and draw general conclusions on the suitability of high-level parallel programming models for multi-core programming. We achieve speed-ups of up to 7.2 for the all-pairs algorithm and up to 6.5 for the Barnes-Hut algorithm on an 8-core machine. Copyright (c) 2013 John Wiley & Sons, Ltd.

Original languageEnglish
Pages (from-to)987-1019
Number of pages33
JournalConcurrency and Computation: Practice and Experience
Issue number4
Early online date11 Jul 2013
Publication statusPublished - 25 Mar 2014


  • high-level parallel programming models
  • functional programming
  • n-body problem


Dive into the research topics of 'Parallel Haskell implementations of the N-body problem'. Together they form a unique fingerprint.

Cite this