Parallelization of gridless finite-size-particle plasma simulation codes
The main features of gridless finite-size-particle (FSP) codes are discussed, from the point of view of the performances that can be obtained, with respect both to the spatial-resolution level and the efficiency of parallel particle simulations. It is shown that such codes are particularly suited for particle-decomposition parallelization on distributed-memory architectures, as they present a strong reduction, in comparison with particle-in-cell (PIC) codes, of the memory and computational offsets related to storing and updating the replicated fluctuating-field arrays.
KeywordsDomain Decomposition Spatial Grid Empty Symbol Plasma Simulation Memory Request
Unable to display preview. Download preview PDF.
- 1.C. K. Birdsall and A. B. Langdon, Plasma Physics via Computer Simulation (McGraw-Hill, New York, 1985).Google Scholar
- 2.A. Sestero, “Basic Interactions in Real Plasmas and in the Plasmas of Numerical Experiments”, Il Nuovo Cimento 9B (1972) 222–232.Google Scholar
- 7.L. Chen and F. Zonca, “Theory of Shear Alfvén Waves in Toroidal Plasmas”, Physica Scripta T60 (1995) 81–90.Google Scholar
- 9.H. Richardson, “High Performance Fortran: history, overview and current developments”, Tech. Rep. TMC-261, Thinking Machines Corporation, 1996.Google Scholar
- 10.M. Gupta, S. Midkiff, E. Schonberg, V. Seshadri, D. Shields, K. Y. Wang, W. M. Ching, T. Ngo, “A HPF Compiler for the IBM SP2”, in: Proc. SuperComputing '95 (ACM, 1995).Google Scholar