Parallel Haskell implementations of the N-body problem

SUMMARYThis 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 i...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation Vol. 26; no. 4; pp. 987 - 1019
Main Authors: Totoo, Prabhat, Loidl, Hans-Wolfgang
Format: Journal Article
Language:English
Published: Blackwell Publishing Ltd 25.03.2014
Subjects:
Algorithms
Assessments
Computation
Concurrency
functional programming
high-level parallel programming models
Mathematical models
n-body problem
Parallel programming
Programming
Tuning
ISSN:1532-0626, 1532-0634
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:SUMMARYThis 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 © 2013 John Wiley & Sons, Ltd.
Bibliography:istex:9B339A911AEB71969952BD39D35E44AACD048639
ArticleID:CPE3087
ark:/67375/WNG-MVMF3GBL-H
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.3087