Particle-mesh techniques on the MasPar

Abstract

The authors investigate the most efficient implementations of the charge (mass) assignment and force interpolation tasks of a particle-in-cell code on the SIMD architecture of the MasPar MP2. Three different approaches were tested. The first emphasized uniform computational (not necessarily communication) load balance and ease of programming. The second exploited the speed of the Xnet interprocessor communication network using a particle data migration strategy. The third used sorting and vector scan-add operations on the particle dataset to minimize the communication traffic required between the particle and mesh data structures. Algorithm efficiencies were measured as a function of the degree of spatial clustering of the particles, and as a function of the total number of particles. The sort/scan-add strategy gave the best performance for a broad range of degree of spatial clustering. It was only beaten by the migration strategy in the regime of weak clustering. Their results indicate how a hybrid algorithm combining the migration and sort/scan-add strategies can set an upper limit on the performance degradation associated with the spatial clustering of particles.

2 Figures and Tables

Cite this paper

@article{MacNeice1996ParticlemeshTO, title={Particle-mesh techniques on the MasPar}, author={Peter MacNeice and C. Mobarry and Kathrin Olson}, journal={Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96)}, year={1996}, pages={154-161} }