Search NASA⌕ Search

SEARCH · Search NASA

Results for “Match Machining”

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 325 records · Page 18

A Machine Learning Method for the Forensics Attribution of Separated Plutonium

Plutonium (Pu) source attribution would be a powerful tool to support nuclear nonproliferation efforts. This capability to find the source of a Pu sample would act as a deterrent to smuggling efforts, and also help regulatory agencies verify declared nuclear activities. Work at Texas A&M University yielded a nuclear forensics methodology, which is capable of determining separated Pu’s reactor of origin, fuel burnup, and the time since irradiation (TSI)—three parameters of interest. The methodology used a set of ten intra-element isotopic ratios found in separated Pu, which was compared to a library of isotopic ratio values produced using neutronics simulations for reactors of interest. By calculating the probability that unknown Pu sample’s isotopic ratio set matched a set in the library, the methodology could predict the three parameters of interest of the sample. One shortcoming of this methodology was an inability to correctly attribute spoofed Pu, where Pu sourced from two different reactors or two different fuel burnup levels are mixed. A new methodology to rectify this vulnerability using machine learning (ML) technique is developed, instead of the maximum likelihood calculation previously used and the results are satisfactory. The ML approach leverages the existing simulated data for training the algorithm, but use them efficiently by only using intra-element isotope ratios that contribute to the attribution one of the three parameters at a time. Previously, all isotope ratios were used to attribute all three parameters together. The new methodology attributes the Pu parameters in three steps, one for each parameter, rather than resolving all of the three parameters simultaneously like the previous maximum likelihood approach. First, a support vector machine classifier with a set of seven isotopic ratios finds the reactor of origin and a set of regression models trained using gaussian process predicts the burnup with a different set of seven isotopes. Finally, TSI is calculated analytically using decay equations. Thus far, the new methodology is capable of attributing pure Pu samples and has been validated using experimental data. The next step will to be augment the classifier training data set with spoofed Pu data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Studying the hadron structure with PANDA and CLAS using machine learning techniques

The hadron spectroscopy and structure are currently very active fields of research to study the non-perturbative regime of quantum chronodynamics. The first one studies the complex structure of excited hadrons by looking at their decay products, while the latter uses lepton scattering on nucleons. Both methods require reconstruction algorithms with great efficiency and good particle identification and background rejection rates. This work aims to provide these by either improving the existing methods or developing new ones. The first part of this document presents a feasibility study of a predicted hybrid charmonium state for the PANDA experiment. Lattice QCD calculations predict the ground state hybrid charmonium to be a spin exotic with quantum numbers of JP C = 1?+ at a mass of around 4.3 GeV with a width to be around 20 MeV. A machine learning based data analysis scheme is proposed to further improve the signal efficiency and the background reduction, alongside with improvements of the analysis software (PandaRoot), that are vital for this study. These improvements include a reworked clustering algorithm for the electromagnetic calorimeter (EMC) and an optimized monte carlo matching for neutral particles. The second part of this document is about studying the proton structure. A multidimensional study of the structure function ratio Fsin(?)LU /FUU has been performed for K±, based on the measurement of beam-spin asymmetries. It uses the high statistics data recorded with the CLAS12 spectrometer at Jefferson Laboratory. Fsin(?)LU is a twist-3 quantity that provides information about the quark gluon correlations in the proton. This document will present for the first time a simultaneous analysis of two kaon channels over a large kinematic range of z, xB , PT and Q2 with virtualities Q2 ranging from 1 GeV2 up to 8 GeV2 using machine learning techniques for improved particle identification.

Kripko, Aron↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

NRAP-Open-IAM Analytical Reservoir Model: Development and Testing

