Data decomposition of Monte Carlo particle transport simulations via tally servers

JOURNAL OF COMPUTATIONAL PHYSICS

卷:252

Article

Romano, Paul K.¹  Siegel, Andrew R.²  Forget, Benoit¹  Smith, Kord¹ 

[1] MIT, Dept Nucl Sci & Engn, Cambridge, MA 02139 USA

[2] Argonne Natl Lab, Argonne, IL 60439 USA

关键词: Monte Carlo;    Neutron transport;    Data decomposition;    Exascale;    Tally server;   

DOI  :  10.1016/j.jcp.2013.06.011

来源: Elsevier

【 摘 要 】

An algorithm for decomposing large tally data in Monte Carlo particle transport simulations is developed, analyzed, and implemented in a continuous-energy Monte Carlo code, OpenMC. The algorithm is based on a non-overlapping decomposition of compute nodes into tracking processors and tally servers. The former are used to simulate the movement of particles through the domain while the latter continuously receive and update tally data. A performance model for this approach is developed, suggesting that, for a range of parameters relevant to LWR analysis, the tally server algorithm should perform with minimal overhead on contemporary supercomputers. An implementation of the algorithm in OpenMC is then tested on the Intrepid and Titan supercomputers, supporting the key predictions of the model over a wide range of parameters. We thus conclude that the tally server algorithm is a successful approach to circumventing classical on-node memory constraints en route to unprecedentedly detailed Monte Carlo reactor simulations. (C) 2013 Elsevier Inc. All rights reserved.

【 授权许可】

Free