Implementation and characterization of three-dimensional particle-in-cell codes on multiple-instruction-multiple-data massively parallel supercomputers

Abstract

A three‐dimensional electrostatic particle‐in‐cell (PIC) plasma simulation code has been developed on coarse‐grained distributed‐memory massively parallel computers with message passing communications. Our implementation is the generalization to three‐dimensions of the general concurrent particle‐in‐cell (GCPIC) algorithm. In the GCPIC algorithm, the particle computation is divided among the processors using a domain decomposition of the simulation domain. In a three‐dimensional simulation, the domain can be partitioned into one‐, two‐, or three‐dimensional subdomains (‘‘slabs,’’ ‘‘rods,’’ or ‘‘cubes’’) and we investigate the efficiency of the parallel implementation of the push for all three choices. The present implementation runs on the Intel Touchstone Delta machine at Caltech; a multiple‐instruction‐multiple‐data (MIMD) parallel computer with 512 nodes. We find that the parallel efficiency of the push is very high, with the ratio of communication to computation time in the range 0.3%–10.0%. The highest efficiency (≳99%) occurs for a large, scaled problem with 643 particles per processing node (∼134 million particles on 512 nodes) which has a push time of about 250 ns per particle per time step. We have also developed expressions for the timing of the code which are a function of both code parameters (number of grid points, particles, etc.) and machine‐dependent parameters (effective FLOP rate, and the effective interprocessor bandwidths for the communication of particles and grid points). These expressions can be used to estimate the performance of scaled problems—including those with inhomogeneous plasmas—to other parallel machines once the machine‐dependent parameters are known. © 1995 American Institute of Physics.