Improved cache performance in Monte Carlo transport calculations using energy banding

详细信息    查看全文

• 作者：A. Siegel^a ; ^{siegela@mcs.anl.gov" class="auth_mail} ; K. Smith^b ; ^{kord@mit.edu" class="auth_mail} ; K. Felker^c ; ^{kfelker@princeton.edu" class="auth_mail} ; ^{felker@mcs.anl.gov" class="auth_mail} ; P. Romano^b ; ^{romano7@mit.edu" class="auth_mail} ; B. Forget^b ; ^{bforget@mit.edu" class="auth_mail} ; P. Beckman^c ; ^{beckman@mcs.anl.gov" class="auth_mail}
• 关键词：OpenMC ; Monte Carlo ; Energy banding
• 刊名：Computer Physics Communications
• 出版年：April, 2014
• 年：2014
• 卷：185
• 期：4
• 页码：1195-1199
• 全文大小：684 K

文摘

We present an energy banding algorithm for Monte Carlo (MC) neutral particle transport simulations which depend on large cross section lookup tables. In MC codes, read-only cross section data tables are accessed frequently, exhibit poor locality, and are typically too much large to fit in fast memory. Thus, performance is often limited by long latencies to RAM, or by off-node communication latencies when the data footprint is very large and must be decomposed on a distributed memory machine. The proposed energy banding algorithm allows maximal temporal reuse of data in band sizes that can flexibly accommodate different architectural features. The energy banding algorithm is general and has a number of benefits compared to the traditional approach. In the present analysis we explore its potential to achieve improvements in time-to-solution on modern cache-based architectures.