Using distributed memory parallel computers and GPU clusters for multidimensional Monte Carlo integration

SummaryThe aim of this paper is to show that the multidimensional Monte Carlo integration can be efficiently implemented on various distributed memory parallel computers and clusters of multicore nodes using recently developed parallel versions of linear congruential generator and lagged Fibonacci g...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Concurrency and computation Ročník 27; číslo 4; s. 923 - 936
Hlavní autoři: Szakowski, Dominik, Stpiczyski, Przemysaw
Médium: Journal Article
Jazyk:angličtina
Vydáno: Blackwell Publishing Ltd 25.03.2015
Témata:
Clusters
Computation
Computer simulation
Distributed memory
distributed memory parallel computers
efficiency
Generators
GPU clusters
GPU clusters, efficiency
Graphics processing units
lagged Fibonacci generator
linear congruential generator
Monte Carlo methods
multidimensional integration
Parallel computers
parallelized pseudorandom number generators
scalability
Servers
ISSN:1532-0626, 1532-0634
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:SummaryThe aim of this paper is to show that the multidimensional Monte Carlo integration can be efficiently implemented on various distributed memory parallel computers and clusters of multicore nodes using recently developed parallel versions of linear congruential generator and lagged Fibonacci generator pseudorandom number generators. We show how to accelerate the overall performance by offloading some computations to Graphics Processing Units (GPUs), and we discuss how to transform Message Passing Interface (MPI) + OpenMP programs to MPI + OpenMP + CUDA model. We explain how to utilize multiple cores of CPUs together with multiple GPU accelerators within a single node and how to achieve reasonable load balancing of all computational resources of GPU‐accelerated multicore nodes. We present and discuss the results of experiments performed on the following target architectures: IBM Blue Gene/Q parallel computer, a cluster of Intel Xeon E5‐2660 servers, and a Tesla‐based GPU cluster with Intel Xeon X5650 multicore processors. The results are presented from two points of view: strong scaling and weak scaling. We also compare the performance of all considered architectures. Copyright © 2014 John Wiley & Sons, Ltd.
Bibliografie:ArticleID:CPE3365
istex:12AFBEE7F831EFD53C49AD57C760CE7307BC6557
ark:/67375/WNG-HJQB70BN-4
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.3365