Show simple item record

dc.contributor.advisorBenoit Forget and Kord Smith.en_US
dc.contributor.authorSalcedo-Pérez, José Luis.en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Nuclear Science and Engineering.en_US
dc.date.accessioned2020-01-08T19:33:01Z
dc.date.available2020-01-08T19:33:01Z
dc.date.copyright2019en_US
dc.date.issued2019en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/123358
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 2019en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 83-85).en_US
dc.description.abstractThe tally system in Monte Carlo neutron transport codes accounts for a significant fraction of the total execution time. This project studied the tally performance of a Monte Carlo neutron transport code (i.e., OpenMC) and implemented several optimizations to address the major bottlenecks. First, a comprehensive profiling analysis was carried out on modern Intel micro-architectures (i.e., Intel Xeon Phi and Intel Xeon Platinum 8180) to understand what hardware and settings configurations were optimal. The specific modules and subroutines that were responsible for the performance drop were also highlighted. The first round of optimizations were specific to the information that the profiling analysis provided. Both the nuclide and the reaction index searches were found to be inefficient. As a result, the two searches were improved with the implementation of direct address tables, which have a single search efficiency of O(1) and a small memory footprint.en_US
dc.description.abstractMoreover, a linear array cache was also introduced to store the following cross-sections: (n, 2n), (n, 3n), (n, 4n), (n, p), (n, [alpha]), and (n, [gamma]). These cross-sections, together with (n; fission), are indispensable to solve the transition matrix of the Bateman equations during transmutation analysis. As a result, pre-computing and storing them before tally-time eliminated redundant computations in the case a high energy particle travels through multiple fuel regions without colliding. Overall, these optimizations resulted in speedups of 2.31x and 2.15x for the Xeon Platinum and Xeon Phi, respectively. Further, this project also presents an alternative method to compute reaction rate tallies. In general, tallying all of the aforementioned seven rates through a Monte Carlo simulation can be quite expensive for realistic light water reactors.en_US
dc.description.abstractAnother approach would be to collapse a very fine-group flux together with a pregenerated multigroup cross section (constructed with the same energy grid). While this approach does provide a 3x speedup in the OpenMC active cycles performance, it also introduces a considerable memory penalty. The issue is that thousands of groups are needed to accurately resolve the (n, [gamma]) rates, most notably that of 238U. This study explores a hybrid approach in which (n, [gamma]) and (n, fission) are handled with a standard reaction rate tally while the remaining reaction rates are computed through the flux tally route. This option provides more flexibility in reducing the total number of groups because the remaining reactions outside of (n, fission) and (n, [gamma]) usually have smoother shapes. Performance was tested on five benchmarks with depleted fuel and increasing geometrical complexity.en_US
dc.description.abstractResults showed that the hybrid tally method provided decent speedups ranging from 1.30x to 1.75x in the active cycles across all benchmarks. Multiple error analyses were also carried out on the proposed hybrid method; the results show that even when going as low as 300 groups, the eigenvalue is still within 100 pcm of a traditional simulation.en_US
dc.description.statementofresponsibilityby José Luis Salcedo-Pérez.en_US
dc.format.extent85 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectNuclear Science and Engineering.en_US
dc.titleOn-node performance optimization of a Monte-Carlo transport code for leadership architecturesen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Nuclear Science and Engineeringen_US
dc.identifier.oclc1134765398en_US
dc.description.collectionS.M. Massachusetts Institute of Technology, Department of Nuclear Science and Engineeringen_US
dspace.imported2020-01-08T19:33:00Zen_US
mit.thesis.degreeMasteren_US
mit.thesis.departmentNucEngen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record