skip to main content


Title: Limits on the Efficiency of Event-Based Algorithms for Monte Carlo Neutron Transport

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%. Lastly, when the execution times for events are allowed to vary, the vector speedup is also limited by differences in execution time for events being carried out in a single event-iteration.
 [1] ;  [1]
  1. Argonne National Lab. (ANL), Lemont, IL (United States)
Publication Date:
Grant/Contract Number:
Published Article
Journal Name:
Nuclear Engineering and Technology
Additional Journal Information:
Journal Volume: 49; Journal Issue: 6; Journal ID: ISSN 1738-5733
Korean Nuclear Society
Research Org:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org:
USDOE Office of Science (SC), Basic Energy Sciences (BES) (SC-22)
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; Monte Carlo; Neutron transport; Parallelism; Vectorization
OSTI Identifier:
Alternate Identifier(s):
OSTI ID: 1402080