Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Optimizations of the energy grid search algorithm in continuous-energy Monte Carlo particle transport codes

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

Thumbnail Image
Download
Name

Forget_Optimizations of the energy.pdf

Size

300.17 KB

Format

Adobe PDF

Checksum (MD5)

2f25f0af35c6ab6d7760af932a8b99b4

Download all files submitted through automated deposit
sword-2017-10-27.original.zip (293.22 KB)
Author(s)
Romano, Paul K.
•
Walsh, Jonathan Alan
•
Forget, Benoit Robert Yves
•
Smith, Kord S.
Date Issued
June 2015
Journal
Computer Physics Communications
Publisher
Elsevier
Citation
Walsh, Jonathan A. et al.“Optimizations of the Energy Grid Search Algorithm in Continuous-Energy Monte Carlo Particle Transport Codes” Computer Physics Communications 196 (November 2015): 134–142 © 2015 Elsevier
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Nuclear Science and Engineering
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/112129
DOI of Published Version
https://doi.org/10.1016/J.CPC.2015.05.025
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.