z-logo
Premium
Parallel Haskell implementations of the N ‐body problem
Author(s) -
Totoo Prabhat,
Loidl HansWolfgang
Publication year - 2013
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3087
Subject(s) - haskell , computer science , parallel computing , parallel programming model , implementation , programming paradigm , parallelism (grammar) , programming language , functional programming
SUMMARY 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 © 2013 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here