Optimizations of the energy grid search algorithm in continuous-energy Monte Carlo particle transport codes

• Published in: Computer physics communications Vol. 196; no. C; pp. 134 - 142
• Main Authors: Walsh, Jonathan A., Romano, Paul K., Forget, Benoit, Smith, Kord S.
• Format: Journal Article
• Language: English
• Published: Netherlands Elsevier B.V 01.11.2015; Elsevier
• Subjects: Computer simulation; Mathematical analysis; Monte Carlo; Monte Carlo methods; Multithreading; Optimization; Particle transport; Reduction; Search algorithm; Search algorithms; Transport; Vectors (mathematics); Particle transport; Multithreading; Monte Carlo; Optimization; Search algorithm
• ISSN: 0010-4655; 1879-2944
• DOI: 10.1016/j.cpc.2015.05.025

In this work we propose, implement, and test various optimizations of the typical energy grid-cross section pair lookup algorithm in Monte Carlo particle transport codes. The key feature common to all of the optimizations is a reduction in the length of the vector of energies that must be searched when locating the index of a particle’s current energy. Other factors held constant, a reduction in energy vector length yields a reduction in CPU time. The computational methods we present here are physics-informed. That is, they are designed to utilize the physical information embedded in a simulation in order to reduce the length of the vector to be searched. More specifically, the optimizations take advantage of information about scattering kinematics, neutron cross section structure and data representation, and also the expected characteristics of a system’s spatial flux distribution and energy spectrum. The methods that we present are implemented in the OpenMC Monte Carlo neutron transport code as part of this work. The gains in computational efficiency, as measured by overall code speedup, associated with each of the optimizations are demonstrated in both serial and multithreaded simulations of realistic systems. Depending on the system, simulation parameters, and optimization method employed, overall code speedup factors of 1.2–1.5, relative to the typical single-nuclide binary search algorithm, are routinely observed.