Particle-in-Cell algorithms for emerging computer architectures

We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no d...

Full description

Saved in:
Bibliographic Details
Published inComputer physics communications Vol. 185; no. 3; pp. 708 - 719
Main Authors Decyk, Viktor K., Singh, Tajendra V.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.03.2014
Subjects
Algorithms
Architecture (computers)
Collisions
Coprocessors
CUDA
FORTRAN
GPU
Microprocessors
Parallel algorithms
Particle in cell technique
Particle-in-Cell
Plasma simulation
Tiles
CUDA
Plasma simulation
Particle-in-Cell
Parallel algorithms
GPU
Online AccessGet full text
ISSN0010-4655
1879-2944
1879-2944
DOI10.1016/j.cpc.2013.10.013

Cover

More Information
Summary:We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no data collisions, using CUDA C and Fortran. Speedups up to about 50 compared to a single core of the Intel i7 processor have been achieved. There was also an implementation for traditional multi-core processors using OpenMP which achieved high parallel efficiency. We believe that this approach should work for other emerging designs such as Intel Phi coprocessor from the Intel MIC architecture.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0010-4655
1879-2944
1879-2944
DOI:10.1016/j.cpc.2013.10.013