Show simple item record

A Hybrid Parallel Algorithm for the 3-D Method of Characteristics Solution of the Boltzmann Transport Equation on High Performance Compute Clusters.

dc.contributor.authorKochunas, Brendan Matthewen_US
dc.date.accessioned2013-09-24T16:03:54Z
dc.date.availableNO_RESTRICTIONen_US
dc.date.available2013-09-24T16:03:54Z
dc.date.issued2013en_US
dc.date.submitted2013en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/100072
dc.description.abstractThe focus of this thesis is on the development of a highly scalable parallel algorithm for solving the 3-D method of characteristics (MOC) form of the Boltzmann neutron transport equation. The derivation of the 3-D MOC method is presented first, along with the details of the discretization techniques, that utilize the concept of modular ray tracing. The implementation of these equations is then described, and then the approach to parallelizing the algorithm is discussed. Results are shown for a range of benchmark problems typically solved by 3-D neutron transport codes. The algorithm is parallelized in space, angle, and by characteristic rays, which is specific to the MOC solution method. Once the parallel algorithm is established, a performance model for the particular implementation is derived. This model contains detailed expressions for the number of floating point operations and execution time as a function of the problem size and fundamental computer hardware properties, such as the time per flop and cache access latency. The procedure for determining the hardware coefficients required by the performance model is then presented and validated using experimental results. The performance model is shown to agree well with experiment for both types of execution, and the model is therefore used for subsequent analyses that explore the algorithm's sensitivities to the computer and network hardware characteristics. The model is also analyzed to assess the scaling of the algorithm for a quarter core PWR. The optimization of the convergence of the parallel 3-D MOC algorithm through the use of the coarse mesh finite difference (CMFD) method is then developed. The CMFD accelerated parallel 3-D MOC algorithm is then used to compute solutions to several numerical benchmarks, that show good agreement with the reference results. Finally, the research performed in this thesis and its conclusions are summarized, and areas of future research are suggested.en_US
dc.language.isoen_USen_US
dc.subject3-D Neutron Transporten_US
dc.subjectMethod of Characteristicsen_US
dc.subjectMassively Parallelen_US
dc.subjectWhole Core Analysisen_US
dc.subjectReactor Physicsen_US
dc.titleA Hybrid Parallel Algorithm for the 3-D Method of Characteristics Solution of the Boltzmann Transport Equation on High Performance Compute Clusters.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineNuclear Engineering & Radiological Sciencesen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.contributor.committeememberDownar, Thomas J.en_US
dc.contributor.committeememberStout, Quentin F.en_US
dc.contributor.committeememberLarsen, Edward W.en_US
dc.contributor.committeememberMartin, William R.en_US
dc.contributor.committeememberPalmtag, Scotten_US
dc.subject.hlbsecondlevelNuclear Engineering and Radiological Sciencesen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/100072/1/bkochuna_1.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.