Search NASA⌕ Search

SEARCH · Search NASA

Results for “high performance and distributed computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,027 records · Page 57

Comparison of Raman Scattering Measurements and Modeling in NIF Ignition Experiments

Recent NIF indirect-drive experiments have shown significant Raman scattering from the inner beams. NIF data has motivated improvements to rad-hydro modeling, leading to the 'high flux model' [M. D. Rosen et al., HEDP 7, 180 (2011)]. Cross-beam energy transfer [P. A. Michel et al., Phys. Plasmas 17, 056305 (2010] in the laser entrance hole is an important tool for achieving round implosions, and is uniformly distributed across the laser spot in rad-hydro simulations (but not necessarily in experiments). We find the Raman linear gain spectra computed with these plasma conditions agree well in time-dependent peak wavelength with the measured data, especially when overlapping laser-beam intensities are used. More detailed, spatially non-uniform modeling of the cross-beam transfer has been performed. The resulting gains better follow the time history of the measured backscatter. We shall present the impact of spatially non-uniform energy transfer on SRS gain. This metric is valid when amplification is in a linear regime, and so we shall also present an assessment of whether electron trapping in Langmuir waves can play a role in these shots.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sensitivity Analysis of Passive Heat Removal Capability of FHR Based on Efficient Surrogate Model and GenFlow

Code Scaling, Applicability and Uncertainty Evaluation Methodology (CSAU) is used for quantifying reactor safety margins and works as an alternative method for licensing nuclear power plant. In the framework of CSAU, sensitivity and uncertainty analysis (SA and UA) should be performed. However, for large-scale complicated thermal hydraulics analysis simulated by code (e.g. RELAP5, CFD and subchannel analysis, the sensitivity and uncertainty analysis is really time-consuming. Furthermore, sometimes it is not feasible to perform SA and UA. Specifically, the computation time for Monte Carlo sampling or advanced LHS sampling can be neglected, but the computation time for thermal hydraulics code makes up main part of time during SA and UA process. In order to accelerate the speed of SA and UA, thermal hydraulics code can be improved based on advanced mathematic algorithm or using parallel method. However, the development for new mathematic method needs long time and strict verification and validation process is needed for a new code, which usually takes a couple of years or even longer time to have an approved code that can be used in nuclear industry. An alternative way to improve the speed of SA and UA is using surrogate model. The surrogate model is derived from the input as well as output data of the original code, assuming the code as a black box. The most common method is using response surface method (RSM) as a surrogate for the code, the input parameters are then sampled from their assumed distribution and the corresponding value of the response surface function is calculated. However, a couple of input parameters need hundreds or even thousands of original code calculations. The large number of runs is an obvious disadvantage of this method. Besides, the second disadvantage is an appropriate response surface function must be selected (e.g. quadratic, cubic, quartic, with or without cross product terms, or using a non-polynomial form) to avoid the overfit and underfit problem. This process is time consuming and expensive. Polynomial chaos expansion method is a reasonably fast and attractive alternative, stochastic model. The chaos expansion provides an efficient high-order method of including non-linear effects in stochastic analysis. Usually, the information about the model parameters and their probability distribution is limited and the dependence between them is not known. However, if arbitrary polynomial chaos is used, instead of assuming probability distribution for input parameters which may introduces additional subjectivity into the analysis, the available information can directly and most purely be used in stochastic analysis based on arbitrary data distribution. Thus, it is not necessary to know the exact probability density functions to perform SA and UA based on arbitrary polynomial chaos (aPC). The aPC has been applied for uncertainty quantification in many fields (e.g. in solid mechanics, fluid flows, thermal sciences), and become widely used in nuclear industry recently. Mk1 PB-FHR is a small modular fluoride-salt-cooled, high-temperature reactors (FHRs) that is a concept design by University of California, Berkeley (UCB). It has inherently safe features like natural-circulation-driven systems (e.g. direct reactor auxiliary cooling system (DRACS)) to passively remove decay heat from the reactor core during design basis and beyond design. It is necessary to perform SA and UA, since the licensing process of this new kind of reactor is under way and there are many design parameters that have not been fixed. Current nuclear commercial codes, such as RELAP5, have mainly been developed for light water reactors, which require the use of comprehensive two-phase flow models. This capability is not required to simulate single-phase flow phenomena in FHRs, whose baseline coolant, flibe, remains liquid up to 1430 deg. C at atmospheric pressure. The FHR advanced natural circulation analysis (FANCY) code has been developed specifically for FHR technology modeling and validation work has been performed by using CIET data in UCB. The code has been renamed General Flow (GenFlow) because it has been further developed to have the capability to model complicated pipework system based on object-oriented concept for user friendly purpose. Besides, it can be used to simulate both the force circulation as well as natural circulation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Deep learning interfacial momentum closures in coarse-mesh CFD two-phase flow simulation using validation data

Multiphase flow phenomena have been widely observed in the industrial applications while it remains a challenging yet unsolved problems. Three-dimensional computational fluid dynamics (CFD) approaches resolve the flow fields on a finer special and temporal scales which can complement the dedicated experimental study. However, closures have to be introduced to reflect the underlying physics in multiphase flow. Among them, the interfacial forces, including drag, lift, turbulent dispersion and wall lubrication forces, play in important role on the bubble’s distribution and migration in liquid-vapor two-phase flow. Development of those closures traditionally rely on the experimental data and analytical derivation with simplified assumptions which usually cannot deliver a universal solution across wide range of flow conditions. In this paper, a data-driven approach, named as Feature Similarity Measurement (FSM), is developed and applied to improve the simulation capability of two-phase flow with coarse-mesh CFD approach. Interfacial momentum transfer in adiabatic bubbly flow serves as the focus of the present study. Both a mature and a simplified set of interfacial closures are taken as the low fidelity data. Experimental data and fine mesh CFD simulations results are adopted as high-fidelity data. Qualitative and quantitative analysis are performed in this paper which reveals that FSM can substantially improve the prediction of coarse mesh CFD model regardless of the choice of interfacial closures and it provides scalability and consistency across discontinuous flow regimes. Furthermore, it demonstrates that data-driven method can aid the multiphase flow modeling by exploring the connections between local physical features and simulation errors.

97 MATHEMATICS AND COMPUTING↗

MCNP6 Study of Spatial Fidelity Required for ROC Curve Convergence

The detection of special nuclear material at ports and borders is one of the primary missions of the Department of Homeland Security's (DHS) Domestic Nuclear Detection Office (DNDO). In support of this mission a large-scale modeling and simulation effort has been undertaken with the goal of providing a comprehensive tool-kit that addresses the complexity of problems involved with developing and maintaining technologies deployed to global nuclear detection architecture (GNDA) nodes. An important objective of DNDO's mission is to characterize detector system performance before deployment. In the effort to support this mission, the latest version of MCNP has been used to perform detectability studies of highly enriched uranium (HEU) to populate a database that will be used for the tool-kit. The characterization method used in the implementation of the database is the receiver operating characteristic (ROC). A ROC curve shows the limits of detectability of a given system as well as an overall metric of the efficacy of a detection system. This is accomplished by comparing total detector count distributions to the count distribution produced by background alone. For an in-depth explanation of the theory behind the MCNP production of ROC curves please refer to the paper, 'How To Use The Receiver Operating Characteristic Tally Option in MCNP6'. Building a useful database requires an expansive parameter space. The current tool-kit use nine parameters, which if varied with just 5 options each, results in nearly two million simulations to run. Depending on the set of parameters these simulations can take a few hours or a few weeks to complete. This computational cost necessitates the use of scaling algorithms to interpolate between the data contained in the database. The tool-kit employs a discrete event method to simulate the movement and detector response of special nuclear material (SNM) through a GNDA node. Given the nature of a discrete event simulation, constant motion of SNM must be split up in to discrete spatial detection points. The fidelity required of the spatial splitting to achieve a properly converged answer is investigated here for a neutron detection system. The detector used was a SNAP-3 neutron detector in front of a sphere of SNM in the presence of background radiation. A parameter study has been performed to determine the spatial fidelity required for ROC curve convergence for moving objects in a discrete event simulator. It appears that 5 points is the minimum number of detection points with 7 points needed for one of the parameter sets. The convergence worsens with increases to detection length but appears to improve with increasing detector distance. These results will help future work involving quantifying the accuracy based on given tolerances and parameters. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems

The k-dimensional Weisfeiler-Lehman (k-WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k-WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k-WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k-WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k-WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques.

algorithims↗

CyberGIS software: a synthetic review and integration roadmap

CyberGIS defined as cyberinfrastructure-based geographic information systems (GIS) has emerged as a new generation of GIS representing an important research direction for both cyberinfrastructure and geographic information science. This study introduces a 5-year effort funded by the US National Science Foundation to advance the science and applications of CyberGIS, particularly for enabling the analysis of big spatial data, computationally intensive spatial analysis and modeling (SAM), and collaborative geospatial problem-solving and decision-making, simultaneously conducted by a large number of users. Several fundamental research questions are raised and addressed while a set of CyberGIS challenges and opportunities are identified from scientific perspectives. The study reviews several key CyberGIS software tools that are used to elucidate a vision and roadmap for CyberGIS software research. The roadmap focuses on software integration and synthesis of cyberinfrastructure, GIS, and SAM by defining several key integration dimensions and strategies. CyberGIS, based on this holistic integration roadmap, exhibits the following key characteristics: high-performance and scalable, open and distributed, collaborative, service-oriented, user-centric, and community-driven. As a major result of the roadmap, two key CyberGIS modalities gateway and toolkit combined with a community-driven and participatory approach have laid a solid foundation to achieve scientific breakthroughs across many geospatial communities that would be otherwise impossible.

CyberGIS↗

Toward Managing HPC Burst Buffers Effectively: Draining Strategy to Regulate Bursty I/O Behavior

HPC (high-performance computing) applications usually show bursty I/O behaviors. In order to expedite the applications, permanent storage systems are usually provisioned to serve such I/O bursts. Approaching the era of exascale computing, non-volatile RAM is introduced as burst buffers, to absorb the bursty bulk data and relax the I/O provisioning requirement of the permanent storage systems. However, without judiciously draining the burst buffers, I/O bursts are passed down to the underlying storage systems, which causes severe I/O contention issues.In order to minimize the I/O provisioning requirement and resolve the issues caused by I/O bursts, we propose a proactive draining scheme to manage the draining process of distributed node-local burst buffers. In addition, we develop an I/O provisioning model to predict the minimized I/O provisioning requirement for permanent storage systems. Evaluation results show that applying the proactive draining scheme largely relaxes the I/O provisioning requirement while preserving the I/O performance of underlying storage systems.

97 MATHEMATICS AND COMPUTING↗

Fast HARDI Uncertainty Quantification and Visualization with Spherical Sampling

In this paper, we study uncertainty quantification and visualization of orientation distribution functions (ODF), which corresponds to the diffusion profile of high angular resolution diffusion imaging (HARDI) data. The shape inclusion probability (SIP) function is the state‐of‐the‐art method for capturing the uncertainty of ODF ensembles. The current method of computing the SIP function with a volumetric basis exhibits high computational and memory costs, which can be a bottleneck to integrating uncertainty into HARDI visualization techniques and tools. We propose a novel spherical sampling framework for faster computation of the SIP function with lower memory usage and increased accuracy. In particular, we propose direct extraction of SIP isosurfaces, which represent confidence intervals indicating spatial uncertainty of HARDI glyphs, by performing spherical sampling of ODFs. Our spherical sampling approach requires much less sampling than the state‐of‐the‐art volume sampling method, thus providing significantly enhanced performance, scalability, and the ability to perform implicit ray tracing. Our experiments demonstrate that the SIP isosurfaces extracted with our spherical sampling approach can achieve up to 8164× speedup, 37282× memory reduction, and 50.2% less SIP isosurface error compared to the classical volume sampling approach. We demonstrate the efficacy of our methods through experiments on synthetic and human‐brain HARDI datasets.

97 MATHEMATICS AND COMPUTING↗

Neutronic analysis of a fusion hybrid reactor

In a PHYSOR 2010 paper(1) we introduced a fusion hybrid reactor whose fusion component is the gasdynamic mirror (GDM), and whose blanket was made of thorium - 232. The thrust of that study was to demonstrate the performance of such a reactor by establishing the breeding of uranium - 233 in the blanket, and the burning thereof to produce power. In that analysis, we utilized the diffusion equation for one-energy neutron group, namely, those produced by the fusion reactions, to establish the power distribution and density in the system. Those results should be viewed as a first approximation since the high energy neutrons are not effective in inducing fission, but contribute primarily to the production of actinides. In the presence of a coolant, however, such as water, these neutrons tend to thermalize rather quickly, hence a better assessment of the reactor performance would require at least a two group analysis, namely the fast and thermal groups. We follow that approach and write an approximate set of equations for the fluxes of these groups. From these relations we deduce the all-important quantity, k{sub eff}, which we utilize to compute the multiplication factor, and subsequently, the power density in the reactor. We show that k{sub eff} can be made to have a value of 0.99, thus indicating that 100 thermal neutrons are generated per fusion neutron, while allowing the system to function as 'subcritical.' Moreover, we show that such a hybrid reactor can generate hundreds of megawatts of thermal power per cm of length depending on the flux of the fusion neutrons impinging on the blanket. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Field Study and Energy-Plus Benchmarks for Energy Saver Homes having Different Envelope Designs

An alliance to maximize energy efficiency and cost-effective residential construction (ZEBRAlliance) built and field tested four homes that are 50 percent more energy efficient than a code compliant home. The homes are unoccupied for the duration of a two-year field study, thereby eliminating the confounding issue of occupancy habits. All homes have about the same consistent and scheduled internal load. Each home showcases a unique envelope strategy: 1) structural insulated panel (SIP), 2) optimal value wall framing (OVF), 3) advanced framing featuring the benefits of insulations mixed with phase change materials (PCM), and 4) an exterior insulation and finish system (EIFS). All homes have different weather resistive barriers (WRBs) and/or air barriers to limit air and moisture infiltration. Three homes provide space conditioning and water heating via a ground loop heat exchanger, while the fourth home uses a high efficiency air-to-air heat pump and heat pump water heater. Field performance and results of EnergyPlus V7.0 benchmarks were made for roof and attics as compared to cathedral design and for wall heat flows to validate models. The moisture content of the wall sheathing is shown to prove the protecting effectiveness of WRBs. Temperature distributions through insulations in the wall and ceiling with and without PCMs are described to characterize the performance of the PCM building envelopes.

