Memory Bottlenecks and Memory Contention in Multi-Core Monte Carlo Transport Codes-Reference-Cited by-同舟云学术

Memory Bottlenecks and Memory Contention in Multi-Core Monte Carlo Transport Codes

Published:2014 Issue: Volume: Page:
ISSN:
Container-title:SNA + MC 2013 - Joint International Conference on Supercomputing in Nuclear Applications + Monte Carlo
language:
Short-container-title:

Author:

Tramm John R.,Siegel Andrew R.

Abstract

We have extracted a kernel that executes only the most computationally expensive steps of the Monte Carlo particle transport algorithm - the calculation of macroscopic cross sections - in an effort to expose bottlenecks within multi-core, shared memory architectures.

Publisher

EDP Sciences

Link

http://sna-and-mc-2013-proceedings.edpsciences.org/10.1051/snamc/201404208/pdf

Reference17 articles.

1. The OpenMC Monte Carlo particle transport code

2. Towards Scalable Parallelism in Monte Carlo Particle Transport Codes Using Remote Memory Access

3. Siegel A. R., Smith K., Romano P. K., Forget B., and Felker K. G., “Multi-core performance studies of a Monte Carlo neutron transport code,” International Journal of High Performance Computing Applications (2013).

4. Data decomposition of Monte Carlo particle transport simulations via tally servers

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hardware Specialization: Estimating Monte Carlo Cross-Section Lookup Kernel Performance and Area;Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis;2023-11-12

2. Portable Monte Carlo Transport Performance Evaluation in the PATMOS Prototype;Parallel Processing and Applied Mathematics;2020

3. Performance Analysis of a Reduced Data Movement Algorithm for Neutron Cross Section Data in Monte Carlo Simulations;Lecture Notes in Computer Science;2015