Limits on the efficiency of event-based algorithms for Monte Carlo neutron transport

• Published in: Nuclear engineering and technology Vol. 49; no. 6; pp. 1165 - 1171
• Main Authors: Romano, Paul K., Siegel, Andrew R.
• Format: Journal Article
• Language: English
• Published: Korea, Republic of Elsevier B.V 01.09.2017; Elsevier; 한국원자력학회
• Subjects: MATHEMATICS AND COMPUTING; Monte Carlo; Neutron transport; Parallelism; Vectorization; 원자력공학; Parallelism; Monte Carlo; Neutron transport; Vectorization
• ISSN: 1738-5733; 2234-358X
• DOI: 10.1016/j.net.2017.06.006

The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, the vector speedup is also limited by differences in the execution time for events being carried out in a single event-iteration.