Search NASA⌕ Search

SEARCH · Search NASA

Results for “coding productivity”

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 91 records · Page 5

Statistical Tests for Diagnosing Fission Source Convergence and Undersampling in Monte Carlo Criticality Calculations [Slides]

There is a very strong need for statistical testing to determine fission source convergence in Monte Carlo criticality calculations. Automation of such tests will greatly streamline and support the work carried out by NCS practitioners. Recent R&D work has shown that no single statistical test for convergence is sufficiently reliable, robust, and “guaranteed.” However, a combination of several standard statistical tests for the similarity of distributions, coupled with a high-fidelity estimate of the fission-matrix source is sufficiently robust, reliable, and repeatable that convergence can be “guaranteed.” During the course of the EG-AMCT studies, a number of statistical metrics and tests were proposed for diagnosing clustering and undersampling. None of these was robust and reliable enough for practical use in production codes. However, the expert group efforts came close. Some recent R&D work stemming from those past efforts has been very successful and promising. This Sub-Group will provide international input and collaboration on the development and implementation of statistical tests for convergence, with the primary goal of having the MC codes automatically detect convergence (or lack thereof). Newly proposed statistical tests to detect undersampling (after convergence) will also be reviewed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

LANL ASC FY23 L2 Milestone Description and Completion Criteria [Slides]

In early 2021, the ASC Program decided that Ristra should provide a production code (Moya) for LANL’s mission in the Low Energy-Density Physics application space. At the same time, Ristra should design an environment for rapid development of new codes that can answer new questions on new hardware. We started FY22 by expanding upon our R&D efforts of high-order DG methods for hydrodynamics; Technical & staffing challenges caused us to abandon this for a traditional FV SGH approach, but leveraging modern techniques. Significant changes in FleCSI (v1.4→2.x) have us writing code anew, in a co-design effort with the FleCSI and FleCSI specialization projects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global Radiological Source Sorting, Tracking, and Monitoring Project: Phase I Final Report

As a proof of concept tested in an operational context, the Global Radiological Source Sorting, Tracking, and Monitoring (GRadSSTraM) Project successfully demonstrated that radio frequency identification (RFID) and Web 2.0* technologies can be deployed to track controlled shipments between the United States and the European Union. Between November 2009 and May 2010, a total of 19 shipments were successfully shipped from Oak Ridge National Laboratory (ORNL) by the U.S. Postal Service (USPS) and tracked to their delivery at England's National Physical Laboratory (NPL) by the United Kingdom Royal Mail. However, the project can only be viewed as a qualified success as notable shortcomings were observed. Although the origin and terminus of all RFID-enabled shipments were recorded and no shipments were lost, not all the waypoints between ORNL and NPL were incorporated into the pilot. Given limited resources, the project team was able to install RFID listeners/actuators at three waypoints between the two endpoints. Although it is likely that all shipments followed the same route between ORNL and NPL, it cannot be determined beyond question that all 19 shipments were routed on identical itineraries past the same three waypoints. The pilot also raises the distinct possibility that unattended RFID tracking alone, without positive confirmation that a tagged item has been properly recorded by an RFID reader, does not meet a rigorous standard for shipping controlled items. Indeed, the proof of concept test strongly suggests that a multifaceted approach to tracking may be called for, including tracking methods that are capable of reading and accepting multiple inputs for individual items [e.g., carrier-provided tracking numbers, Universal Product Codes (UPCs), and RFID tags]. For controlled items, another apparent requirement is a confirmation feature, human or otherwise, which can certify that an item's RFID tag, UPC, or tracking number has been recorded.

42 ENGINEERING↗

Exploiting Modern C++ for Portable Parallel Programming in Lattice QCD Applications

The evolution of ISO C++ standards increasingly serves the needs of scientific computing, offering potential benefits for developing portable applications. The recent revisions of C++ programming language, for instance, introduces a suite of algorithms capable of being executed on accelerators. Although this approach may not yield best performance, it can present a viable balance between code productivity and computational efficiency. In this report, we discuss the implementation of the HISQ operator utilizing a range of features from the C++17/20/23 standards and include an assessment of their performance.

