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

Abstract

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.

Evaluation of Single-Node Performance of Parallel Algorithms for Multigroup Monte Carlo Particle Transport Methods

“…The major difference between the continuous-energy and multigroup schemes is the former needs time-consuming energy lookups. Several algorithms for accelerating energy lookups have been proposed, such as the unionized grid method (Leppänen, 2009) and hash-based approach (Brown, 2014;Walsh et al, 2015), which can provide speedups of up to 20x over conventional schemes.…”

Optimal Cost Management of Distributed Generation Units and Microgrids for Virtual Power Plant Scheduling

“…The authors of [12] have presented the model for the uncertainties of market prices, electrical demand, and intermittent renewable power generation that is used in this paper, as well. The procedure to use the MC method in the grid search optimization algorithm is explained in [33].…”

An Adaptive Strategy Selection Method With Reinforcement Learning for Robotic Soccer Games

“…The penalty parameter, C, describes the tradeoff between the ratio of the sample for error classification and the complexity of the algorithm. In terms of the choice of the penalty parameter, this paper uses a grid search method [32].The Gaussian kernel function is taken as an example and one set of parameters are chosen, such as C = {2 −10 , 2 −9 , . .…”

“…Comparisons are shown to demonstrate the efficiency of the proposed method. Firstly, the parameters, C and γ , in the SVM are selected using a grid search method [32]. Then, ''1-a-1'', ''1-a-r'' [33] and the ISVM are compared to demonstrate that the ISVM has better classification accuracy and a shorter classification time.…”