Nuclear Techniques ›› 2016, Vol. 39 ›› Issue (10): 100502-100502.doi: 10.11889/j.0253-3219.2016.hjs.39.100502


Tally assist tree-based method for scoring massive tallies in Monte Carlo particle transport calculation

ZHANG Shu1,2, HAO Lijuan2, SONG Jing2, WU Bin2, SUN Guangyao2   

  1. 1 School of Nuclear Science and Technology, University of Science and Technology of China, Hefei 230027, China;
    2 Key Laboratory of Neutronics and Radiation Safety, Institute of Nuclear Energy Safety Technology, Chinese Academy of Sciences, Hefei 230031, China
  • Received:2016-05-26 Revised:2016-07-07 Online:2016-10-10 Published:2016-10-13
  • Supported by:

    Supported by Strategic Priority Research Program of Chinese Academy of Sciences (No.XDA03040000), National Natural Science Foundation of China (No.11305203), National Special Program for ITER (No.2014GB1120000)


Background: Traditional Monte Carlo particle transport calculation codes traverse all the tally cards to find which tallies should be scored at the end of each simulation step. The run time of this procedure almost grows linearly with the number of total tally number. When the tally number is large, the tally procedure costs far more time than the transport calculation. Purpose: This paper proposed a tree-based method for scoring massive tallies. Methods: The method builds a tally assist tree that all the nodes map one-for-one to the geometry cells. All the tally information read from the input file is stored in the tree. At the end of each simulation step, by mapping the geometry information of the cell where the particle is currently in to a node in the tree, the tallies need to be scored is directly retrieved from the node. Results: To test the proposed method, the run time of the Hoogenboom benchmark reactor model with different tally numbers is measured. Conclusion: The results show that this method can improve the computation efficiency of massive tally problems.

Key words: Monte Carlo, Particle transport, Tally assist tree, Massive tallies

CLC Number: 

  • TL329.2