Attic↗

The ENDF/B Nuclear Data Library and Its Impact on Reactor Simulations

The ENDF/B library, which is developed, maintained, and distributed by the Cross Section Evaluation Working Group, is the main source of nuclear data for analyses and computational simulations in nuclear applications, like different nuclear reactors concepts, radiation shielding, medical applications, astrophysics, etc. The library is constantly being improved and updated, with each release bringing an optimal representation of nuclear interactions as they are understood in their time. The most recent release, ENDF/B-VIII.1, represents a significant improvement in terms of the performance and consistency of the measured differential data relative to previous versions, as it combines the most recent experimental differential data and advanced theoretical nuclear models. As one of the many highlights, ENDF/B-VIII.1 restores a high-burnup depletion performance, comparable to ENDF/B-VII.1, that had been degraded in ENDF/B-VIII.0, while further improving the performance in criticality benchmarks, such as those in the Mosteller’s suite. Additionally noteworthy is the improved performance of ENDF/B-VIII.1 in radiation shielding and thick-target leakage spectrum integral experiments, which are also important for fusion and reactor applications. In this work we present in a very summarized way the main updates implemented in the ENDF/B-VIII.1 release and its main impacts, and also begin to delineate the path forward as to what to expect in the future for the next ENDF/B release, which, based on the timeline of the past few releases, is estimated to happen around 5 years from now. We emphasize that the ENDF/B-VIII.1 release was the product of an enormous collaborative effort among many authors and that for a complete detailed picture, the reader is strongly encouraged to refer to the article accompanying the release, which is currently in the publication process, but available as preprint [G. P. A. Nobre et al. arXiv Preprint arXiv: 2511.03564 (2025)].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