Geological carbon sequestration (GCS) is a key technology for reducing global carbon dioxide (CO 2 ) emissions. Over the last decade, the U.S. Department of Energy has invested in understanding the science base, developing practical implementation methods, and demonstrating secure GCS technologies to mitigate the environmental impacts associated with the atmospheric release of CO 2 . As part of the National Risk Assessment Partnership, a systems-level risk assessment tool, called the NRAP-Open-IAM, has been developed to conduct risk assessment and enable safe operations at a GCS site. The current NRAP-Open-IAM contains a simple reservoir model component that calculates the evolution of CO 2 saturation and fluid pressure in a storage reservoir during CO 2 injection operations. This report presents the development and testing of a new analytical reservoir reduced-order model (ROM), which is extended from an existing semi-analytical model for estimation of CO 2 and brine leakage along legacy wells, and enhances the capability of the NRAP-Open-IAM to simulate more types of reservoir conditions. The developed model is validated against three reference studies, and the results indicate that the new ROM predicts the behavior of the two-phase fluids (brine and injected CO 2 ) well and is applicable to different reservoir simulation boundary conditions (i.e., constant pressure boundary and infinite-acting boundary) without a priori user specification of the boundary type. Sensitivity analysis for a set of model parameters is performed using 4,000 synthetic cases prepared via a fully automated process and using machine-learning-based feature selection. The stochastic analysis identifies gravitational number (i.e., ratio of gravitational forces to viscous force) and distance between the injection well and observation location as the most impactful parameters for matching the pressure and CO 2 saturation, respectively, between the numerical simulations and the ROM. This report details the possible ROM uncertainties and serves as a guide for users to understand the use and limitations of this ROM. The code implementation of the model will be released as a module within the NRAP-Open-IAM.

54 ENVIRONMENTAL SCIENCES↗

Evaluating Effectiveness of Modeling Motion System Feedback in the Enhanced Hess Structural Model of the Human Operator

In order to use the Hess Structural Model to predict the need for certain cueing systems, George and Cardullo significantly expanded it by adding motion feedback to the model and incorporating models of the motion system dynamics, motion cueing algorithm and a vestibular system. This paper proposes a methodology to evaluate effectiveness of these innovations by performing a comparison analysis of the model performance with and without the expanded motion feedback. The proposed methodology is composed of two stages. The first stage involves fine-tuning parameters of the original Hess structural model in order to match the actual control behavior recorded during the experiments at NASA Visual Motion Simulator (VMS) facility. The parameter tuning procedure utilizes a new automated parameter identification technique, which was developed at the Man-Machine Systems Lab at SUNY Binghamton. In the second stage of the proposed methodology, an expanded motion feedback is added to the structural model. The resulting performance of the model is then compared to that of the original one. As proposed by Hess, metrics to evaluate the performance of the models include comparison against the crossover models standards imposed on the crossover frequency and phase margin of the overall man-machine system. Preliminary results indicate the advantage of having the model of the motion system and motion cueing incorporated into the model of the human operator. It is also demonstrated that the crossover frequency and the phase margin of the expanded model are well within the limits imposed by the crossover model.

Zaychik, Kirill↗

Application of Machine Learning to Predict the Response of the Liquid Mercury Target at the Spallation Neutron Source

The Spallation Neutron Source (SNS) at Oak Ridge National Laboratory is currently the most powerful accelerator-driven neutron source in the world. The intense proton pulses strike on SNS’s mercury target to provide bright neutron beams, which also leads to severe fluid-structure interactions inside the target. Prediction of resultant loading on the target is difficult particularly when helium gas is intentionally injected into mercury to reduce the loading and mitigate the pitting damage on the target’s internal walls. Leveraging the power of machine learning and the measured target strain, we have developed machine learning surrogates for modeling the discrepancy between simulations and experimental strain data. We then employ these surrogates to guide the refinement of the high-fidelity mercury/helium mixture model to predict a better match of target strain response.

Lin, Lianshan↗

Use of Textured Surfaces to Mitigate Sliding Friction and Wear of Lubricated and Non-Lubricated Contacts

If properly employed, the placement of three-dimensional feature patterns, also referred to as textures, on relatively-moving, load-bearing surfaces can be beneficial to their friction and wear characteristics. For example, geometric patterns can function as lubricant supply channels or depressions in which to trap debris. They can also alter lubricant flow in a manner that produces thicker load-bearing films locally. Considering the area occupied by solid areas and spaces, textures also change the load distribution on surfaces. At least ten different attributes of textures can be specified, and their combinations offer wide latitude in surface engineering. By employing directional machining and grinding procedures, texturing has been used on bearings and seals for well over a half century, and the size scales of texturing vary widely. This report summarizes past work on the texturing of load-bearing surfaces, including past research on laser surface dimpling of ceramics done at ORNL. Textured surfaces generally show most pronounced effects when they are used in conformal or nearly conformal contacts, like that in face seals. Combining textures with other forms of surface modification and lubrication methods can offer additional benefits in surface engineering for tribology. As the literature and past work at ORNL shows, texturing does not always provide benefits. Rather, the selected pattern and arrangement of features must be matched to characteristics of the proposed application, bearing materials, and lubricants.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Uncertainty quantification for misspecified machine learned interatomic potentials