Strelchenko, Alexei↗

A Novel Sensor Platform Matching the Improved Version of IPMVP Option C for Measuring Energy Savings

It is easy to measure energy consumption with a power meter. However, energy savings cannot be directly computed by the powers measured using existing power meter technologies, since the power consumption only reflects parts of the real energy flows. The International Performance Measurement and Verification Protocol (IPMVP) was proposed by the Efficiency Valuation Organization (EVO) to quantify energy savings using four different methodologies of A, B, C and D. Although energy savings can be estimated following the IPMVP, there are limitations on its practical implementation. Moreover, the data processing methods of the four IPMVP alternatives use multiple sensors (thermometer, hygrometer, Occupant information) and power meter readings to simulate all facilities, in order to determine an energy usage benchmark and the energy savings. This study proposes a simple sensor platform to measure energy savings. Using usually the Electronic Product Code (EPC) global standard, an architecture framework for an information system is constructed that integrates sensors data, power meter readings and occupancy conditions. The proposed sensor platform is used to monitor a building with a newly built vertical garden system (VGS). A VGS shields solar radiation and saves on energy that would be expended on air-conditioning. With this platform, the amount of energy saved in the whole facility is measured and reported in real-time. The data are compared with those obtained from detailed measurement and verification (M&V) processes. The discrepancy is less than 1.565%. Using measurements from the proposed sensor platform, the energy savings for the entire facility are quantified, with a resolution of ±1.2%. The VGS gives an 8.483% daily electricity saving for the building. Thus, the results show that the simple sensor platform proposed by this study is more widely applicable than the four complicated IPMVP alternatives and the VGS is an effective tool in reducing the carbon footprint of a building.

vertical garden system (VGS)↗

A simple method for computing the relativistic Compton scattering kernel for radiative transfer

Correct computation of the Compton scattering kernel (CSK), defined to be the Klein-Nishina differential cross section averaged over a relativistic Maxwellian electron distribution, is reported. The CSK is analytically reduced to a single integral, which can then be rapidly evaluated using a power series expansion, asymptotic series, and rational approximation for sigma(s). The CSK calculation has application to production codes that aim at understanding certain astrophysical, laser fusion, and nuclear weapons effects phenomena.

Prasad, M. K.↗

Investigation of three-dimensional separation at wing/body junctions in supersonic flows using TVD MacCormack's scheme

A Total Variation Diminishing (TVD) MacCormack scheme is used to study the three-dimensional separation at wing/body junctions in supersonic flows. The new scheme is robust, resolves discontinuities well with-out any numerical oscillations present in the flow field. Moreover, this new scheme does not contain any problem dependent parameters to be adjusted and many production codes employing MacCormack algorithm can be easily updated to good effect. Numerical simulation carried out in laminar supersonic junction flows using the new scheme yields improved prediction for the separation location and the axial velocity profiles in the separated flow region.

Lakshmanan, B.↗

Thermal analysis of combinatorial solid geometry models using SINDA

Algorithms have been developed using Monte Carlo techniques to determine the thermal network parameters necessary to perform a finite difference analysis on Combinatorial Solid Geometry (CSG) models. Orbital and laser fluxes as well as internal heat generation are modeled to facilitate satellite modeling. The results of the thermal calculations are used to model the infrared (IR) images of targets and assess target vulnerability. Sample analyses and validation are presented which demonstrate code products.

Gerencser, Diane↗

Comparative study of MacCormack and TVD MacCormack schemes for three-dimensional separation at wing/body junctions in supersonic flows

A robust, discontinuity-resolving TVD MacCormack scheme containing no dependent parameters requiring adjustment is presently used to investigate the 3D separation of wing/body junction flows at supersonic speeds. Many production codes employing MacCormack schemes can be adapted to use this method. A numerical simulation of laminar supersonic junction flow is found to yield improved separation location predictions, as well as the axial velocity profiles in the separated flow region.