FatMan vs. LittleBoy: Scaling Up Linear Algebraic Operations in Scale-Out Data Platforms

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are highly desirable to enable efficient processing over millions of data points. To this end, we present a matrix manipulation approach to effectively scale-up each node in a scale-out data parallel platform such as Apache Spark. Specifically, we enable hardware acceleration for matrix multiplications in a distributed Spark setup without user intervention. Our approach supports both dense and sparse distributed matrices, and provides flexible control of acceleration by matrix density. We demonstrate the benefit of our approach for generalized matrix multiplication operations over large matrices with up to four billion elements. To connect the effectiveness of our approach with machine learning applications, we performed Gramian matrix computation via generalized matrix multiplications. Our experiments show that our approach achieves more than 2× performance speed-up, and up to 96.1% computation improvement, compared to a state of the art Spark MLlib for dense matrices.

97 MATHEMATICS AND COMPUTING↗

FatMan vs. LittleBoy: Scaling up Linear Algebraic Operations in Scale-out Data Platforms

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are highly desirable to enable efficient processing over millions of data points. To this end, we present a matrix manipulation approach to effectively scale-up each node in a scale-out data parallel platform such as Apache Spark. Specifically, we enable hardware acceleration for matrix multiplications in a distributed Spark setup without user intervention. Our approach supports both dense and sparse distributed matrices, and provides flexible control of acceleration by matrix density. We demonstrate the benefit of our approach for generalized matrix multiplication operations over large matrices with up to four billion elements. To connect the effectiveness of our approach with machine learning applications, we performed Gramian matrix computation via generalized matrix multiplications. Our experiments show that our approach achieves more than 2x performance speed-up, and up to 96.1% computation improvement, compared to a state of the art Spark MLlib for dense matrices.