The use of high-dimensional regression techniques from machine learning has significantly improved the quantitative accuracy of interatomic potentials. Atomic simulations can now plausibly target quantitative predictions in a variety of settings, which has brought renewed interest in robust means to quantify uncertainties. In many practical settings where model complexity is constrained (e.g., due to performance considerations), misspecification — the inability of any one choice of model parameters to exactly match all training data — is a key contributor to errors that is often disregarded. Here, we employ a recent misspecification-aware regression technique to quantify parameter uncertainties, which is then propagated to a broad range of phase and defect properties in tungsten. The propagation is performed through both brute-force resampling and implicit Taylor expansion. The propagated misspecification uncertainties robustly quantify and bound errors on a broad range of material properties. We demonstrate application to recent foundational machine learning interatomic potentials, accurately predicting and bounding errors in MACE-MPA-0 energy predictions across the diverse materials project database.

36 MATERIALS SCIENCE↗

Model of a SNS Electrostatic LEBT with a Near-Ground Beam Chopper

The low energy beam transport (LEBT) of the Spallation Neutron Source (SNS) accelerator consists of two electrostatic lenses, of which the second is split into four electrically-isolated segments. Adding fast pulsed voltages to the lens high voltage creates the transverse fields required for beam chopping. Electric sparks, however, create transients that enter the fast high-voltage switches, which are occasionally damaged and cause machine downtime. This work models a new configuration of the electrostatic LEBT, which chops the beam with four shielded, near-ground electrodes between the two lenses. The model shows that the new configuration can match the RFQ injection requirements and sufficiently deflect the beam in the phase-space using the same chopping voltages as in the baseline LEBT.

43 PARTICLE ACCELERATORS↗

Edge-localized mode avoidance and pedestal structure in I-mode plasmas

I-mode is a high-performance tokamak regime characterized by the formation of a temperature pedestal and enhanced energy confinement, without an accompanying density pedestal or drop in particle and impurity transport. I-mode operation appears to have naturally occurring suppression of large Edge-Localized Modes (ELMs) in addition to its highly favorable scalings of pedestal structure and overall performance. Extensive study of the ELMy H-mode has led to the development of the EPED model, which utilizes calculations of coupled peeling-ballooning MHD modes and kinetic-ballooning mode (KBM) stability limits to predict the pedestal structure preceding an ELM crash. We apply similar tools to the structure and ELM stability of I-mode pedestals. Analysis of I-mode discharges prepared with high-resolution pedestal data from the most recent C-Mod campaign reveals favorable pedestal scalings for extrapolation to large machines—pedestal temperature scales strongly with power per particle P{sub net}/n{sup ¯}{sub e}, and likewise pedestal pressure scales as the net heating power (consistent with weak degradation of confinement with heating power). Matched discharges in current, field, and shaping demonstrate the decoupling of energy and particle transport in I-mode, increasing fueling to span nearly a factor of two in density while maintaining matched temperature pedestals with consistent levels of P{sub net}/n{sup ¯}{sub e}. This is consistent with targets for increased performance in I-mode, elevating pedestal β{sub p} and global performance with matched increases in density and heating power. MHD calculations using the ELITE code indicate that I-mode pedestals are strongly stable to edge peeling-ballooning instabilities. Likewise, numerical modeling of the KBM turbulence onset, as well as scalings of the pedestal width with poloidal beta, indicates that I-mode pedestals are not limited by KBM turbulence—both features identified with the trigger for large ELMs, consistent with the observed suppression of large ELMs in I-mode.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

VoroClust

