Abstract
The classical Monte Carlo (MC) neutron transport employs energy lookup on long tables to compute the cross sections needed for the simulation. This process has been identified as an important performance hotspot of MC simulations, because poor cache utilization caused by random access patterns and large memory footprint makes it unfriendly to modern architectures. A former study [1] shows that such method presents little vectorization potential in a real-case simulation due to the memory-bound nature. In this paper, we revisit a cross section reconstruction method introduced by Hwang [2] to evaluate another solution. The reconstruction converts the problem from memory-bound to compute-bound. Only several variables for each resonance are required instead of the conventional pointwise table covering the entire resolved resonance region. Though the memory space is largely reduced, this method is really time-consuming. After a series of optimizations, results show that the reconstruction kernel benefits well from vectorization and can achieve 1806 GFLOPS (single precision) on a Knights Landing 7250, which represents 67% of its effective peak performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wang, Y., Brun, E., Malvagi, F., Calvin, C.: Competing energy lookup algorithms in Monte Carlo neutron transport calculations and their optimization on CPU and Intel MIC architectures. J. Comput. Sci. (2017, in press)
Hwang, R.N.: A rigorous pole representation of multilevel cross sections and its practical application. Nucl. Sci. Eng. 96, 192–209 (1987)
Brun, E., Damian, F., Diop, C.M., Dumonteil, E., Hugot, F.X., Jouanne, C., Trama, J.C.: Tripoli-4®, CEA, EDF and AREVA reference Monte Carlo code. Ann. Nucl. Energy 82, 151–160 (2015)
Brun, E., Chauveau, S., Malvagi, F.: PATMOS: a prototype Monte Carlo transport code to test high performance architectures. In: International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering, Jeju, Korea (2017)
Kahler, A.C., MacFarlane, R.E., Muir, D.W., Boicourt, R.M.: The NJOY nuclear data processing system, version 2012. Los Alamos National Laboratory (2012)
Trkov, A., Herman, M., Brown, D.A.: ENDF-6 formats manual. Brookhaven National Laboratory, Upton (2011)
Jammes, C., Hwang, R.N.: Conversion of single-and multilevel Breit-Wigner resonance parameters to pole representation parameters. Nucl. Sci. Eng. 134(1), 37–49 (2000)
Colfax HOW series training on performance optimization. https://colfaxresearch.com/category/training/how/
Jeffers, J., Reinders, J., Sodani, A.: Intel Xeon Phi Processor High Performance Programming: Knights Landing Edition. Morgan Kaufmann, Los Altos (2016)
Poppe, G.P.M., Wijers, C.M.J.: Algorithm 680: evaluation of the complex error function. ACM Trans. Math. Softw. (TOMS) 16(1), 47 (1990)
Johnson, G.S.: Faddeeva package - free/open-source C++ implementation (2012). http://ab-initio.mit.edu/wiki/index.php/Faddeeva_Package
Reinders, J.: AVX-512 instructions. Intel Corporation (2013)
Ilic, A., Pratas, F., Sousa, L.: Cache-aware roofline model: upgrading the loft. IEEE Comput. Archit. Lett. 13(1), 21–24 (2014)
Josey, C., Ducru, P., Forget, B., Smith, K.: Windowed multipole for cross section Doppler broadening. J. Comput. Phys. 307, 715–727 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Wang, Y., Hugot, FX., Brun, E., Malvagi, F., Calvin, C. (2018). Efficient Cross Section Reconstruction on Modern Multi and Many Core Architectures. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2017. Lecture Notes in Computer Science(), vol 10777. Springer, Cham. https://doi.org/10.1007/978-3-319-78024-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-78024-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78023-8
Online ISBN: 978-3-319-78024-5
eBook Packages: Computer ScienceComputer Science (R0)