Lim, Seung-Hwan↗

Simulations of Fuel-Air Mixing in a 7 Element Lean Direct Injection (LDI) Aviation Combustor: Preprint

The increased accessibility of commercial aviation to the general population has in-creased the conventional jet fuel consumption, thereby causing increased CO2emissions. One of the strategies to reduce the environmental impact is to use sustainable aviation fuels (SAFs). SAFs are jet fuels obtained from renewable resources such as biomass and waste streams such as plastics/municipal solid wastes. Even though the use of SAFs has been gaining importance over the last two decades, only a few numerical studies on their usage have been reported so far. In this study, two SAFs namely, alcohol to jet (ATJ) and hydrotreated esters and fatty acids (HEFA), are chosen and their use in a simple, lead direct injection (LDI) combustor is studied. The focus of this study is limited to the thermo-chemical properties of the fuels and their impact on fuel distribution and evaporation. Hence, only non-reactive simulations are performed. A high accuracy, adaptive mesh refinement based low-Mach solver, PeleLMeX, is used for performing the simulations. The time-averaged flow results indicate faster evaporation of HEFA when compared to ATJ and Jet-A. The difference in fuel evaporation rates is attributed to the differences in fuel viscosity and surface tension properties and the concomitant variations in the fuel droplet size distributions.