SAND2025-11465O VoroClust, also known as Voronoi Clustering, is a fast, density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. It operates as quickly as distance-based clustering methods while effectively capturing complex regional geometries, matching the performance of current density-based methods. VoroClust employs a data-centered sphere cover to reduce computational demands while preserving data topology. It propagates clusters outward from local density peaks. Although supervised machine learning is powerful for applications like image classification and segmentation, it requires comprehensive, consistent datasets, which many applications lack. Unsupervised clustering algorithms analyze the structure of each dataset rather than relying on similarities with other examples, making them well-suited for practical applications with insufficient or inappropriate data for supervised learning. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Ebeida, Mohamed [Sandia National Lab. (SNL-CA), Li↗

Manual discrimination of force

Optimal design of human-machine interfaces for teleoperators and virtual-environment systems which involve the tactual and kinesthetic modalities requires knowledge of the human's resolving power in these modalities. The resolution of the interface should be appropriately matched to that of the human operator. We report some preliminary results on the ability of the human hand to distinguish small differences in force under a variety of conditions. Experiments were conducted on force discrimination with the thumb pushing an interface that exerts a constant force over the pushing distance and the index finger pressing against a fixed support. The dependence of the sensitivity index d' on force increment can be fit by a straight line through the origin and the just-noticeable difference (JND) in force can thus be described by the inverse of the slope of this line. The receiver operating characteristic (ROC) was measured by varying the a priori probabilities of the two alternatives, reference force and reference force plus an increment, in one-interval, two-alternative, forced-choice experiments. When plotted on normal deviate coordinates, the ROC's were roughly straight lines of unit slope, thus supporting the assumption of equal-variance normal distributions and the use of the conventional d' measure. The JND was roughly 6-8 percent for reference force ranging from 2.5 to 10 newtons, pushing distance from 5 to 30 mm, and initial finger-span from 45 to 125 mm. Also, the JND remained the same when the subjects were instructed to change the average speed of pushing from 23 to 153 mm/sec. The pushing was terminated by reaching either a wall or a well, and the JND's were essentially the same in both cases.

Pang, Xiao-Dong↗

Revealing the Milky Way’s most recent major merger with a Gaia EDR3 catalogue of machine-learned line-of-sight velocities

Machine learning can play a powerful role in inferring missing line-of-sight velocities from astrometry in surveys such as Gaia. In this paper, we apply a neural network to Gaia Early Data Release 3 (EDR3) and obtain line-of-sight velocities and associated uncertainties for ~92 million stars. The network, which takes as input a star’s parallax, angular coordinates, and proper motions, is trained and validated on ~6.4 million stars in Gaia with complete phase-space information. The network’s uncertainty on its velocity prediction is a key aspect of its design; by properly convolving these uncertainties with the inferred velocities, we obtain accurate stellar kinematic distributions. As a first science application, we use the new network-completed catalogue to identify candidate stars that belong to the Milky Way’s most recent major merger, Gaia-Sausage-Enceladus (GSE). We present the kinematic, energy, angular momentum, and spatial distributions of the ~450 000 GSE candidates in this sample, and also study the chemical abundances of those with cross matches to GALAH and APOGEE. Furthermore, the network’s predictive power will only continue to improve with future Gaia data releases as the training set of stars with complete phase-space information grows. This work provides a first demonstration of how to use machine learning to exploit high-dimensional correlations on data to infer line-of-sight velocities, and offers a template for how to train, validate, and apply such a neural network when complete observational data is not available.

79 ASTRONOMY AND ASTROPHYSICS↗

Using Artificial Neural Networks to Predict Physical Properties of Membrane Polymers

Membrane polymers are a promising technology for use in many challenging gas separation applications. Here, the techniques of computer-aided molecular design can be used to search through the massive molecular space of heteropolymers and develop a set of likely candidate repeat units matching specific physical property targets. However, reasonably accurate property prediction algorithms are needed, but these algorithms must be very fast in order to be combined with an optimization framework. Artificial neural networks (ANNs), a branch of machine learning, are applied in this work to predict the physical properties of polymers. All of the physical properties investigated were found to be predicted by ANNs with R 2 scores exceeding 0.82.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reconstructing porous media using generative flow networks

One area of intense scientific interest for the study of sandstones, carbonates, and shale at the pore scale is the use of limited image and petrophysical data to generate multiple realizations of a rock’s pore structure. Such images aid efforts to quantify uncertainty in petrophysical properties, including porosity–permeability transforms. We develop and evaluate a deep learning-based method to synthesize porous media volumes using a so-called generative flow model trained on x-ray microscope images of rock texture and pore structure. These models are optimized on a log-likelihood objective and they synthesize large and realistic three-dimensional images. Further, we demonstrate the rapid generation of sandstone image volumes that display realism as gauged by quantitative comparison of topological features using Minkowski functionals of porosity, specific surface area, and the Euler–Poincaré characteristic (i.e., pore connectivity). We also evaluate the single-phase permeability using Navier–Stokes and lattice Boltzmann methods and show that transport properties of the generated samples match measured trends.

58 GEOSCIENCES↗

MPI + OpenACC: Accelerating radiation transport mini-application, minisweep, on heterogeneous systems

According to the article, architectures are rapidly evolving, and exascale machines are expected to offer billion-way concurrency. We need to rethink algorithms, languages and programming models among other components in order to migrate large scale applications and explore parallelism on these machines. Although directive-based programming models allow programmers to worry less about programming and more about science, expressing complex parallel patterns in these models can be a daunting task especially when the goal is to match the performance that the hardware platforms can offer. One such pattern is wavefront. This paper extensively studies a wavefront-based miniapplication for Denovo, a production code for nuclear reactor modeling. We parallelize the Koch–Baker–Alcouffe (KBA) parallel-wavefront sweep algorithm in the main kernel of Minisweep (the miniapplication) using CUDA 9.0, OpenMP 4.0 (SIMD) and OpenACC 2.6. Our OpenACC implementation running on NVIDIA’s next-generation Volta GPU boasts an 85.06x speedup over serial code, which is larger than CUDA’s 83.72x speedup over the same serial implementation. We also explore the scalability of our solution using MPI to decompose our simulation domain, allowing us to run on many nodes and accelerators present in state-of-the-art HPC systems. Our parallelization effort across platforms also motivated us to define an abstract parallelism model that is architecture independent, with a goal of creating software abstractions that can be used by applications employing the wavefront sweep motif.

Computer Science↗

Validation of new and existing methods for time-domain simulations of turbulence and loads

We seek to obtain a second-by-second match between the simulated and measured structural loads of a utility-scale wind turbine. To obtain the one-to-one load simulations, we start with the furthest upstream component of the modeling chain: the turbulent inflow. We consider new and existing methods to generate constrained-turbulence flow fields. The new method is based on large-eddy simulations (LES) and machine learning (ML). The existing methods include Kaimal-based TurbSim and the superstatistical wind field model. The inflow measurements used to constrain these simulations are obtained with a nacelle-mounted scanning lidar. We compare the flow fields for the different inflow simulation approaches and validate their associated load predictions against measurements collected in the Rotor Aero-dynamics, Aeroelastics, and Wake (RAAW) field campaign. We find that the rotor-position control developed for this study is key in enabling the time match between measurements and simulations. When this control approach is used, the load simulation performance tracks with the inflow simulation fidelity, with LES+ML yielding errors ≤ 4% for the damage-equivalent loads of flapwise bending moment, and tower fore-aft bending moments.

17 WIND ENERGY↗

Abstractions and Directives for Adapting Wavefront Algorithms to Future Architectures

Architectures are rapidly evolving, and exascale machines are expected to offer billion-way concurrency. We need to rethink algorithms, languages and programming models among other components in order to migrate large scale applications and explore parallelism on these machines. Although directive-based programming models allow programmers to worry less about programming and more about science, expressing complex parallel patterns in these models can be a daunting task especially when the goal is to match the performance that the hardware platforms can offer. One such pattern is wavefront. This paper extensively studies a wavefront-based miniapplication for Denovo, a production code for nuclear reactor modeling. We parallelize the Koch-Baker-Alcouffe (KBA) parallel-wavefront sweep algorithm in the main kernel of Minisweep (the miniapplication) using CUDA, OpenMP and OpenACC. Our OpenACC implementation running on NVIDIA's next-generation Volta GPU boasts an 85.06x speedup over serial code, which is larger than CUDA's 83.72x speedup over the same serial implementation. Our experimental platform includes SummitDev, an ORNL representative architecture of the upcoming Summit supercomputer. Our parallelization effort across platforms also motivated us to define an abstract parallelism model that is architecture independent, with a goal of creating software abstractions that can be used by applications employing the wavefront sweep motif.

Searles, Robert↗