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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation Jg. 26; H. 4; S. 987 - 1019
Hauptverfasser: Totoo, Prabhat, Loidl, Hans-Wolfgang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Blackwell Publishing Ltd 25.03.2014
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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