adaptive mesh refinement↗

Improving Cloud-based Performance of Distribution Planning - Improvements to GridLAB-D

This report provides a high-level summary of the improvements to the GridLAB-D distribution analysis software, including work with GridUnity to focus the areas of improvement and test the final implementation. The improvements allow repetitive, time-series-based simulations, such as renewable hosting capacity studies, to show a 30% or more improvement in execution time. All improvements from this project are available on GridLAB-D’s open-source repository, with most of the changes migrated into the upcoming version 4.3 release of the software.

97 MATHEMATICS AND COMPUTING↗

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

Impact of Time Dependent Reactor and Sensor Physics on Core Power Synthesis

Online synthesis of the power distribution is critical in the operation and control of nuclear power reactors to ensure that the core is operating within safety margins, and to provide essential knowledge associated with the burnup of the fuel. In light water reactors (LWRs), power synthesis is achieved by using some a priori knowledge of the state of the reactor core and updating based on the signals coming from in-core sensors—namely, self-powered neutron detectors (SPNDs). This report aims to study the effects of fuel burnup and sensor degradation on the ability to accurately synthesize the power distribution in a LWR. Several modeling tools were used to simulate power synthesis based on the responses of SPNDs, with emitters made out of Rh or V. A representative pressurized water reactor low-enriched uranium (LEU) core was modeled using the Polaris/Purdue Advanced Reactor Core Simulator (PARCS) approach. The Monte Carlo N-Particle Transport 6 (MCNP6) code was used, as well, to calculate response functions between different segments of fuel to individual SPNDs; this is a crucial parameter for power synthesis. The Oak Ridge Isotope GENeration (ORIGEN) package in the Standardized Computer Analyses for Licensing Evaluation (SCALE) code was used to model the time-dependent isotopic transmutation in the SPND emitters. All these data were fed into a custom code that enacted the point-based iterative (PBI) method to simulate power synthesis. Developmental work was also performed on high-fidelity SPND models in the GEometry ANd Tracking 4 (Geant4) code, which enables higher-accuracy modeling of the current responses from SPNDs. In this work, five sets of time-dependent power synthesis test cases were conducted. In these test cases, systematic changes in the input conditions enabled an analysis of the effect of (1) slightly inaccurate a priori power distribution assumptions with respect to fuel burnup, (2) highly inaccurate a priori assumptions with respect to fuel burnup (such that burnup is not included in the a priori assumed distribution), and (3) differences between Rh and V SPNDs in terms of downstream consequences of the transmutation in the emitters. The authors discovered that one may permissibly have slightly inaccurate a priori assumptions of the fuel burnup (such that the level of burnup may be slightly under- or over-approximated by the accumulated burnup in approximately 9.3 full power days), but to not account for burnup at all in the a priori assumption leads to severe levels of error, approaching 25% at maximum. The authors also discovered that V SPNDs are extraordinarily robust in the low-enriched uranium fuel cycle considered in this modeling work, whereas Rh SPNDs undergo significant transmutation that can result in large errors in the synthesized power distribution.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Impact of Time-Dependent Reactor and Sensor Physics on Core Power Synthesis (Rev.1)

