Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,369 records · Page 76

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↗

Secure Large-Scale Airport Simulations Using Distributed Computational Resources

To fully conduct research that will support the far-term concepts, technologies and methods required to improve the safety of Air Transportation a simulation environment of the requisite degree of fidelity must first be in place. The Virtual National Airspace Simulation (VNAS) will provide the underlying infrastructure necessary for such a simulation system. Aerospace-specific knowledge management services such as intelligent data-integration middleware will support the management of information associated with this complex and critically important operational environment. This simulation environment, in conjunction with a distributed network of supercomputers, and high-speed network connections to aircraft, and to Federal Aviation Administration (FAA), airline and other data-sources will provide the capability to continuously monitor and measure operational performance against expected performance. The VNAS will also provide the tools to use this performance baseline to obtain a perspective of what is happening today and of the potential impact of proposed changes before they are introduced into the system.

McDermott, William J.↗

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↗

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↗

Parallel algorithms for interactive manipulation of digital terrain models

Interactive three-dimensional graphics applications, such as terrain data representation and manipulation, require extensive arithmetic processing. Massively parallel machines are attractive for this application since they offer high computational rates, and grid connected architectures provide a natural mapping for grid based terrain models. Presented here are algorithms for data movement on the massive parallel processor (MPP) in support of pan and zoom functions over large data grids. It is an extension of earlier work that demonstrated real-time performance of graphics functions on grids that were equal in size to the physical dimensions of the MPP. When the dimensions of a data grid exceed the processing array size, data is packed in the array memory. Windows of the total data grid are interactively selected for processing. Movement of packed data is needed to distribute items across the array for efficient parallel processing. Execution time for data movement was found to exceed that for arithmetic aspects of graphics functions. Performance figures are given for routines written in MPP Pascal.

Davis, E. W.↗

Automatic Data Traffic Control on DSM Architecture

We study data traffic on distributed shared memory machines and conclude that data placement and grouping improve performance of scientific codes. We present several methods which user can employ to improve data traffic in his code. We report on implementation of a tool which detects the code fragments causing data congestions and advises user on improvements of data routing in these fragments. The capabilities of the tool include deduction of data alignment and affinity from the source code; detection of the code constructs having abnormally high cache or TLB misses; generation of data placement constructs. We demonstrate the capabilities of the tool on experiments with NAS parallel benchmarks and with a simple computational fluid dynamics application ARC3D.

Frumkin, Michael↗

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↗

Measuring and Modeling Shared Visual Attention

Multi-person teams are sometimes responsible for critical tasks, such as flying an airliner. Here we present a method using gaze tracking data to assess shared visual attention, a term we use to describe the situation where team members are attending to a common set of elements in the environment. Gaze data are quantized with respect to a set of N areas of interest (AOIs); these are then used to construct a time series of N dimensional vectors, with each vector component representing one of the AOIs, all set to 0 except for the component corresponding to the currently fixated AOI, which is set to 1. The resulting sequence of vectors can be averaged in time, with the result that each vector component represents the proportion of time that the corresponding AOI was fixated within the given time interval. We present two methods for comparing sequences of this sort, one based on computing the time-varying correlation of the averaged vectors, and another based on a chi-square test testing the hypothesis that the observed gaze proportions are drawn from identical probability distributions.We have evaluated the method using synthetic data sets, in which the behavior was modeled as a series of activities, each of which was modeled as a first-order Markov process. By tabulating distributions for pairs of identical and disparate activities, we are able to perform a receiver operating characteristic (ROC) analysis, allowing us to choose appropriate criteria and estimate error rates.We have applied the methods to data from airline crews, collected in a high-fidelity flight simulator (Haslbeck, Gontar Schubert, 2014). We conclude by considering the problem of automatic (blind) discovery of activities, using methods developed for text analysis.

attention↗

Large-Eddy Simulation of Axisymmetric Compression Corner Flow

The Wall-Modeled Large Eddy Simulation (WMLES) approach is used to study the interaction of a shock wave with a high Reynolds number turbulent boundary layer. Since the near wall region is modeled, high Reynolds number turbulent flows can be simulated at a moderate computational cost. The case considered is that of an axisymmetric Mach 2.85 turbulent boundary layer over a 30 compression corner. The Reynolds number of the boundary layer upstream of the interaction based on momentum thickness (Re theta = u sub infinity theta/v sub infinity) is ~12,000. The geometry and flow conditions match the experiments of Dunagan et al. (NASA TM 88227, 1986). The simulations were performed using equilibrium and non-equilibrium wall models. The agreement with experiment is encouraging for the finest grid with respect to the separation bubble length, unsteady shock structure and wall pressure distribution. Sensitivity ofWMLES results to grid, wall model, and blockage effects in the tunnel are reported.

Iyer, Prahladh S.↗

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↗

Integrated control system concept for high-speed aircraft

The synthesis and evaluation of flight control system architectures for future aircraft are discussed in terms of design features and the requirements for fighter aircraft. Advanced fighter configurations may feature canards, flaperons, two-dimensional vectoring nozzles, a mixing compression inlet, and an advanced turbojet engine. Survey and evaluation technology will also progress to include distributed microprocessors, VLSI and VHSIC microcircuitry, optical circuits, analytic redundancy, etc. Bottom-p and top-down architectures have been investigated to fulfill the reliability, maintainability, cost, and performance goals. A centralized architecture has been devised with line-removable units to facilitate maintainability and reduce weight. Descriptions are provided of the performance parameters and applications of optical elements, photoelastic pressure sensors, rare earth sensors, computing elements, and information transfer system.

Carlin, C. M.↗

Generic hypersonic vehicle performance model

An integrated computational model of a generic hypersonic vehicle was developed for the purpose of determining the vehicle's performance characteristics, which include the lift, drag, thrust, and moment acting on the vehicle at specified altitude, flight condition, and vehicular configuration. The lift, drag, thrust, and moment are developed for the body fixed coordinate system. These forces and moments arise from both aerodynamic and propulsive sources. SCRAMjet engine performance characteristics, such as fuel flow rate, can also be determined. The vehicle is assumed to be a lifting body with a single aerodynamic control surface. The body shape and control surface location are arbitrary and must be defined. The aerodynamics are calculated using either 2-dimensional Newtonian or modified Newtonian theory and approximate high-Mach-number Prandtl-Meyer expansion theory. Skin-friction drag was also accounted for. The skin-friction drag coefficient is a function of the freestream Mach number. The data for the skin-friction drag coefficient values were taken from NASA Technical Memorandum 102610. The modeling of the vehicle's SCRAMjet engine is based on quasi 1-dimensional gas dynamics for the engine diffuser, nozzle, and the combustor with heat addition. The engine has three variable inputs for control: the engine inlet diffuser area ratio, the total temperature rise through the combustor due to combustion of the fuel, and the engine internal expansion nozzle area ratio. The pressure distribution over the vehicle's lower aft body surface, which acts as an external nozzle, is calculated using a combination of quasi 1-dimensional gas dynamic theory and Newtonian or modified Newtonian theory. The exhaust plume shape is determined by matching the pressure inside the plume, calculated from the gas dynamic equations, with the freestream pressure, calculated from Newtonian or Modified Newtonian theory. In this manner, the pressure distribution along the vehicle after body expansion surface is then determined. The aerodynamic modeling, the engine modeling, and the exhaust plume analysis are described in more detail. A description of the computer code used to perform the above calculations is given and an input/output example is then given. The computer code is available on a Macintosh floppy disk.

Chavez, Frank R.↗

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↗