Parallel Fission Bank Algorithms in Monte Carlo Criticality Calculations
Authors:
Open Access
- 1 February 2012
- journal article
- research article
- Published by Taylor & Francis in Nuclear Science and Engineering
- Vol. 170 (2) , 125-135
Abstract
In this work we describe a new method for parallelizing the source iterations in a Monte Carlo criticality calculation. Instead of having one global fission bank that needs to be synchronized, as is traditionally done, our method has each processor keep track of a local fission bank while still preserving reproducibility. In doing so, it is required to send only a limited set of fission bank sites between processors, thereby drastically reducing the total amount of data sent through the network. The algorithm was implemented in a simple Monte Carlo code and shown to scale up to hundreds of processors and furthermore outperforms traditional algorithms by at least two orders of magnitude in wall-clock time.Keywords
This publication has 6 references indexed in Scilit:
- Optimizing the Synchronization Operations in Message Passing Interface One-Sided CommunicationThe International Journal of High Performance Computing Applications, 2005
- Biases in the estimation of Keff and its error by Monte Carlo methodsAnnals of Nuclear Energy, 1986
- Monte Carlo methods for radiation transport analysis on vector computersProgress in Nuclear Energy, 1984
- An analysis of variance test for normality (complete samples)Biometrika, 1965
- The Monte Carlo MethodJournal of the American Statistical Association, 1949
- The Frequency Distribution of the Quotient of Two Normal VariatesJournal of the Royal Statistical Society, 1930