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...
Main Authors: | Paul K. Romano, Andrew R. Siegel |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2017-09-01
|
Series: | Nuclear Engineering and Technology |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1738573317302966 |
Similar Items
-
Monte carlo principles and neutron transport problems /
by: 242459 Spanier, Jerome, et al.
Published: (1969) -
Analysis of Kobayashi benchmark with indigenous Monte Carlo neutron transport code PATMOC
by: Amod Kishore Mallick, et al.
Published: (2023-12-01) -
Neutron field perturbation in large sample activation analysis using Monte Carlo code /
by: 362231 Rosnie Akang, et al.
Published: (2010) -
Neutron field perturbation in large sample activation analysis using monte carlo code [electronic resource] /
by: 362231 Rosnie Akang
Published: (2010) -
Upsampling Monte Carlo neutron transport simulation tallies using a convolutional neural network
by: Andrew Osborne, et al.
Published: (2023-07-01)