Online synthesis of power distribution is critical in the operation and control of nuclear power reactors to ensure that the core is operating within safety margins and to provide essential knowledge associated with the burnup of the fuel. In light-water reactors, power synthesis is achieved by using some a priori knowledge of the state of the reactor core and updating based on the signals coming from in-core sensors—namely, self-powered neutron detectors (SPNDs). This report examines the effects of fuel burnup and sensor degradation on the ability to accurately synthesize the power distribution in a pressurized water reactor (PWR), considering the typical low-enriched uranium (LEU, 3%-5% enrichment) fuel cycle as well as the higher enrichment LEU+ (5%-8% enrichment) fuel cycle. Several modeling tools were used to simulate power synthesis based on the responses of SPNDs, with emitters made out of Rh or V. A representative PWR LEU core was modeled using the Polaris/Purdue Advanced Reactor Core Simulator (PARCS) approach. The Monte Carlo N-Particle Transport 6 (MCNP6) code was used as well to calculate response functions between different segments of fuel to individual SPNDs; this is a crucial parameter for power synthesis. The Oak Ridge Isotope GENeration (ORIGEN) package in the Standardized Computer Analyses for Licensing Evaluation (SCALE) code was used to model the time-dependent isotopic transmutation in the SPND emitters. All these data were fed into a custom code that enacted the point-based iterative method to simulate power synthesis. Developmental work was also performed on high-fidelity SPND models in the GEometry ANd Tracking 4 (Geant4) code, which enables higher-accuracy modeling of the current responses from SPNDs. In this work, five sets of time-dependent power synthesis test cases were conducted. In these test cases, systematic changes in the input conditions enabled an analysis of the effect of (1) slightly inaccurate a priori power distribution assumptions with respect to fuel burnup, (2) highly inaccurate a priori power distribution assumptions with respect to fuel burnup (such that burnup is not included in the a priori assumed distribution), and (3) differences between Rh and V SPNDs in terms of downstream consequences of the transmutation in the emitters and the extended nature of the LEU+ fuel cycle in comparison with LEU. The authors discovered that one may permissibly have slightly inaccurate a priori assumptions of the fuel burnup (such that the level of burnup may be slightly underapproximated or overapproximated by the accumulated burnup in approximately 9.3 full power days), but to not account for burnup at all in the a priori assumptions leads to severe levels of error, approaching 25% at maximum (for LEU). The authors also discovered that V SPNDs are extraordinarily robust in both the LEU and LEU+ fuel cycles considered in this modeling work, whereas Rh SPNDs undergo significant transmutation that can result in large errors in the synthesized power distribution.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