【24h】

Power Profiling of a Reduced Data Movement Algorithm for Neutron Cross Section Data in Monte Carlo Simulations

机译:蒙特卡洛模拟中子截面数据的简化数据移动算法的功率分析

获取原文
获取原文并翻译 | 示例

摘要

Current Monte Carlo neutron transport applications use continuous energy cross section data to provide the statistical foundation for particle trajectories. This "classical" algorithm requires storage and random access of very large data structures. Recently, Forget et al.[1] reported on a fundamentally new approach, based on multipole expansions, that distills cross section data down to a more abstract mathematical format. Their formulation greatly reduces memory storage and improves data locality at the cost of also increasing floating point computation. In the present study we determine the hardware performance parameters, including power usage, of the multipole algorithm relative to the classical continuous energy algorithm. This study is done to guage the suitability of both algorithms for use on next-generation high performance computing platforms.
机译:当前的蒙特卡洛中子输运应用程序使用连续的能量横截面数据为粒子轨迹提供统计基础。这种“经典”算法需要非常大的数据结构的存储和随机访问。最近,Forget等人[1]报道了一种基于多极扩展的根本新方法,该方法将横截面数据提炼为更抽象的数学格式。它们的表示形式大大减少了内存存储,并以增加浮点计算为代价改善了数据局部性。在本研究中,我们确定了相对于经典连续能量算法的多极算法的硬件性能参数,包括功耗。进行这项研究是为了确定这两种算法在下一代高性能计算平台上的适用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号