Distributed Memory Algorithms for Weight Cancellation in Monte Carlo Particle Transport Simulations

¹ Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th St., Troy, NY, USA
² Department of Mechanical, Aerospace, and Nuclear Engineering, Rensselaer Polytechnic Institute, 110 8th St., Troy, NY, USA

^* e-mail: belanh2@rpi.edu

Published online: 15 October 2024

Abstract

Recent literature has demonstrated use cases for Monte Carlo transport simulations where particles can have statistical weights that are positive or negative. There are even examples which require particles to have complex statistical weights, and the real and imaginary components can be positive or negative. In such cases, weight cancellation algorithms can be very efficient at reducing the variance, or might even be required for a simulation to converge. Previous works that have employed weight cancellation in distributed memory simulations required that all fission particles be sent to a single node for the cancellation operation. This work examines possible implementations of distributed memory weight cancellation algorithms that do not require the transfer of the fission source to a single node.