Parallel SPN on multi-core CPUs and many-core GPUs

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents two parallel Simplified PPN (SPN) solver implementations for both multi-core Central Processing Units (CPU) and Graphics Processing Units (GPU). For a nuclear operator such as Électricité de France (EDF), the time required to carry out nuclear reactor core simulations is rather critical when dealing with production constraints. The SPN method provides a convenient tradeoff between accuracy and numerical complexity and is used in several industrial simulations. The parallelization of the SPN algorithm reduces its computation time. To solve the problem on distributed memory machines such as PC clusters, Domain Decomposition Methods have been investigated. Complementary to this approach, this work aims to use emerging massively parallel processors such as the GPUs as well as current multi-core CPUs. Based on a fine grained parallelism, this solution achieves good performances on desktop machines. Our multi-core CPU and many-core GPU implementations allow us to solve 3D SPN problems, respectively, 10 and 36 times faster than our sequential CPU. © Taylor & Francis Group, LLC.

Cite

CITATION STYLE

APA

Kirschenmann, W., Plagne, L., Ponçot, A., & Vialle, S. (2010). Parallel SPN on multi-core CPUs and many-core GPUs. Transport Theory and Statistical Physics, 39(2–4), 255–281. https://doi.org/10.1080/00411450.2010.533741

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free