Lakshmanan, Balakrishnan↗

Algorithms for parallel flow solvers on message passing architectures

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.

Vanderwijngaart, Rob F.↗

External Boundary Conditions for Three-Dimensional Problems of Computational Aerodynamics

We consider an unbounded steady-state flow of viscous fluid over a three-dimensional finite body or configuration of bodies. For the purpose of solving this flow problem numerically, we discretize the governing equations (Navier-Stokes) on a finite-difference grid. The grid obviously cannot stretch from the body up to infinity, because the number of the discrete variables in that case would not be finite. Therefore, prior to the discretization we truncate the original unbounded flow domain by introducing some artificial computational boundary at a finite distance of the body. Typically, the artificial boundary is introduced in a natural way as the external boundary of the domain covered by the grid. The flow problem formulated only on the finite computational domain rather than on the original infinite domain is clearly subdefinite unless some artificial boundary conditions (ABC's) are specified at the external computational boundary. Similarly, the discretized flow problem is subdefinite (i.e., lacks equations with respect to unknowns) unless a special closing procedure is implemented at this artificial boundary. The closing procedure in the discrete case is called the ABC's as well. In this paper, we present an innovative approach to constructing highly accurate ABC's for three-dimensional flow computations. The approach extends our previous technique developed for the two-dimensional case; it employs the finite-difference counterparts to Calderon's pseudodifferential boundary projections calculated in the framework of the difference potentials method (DPM) by Ryaben'kii. The resulting ABC's appear spatially nonlocal but particularly easy to implement along with the existing solvers. The new boundary conditions have been successfully combined with the NASA-developed production code TLNS3D and used for the analysis of wing-shaped configurations in subsonic (including incompressible limit) and transonic flow regimes. As demonstrated by the computational experiments and comparisons with the standard (local) methods, the DPM-based ABC's allow one to greatly reduce the size of the computational domain while still maintaining high accuracy of the numerical solution. Moreover, they may provide for a noticeable increase of the convergence rate of multigrid iterations.

Tsynkov, Semyon V.↗

Robust Multigrid Smoothers for Three Dimensional Elliptic Equations with Strong Anisotropies

We discuss the behavior of several plane relaxation methods as multigrid smoothers for the solution of a discrete anisotropic elliptic model problem on cell-centered grids. The methods compared are plane Jacobi with damping, plane Jacobi with partial damping, plane Gauss-Seidel, plane zebra Gauss-Seidel, and line Gauss-Seidel. Based on numerical experiments and local mode analysis, we compare the smoothing factor of the different methods in the presence of strong anisotropies. A four-color Gauss-Seidel method is found to have the best numerical and architectural properties of the methods considered in the present work. Although alternating direction plane relaxation schemes are simpler and more robust than other approaches, they are not currently used in industrial and production codes because they require the solution of a two-dimensional problem for each plane in each direction. We verify the theoretical predictions of Thole and Trottenberg that an exact solution of each plane is not necessary and that a single two-dimensional multigrid cycle gives the same result as an exact solution, in much less execution time. Parallelization of the two-dimensional multigrid cycles, the kernel of the three-dimensional implicit solver, is also discussed. Alternating-plane smoothers are found to be highly efficient multigrid smoothers for anisotropic elliptic problems.

Llorente, Ignacio M.↗

MLP: A Parallel Programming Alternative to MPI for New Shared Memory Parallel Systems

Recent developments at the NASA AMES Research Center's NAS Division have demonstrated that the new generation of NUMA based Symmetric Multi-Processing systems (SMPs), such as the Silicon Graphics Origin 2000, can successfully execute legacy vector oriented CFD production codes at sustained rates far exceeding processing rates possible on dedicated 16 CPU Cray C90 systems. This high level of performance is achieved via shared memory based Multi-Level Parallelism (MLP). This programming approach, developed at NAS and outlined below, is distinct from the message passing paradigm of MPI. It offers parallelism at both the fine and coarse grained level, with communication latencies that are approximately 50-100 times lower than typical MPI implementations on the same platform. Such latency reductions offer the promise of performance scaling to very large CPU counts. The method draws on, but is also distinct from, the newly defined OpenMP specification, which uses compiler directives to support a limited subset of multi-level parallel operations. The NAS MLP method is general, and applicable to a large class of NASA CFD codes.

Taft, James R.↗

Diffuse Galactic Continuum Gamma Rays. A Model Compatible with EGRET Data and Cosmic-ray Measurements

We present a study of the compatibility of some current models of the diffuse Galactic continuum gamma-rays with EGRET data. A set of regions sampling the whole sky is chosen to provide a comprehensive range of tests. The range of EGRET data used is extended to 100 GeV. The models are computed with our GALPROP cosmic-ray propagation and gamma-ray production code. We confirm that the "conventional model" based on the locally observed electron and nucleon spectra is inadequate, for all sky regions. A conventional model plus hard sources in the inner Galaxy is also inadequate, since this cannot explain the GeV excess away from the Galactic plane. Models with a hard electron injection spectrum are inconsistent with the local spectrum even considering the expected fluctuations; they are also inconsistent with the EGRET data above 10 GeV. We present a new model which fits the spectrum in all sky regions adequately. Secondary antiproton data were used to fix the Galactic average proton spectrum, while the electron spectrum is adjusted using the spectrum of diffuse emission it- self. The derived electron and proton spectra are compatible with those measured locally considering fluctuations due to energy losses, propagation, or possibly de- tails of Galactic structure. This model requires a much less dramatic variation in the electron spectrum than models with a hard electron injection spectrum, and moreover it fits the y-ray spectrum better and to the highest EGRET energies. It gives a good representation of the latitude distribution of the y-ray emission from the plane to the poles, and of the longitude distribution. We show that secondary positrons and electrons make an essential contribution to Galactic diffuse y-ray emission.

Strong, Andrew W.↗

Object-Oriented/Data-Oriented Design of a Direct Simulation Monte Carlo Algorithm

Over the past decade, there has been much progress towards improved phenomenological modeling and algorithmic updates for the direct simulation Monte Carlo (DSMC) method, which provides a probabilistic physical simulation of gas Rows. These improvements have largely been based on the work of the originator of the DSMC method, Graeme Bird. Of primary importance are improved chemistry, internal energy, and physics modeling and a reduction in time to solution. These allow for an expanded range of possible solutions In altitude and velocity space. NASA's current production code, the DSMC Analysis Code (DAC), is well-established and based on Bird's 1994 algorithms written in Fortran 77 and has proven difficult to upgrade. A new DSMC code is being developed in the C++ programming language using object-oriented and data-oriented design paradigms to facilitate the inclusion of the recent improvements and future development activities. The development efforts on the new code, the Multiphysics Algorithm with Particles (MAP), are described, and performance comparisons are made with DAC.

Liechty, Derek S.↗

Photoelectrons and Solar Ionizing Radiation at Mars: Predictions Versus MAVEN Observations

Understanding the evolution of the Martian atmosphere requires knowledge of processes transforming solar irradiance into thermal energy well enough to model them accurately. Here we compare Martian photoelectron energy spectra measured at periaps is by Mars Atmosphere and Volatile Evolution MissioN (MAVEN) with calculations made using three photoelectron production codes and three solar irradiance models as well as modeled and measured CO2 densities. We restricted our comparisons to regions where the contribution from solar wind electrons and ions were negligible. The two intervals examined on 19 October 2014 have different observed incident solar irradiance spectra. In spite of the differences in photoionization cross sections and irradiance spectra used, we find the agreement between models to be within the combined uncertainties associated with the observations from the MAVEN neutral density, electron flux, and solar irradiance instruments.

solar ionizing↗

Enhancing Monte Carlo proxy applications on GPUs

In Monte Carlo neutron transport simulations, a computational routine commonly known as the ”cross-section lookup” has been identified as being the most computationally expensive part of these applications. A tool which is commonly used as a proxy application for these routines, named ”XSBench”, was created to simulate popular algorithms used in these routines on CPUs. Currently, however, as GPU-based HPC resources have become more widely available, there has been significant interest and efforts invested in moving these traditionally CPU-based simulations to GPUs. Unfortunately, the algorithms commonly used in the cross-section lookup routine were originally devised and developed for CPU-based platforms, and have seen limited study on GPUs to date. Additionally, platforms such as XSBench implement approximations which may have a negligible effect on CPUs, but may be quite impactful to performance on GPUs given the more resource-limited nature of the latter. As a result, we have created VEXS, a new tool for modeling the cross-section lookup routine which removes or at least reduces the approximations made by XSBench in order to provide a more realistic prediction of algorithm performance on GPUs. In this paper, we detail our efforts to remove and reduce these approximations, show the resulting improvement in performance prediction in comparison to a reference production code, Shift, and provide some basic profiling analysis of the resulting application.

Shriver, Forrest↗

Application of the GBFP Method to Electron Partial-Wave Expansion Elastic Scattering Differential Cross Sections Within the Geant4 Toolkit - Paper 69

Analog Monte Carlo simulation of electrons in complex material geometries is generally impractical because the long range Coulomb interactions result in highly peaked differential cross sections (DCS) for scattering and energy-loss and extremely small collision mean free paths (mfp). The condensed history (CH) Monte Carlo method attempts to alleviate this limitation by advancing electrons in fixed steps and sampling angular deflections and energy losses from precomputed distributions obtained from approximate solutions to the underlying transport equation that are valid only for thin layers. Though CH is efficient and is widely employed in production codes (ITS, MCNP, EGS, Geant), step size restrictions and inconsistent handling of material and free surface boundaries limit the ultimate accuracy possible with this approach, especially in applications to highly heterogeneous media. Recently proposed alternatives to the CH method, such as the Generalized Boltzmann Fokker-Planck (GBFP) method, restore the correct transport mechanics by simulating single events based on a Boltzmann transport equation but with efficiency and accuracy achieved through the use of reduced-physics interaction models. Motivated by Lewis theory, various moment-preserving strategies are employed in the GBFP approach to construct DCSs that are less singular, and with mfps shorter than analog. Specifically, the approximate cross sections are constructed to rigorously preserve a finite number of angular and energy-loss moments of the analog DCSs while all higher moments are approximated in terms of the exact lower moments. By systematically increasing the number of moments retained, any desired accuracy can be obtained for integrated quantities, such as dose, reflection and transmission yields, as well as distributed quantities such as energy and angular distributions. For relativistic Rutherford cross section models, the GBFP method has been demonstrated in Monte Carlo simulation to yield accuracy comparable to analog but at a fraction of the cost. One advantage of the GBFP approach is that angular deflection and energy-loss interactions depend only on Legendre moments and energy-loss moments and not the detailed form of the analog DCSs. This feature allows moment-preservation to be enforced through DCSs expressed as a superposition of discrete (i.e., using delta-functions) angular deflections and discrete energy losses. This promotes extremely efficient computation when compared to analog and completely continuous or hybrid discrete-continuous moment-based DCS reconstructions, while yielding highly accurate results for integrated and distributed quantities. In this paper, we demonstrate that the moment-preserving algorithms central to our fully discrete GBFP method can be readily extended to apply to tabulated DCS data, specifically to the partial-wave expansion (PWE) elastic scattering DCSs. Since data libraries for the PWE DCSs for energy and material combinations of interest can be prohibitively large, the GBFP method provides a means to reduce data storage requirements. We implemented our algorithm in the Geant4 Monte Carlo code and all numerical results are obtained using this implementation. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