Parallel Haskell implementations of theN-body problem

摘要

This paper provides an assessment of high-level parallel programming models for multi-core programmingrnby implementing two versions of then-body problem. We compare three different parallel programmingrnmodels on the basis of parallel Haskell, differing in the ways how potential parallelism is identified andrnmanaged. We assess the performance of each implementation, discuss the sequential and parallel tuningrnsteps leading to the final versions and draw general conclusions on the suitability of high-level parallelrnprogramming models for multi-core programming. We achieve speed-ups of up to 7.2 for the all-pairsrnalgorithm and up to 6.5 for the Barnes–Hut algorithm on an 8-core machine. Copyright © 2013 John Wileyrn& Sons, Ltd.