Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing applications”

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 739 records · Page 41

Incorporating the effects of objects in an approximate model of light transport in scattering media

A computationally efficient radiative transport model is presented that predicts a camera measurement and accounts for the light reflected and blocked by an object in a scattering medium. The model is in good agreement with experimental data acquired at the Sandia National Laboratory Fog Chamber Facility (SNLFC). The model is applicable in computational imaging to detect, localize, and image objects hidden in scattering media. Here, a statistical approach was implemented to study object detection limits in fog.

42 ENGINEERING↗

Fault Modeling of Extreme Scale Applications Using Machine Learning

Faults are commonplace in large scale systems. These systems experience a variety of faults such as transient, permanent and intermittent. Multi-bit faults are typically not corrected by the hardware resulting in an error. Here, this paper attempts to answer an important question: Given a multi-bit fault in main memory, will it result in an application error — and hence a recovery algorithm should be invoked — or can it be safely ignored? We propose an application fault modeling methodology to answer this question. Given a fault signature (a set of attributes comprising of system and application state), we use machine learning to create a model which predicts whether a multibit permanent/transient main memory fault will likely result in error. We present the design elements such as the fault injection methodology for covering important data structures, the application and system attributes which should be used for learning the model, the supervised learning algorithms (and potentially ensembles), and important metrics. Lastly, we use three applications — NWChem, LULESH and SVM — as examples for demonstrating the effectiveness of the proposed fault modeling methodology.

97 MATHEMATICS AND COMPUTING↗

Large-scale computational polymer solubility predictions and applications to dissolution-based plastic recycling

Dissolution-based plastic recycling is a promising approach to separate and recover high quality pure polymer resins from multicomponent plastic waste by exploiting differences in polymer solubility. The design of a dissolution-based polymer recycling process requires the selection of appropriate solvent systems and operating temperatures to dissolve only target polymers. Determining these parameters experimentally is challenging due to the wide range of solvents and temperatures possible for a given set of target polymers. In this work, we report a computational scheme that employs molecular dynamics simulations and the Conductor-like Screening Model for Realistic Solvents to predict polymer solubilities. Using this scheme, we established a computational solubility database for 8 common polymers and 1007 solvents at multiple temperatures and measured selected solubilities experimentally to validate computational predictions. Analysis of functional groups within this large database then provides chemical heuristics relating the molecular structures of good and non-solvents for selected polymers. We further developed a tool that automates the selection of solvents for all possible sequences in which target polymers can be selectively dissolved to guide the design of dissolution-based plastic recycling processes. Here, we demonstrate the application of these methods via multiple experimental case studies of representative dissolution-based polymer recycling processes in which pure polymer resins were successfully recovered from physical mixtures of polymers.

42 ENGINEERING↗

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗

Multidimensional Multiphysics Simulation of TRISO Particle Fuel

Multidimensional multiphysics analysis of TRISO-coated particle fuel using the BISON finite-element based nuclear fuels code is described. The governing equations and material models applicable to particle fuel and implemented in BISON are outlined. Code verification based on a recent IAEA benchmarking exercise is described, and excellant comparisons are reported. Multiple TRISO-coated particles of increasing geometric complexity are considered. It is shown that the code's ability to perform large-scale parallel computations permits application to complex 3D phenomena while very efficient solutions for either 1D spherically symmetric or 2D axisymmetric geometries are straightforward. Additionally, the flexibility to easily include new physical and material models and uncomplicated ability to couple to lower length scale simulations makes BISON a powerful tool for simulation of coated-particle fuel. Future code development activities and potential applications are identified.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Computer-Based Procedures for Field Workers in Nuclear Power Plants: Development of a Model of Procedure Usage and Identification of Requirements

The nuclear industry is constantly trying to find ways to decrease the human error rate, especially the human errors associated with procedure use. As a step toward the goal of improving procedure use performance, researchers, together with the nuclear industry, have been looking at replacing the current paper-based procedures with computer-based procedure systems. The concept of computer-based procedures is not new by any means; however most research has focused on procedures used in the main control room. Procedures reviewed in these efforts are mainly emergency operating procedures and normal operating procedures. Based on lessons learned for these previous efforts we are now exploring a more unknown application for computer based procedures - field procedures, i.e. procedures used by nuclear equipment operators and maintenance technicians. The Idaho National Laboratory and participants from the U.S. commercial nuclear industry are collaborating in an applied research effort with the objective of developing requirements and specifications for a computer-based procedure system to be used by field workers. The goal is to identify the types of human errors that can be mitigated by using computer-based procedures and how to best design the computer-based procedures to do so. This paper describes the development of a Model of Procedure Use and the qualitative study on which the model is based. The study was conducted in collaboration with four nuclear utilities and five research institutes. During the qualitative study and the model development requirements and for computer-based procedures were identified.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Model of Procedure Usage – Results from a Qualitative Study to Inform Design of Computer-Based Procedures

The nuclear industry is constantly trying to find ways to decrease the human error rate, especially the human errors associated with procedure use. As a step toward the goal of improving procedure use performance, researchers, together with the nuclear industry, have been looking at replacing the current paper-based procedures with computer-based procedure systems. The concept of computer-based procedures is not new by any means; however most research has focused on procedures used in the main control room. Procedures reviewed in these efforts are mainly emergency operating procedures and normal operating procedures. Based on lessons learned for these previous efforts we are now exploring a more unknown application for computer based procedures - field procedures, i.e. procedures used by nuclear equipment operators and maintenance technicians. The Idaho National Laboratory, the Institute for Energy Technology, and participants from the U.S. commercial nuclear industry are collaborating in an applied research effort with the objective of developing requirements and specifications for a computer-based procedure system to be used by field operators. The goal is to identify the types of human errors that can be mitigated by using computer-based procedures and how to best design the computer-based procedures to do this. The underlying philosophy in the research effort is “Stop – Start – Continue”, i.e. what features from the use of paper-based procedures should we not incorporate (Stop), what should we keep (Continue), and what new features or work processes should be added (Start). One step in identifying the Stop – Start – Continue was to conduct a baseline study where affordances related to the current usage of paper-based procedures were identified. The purpose of the study was to develop a model of paper based procedure use which will help to identify desirable features for computer based procedure prototypes. Affordances such as note taking, markups, sharing procedures between fellow coworkers, the use of multiple procedures at once, etc. were considered. The model describes which affordances associated with paper based procedures should be transferred to computer-based procedures as well as what features should not be incorporated. The model also provides a means to identify what new features not present in paper based procedures need to be added to the computer-based procedures to further enhance performance. The next step is to use the requirements and specifications to develop concepts and prototypes of computer-based procedures. User tests and other data collection efforts will be conducted to ensure that the real issues with field procedures and their usage are being addressed and solved in the best manner possible. This paper describes the baseline study, the construction of the model of procedure use, and the requirements and specifications for computer-based procedures that were developed based on the model. It also addresses how the model and the insights gained from it were used to develop concepts and prototypes for computer based procedures.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

YOLO for Radio Frequency Signal Classification

Radio frequency signal classification plays a pivotal role in various applications, including spectrum management, wireless security, and cognitive radio. Extant signal classification methods require significant data throughput and are not multilabel. We propose a novel approach to radio frequency signal classification by leveraging the You Only Look Once (YOLO) object detection method. YOLO is a state-of-the-art deep learning model renowned for its real-time object detection capabilities in computer vision applications. We adapt YOLO for signal classification to enable the automatic and efficient identification of various signal types within a power spectral density image. Index Terms—radio-frequency analysis, object detection, neural networks, machine learning, deep learning.

42 ENGINEERING↗

Hardware-accelerated Components for Hybrid Computing Systems

We present a study on the use of component technology for encapsulating platform-specific hardwareaccelerated algorithms on hybrid HPC systems. Our research shows that component technology can have significant benefits from a software engineering pointof- view to increase encapsulation, portability and reduce or eliminate platform dependence for hardwareaccelerated algorithms. As a demonstration of this concept, we discuss our experience in designing, implementing and integrating an FPGA-accelerated kernel for Polygraph, an application in computational proteomics.

97 MATHEMATICS AND COMPUTING↗

Root system architecture in cereals: progress, challenges and perspective

We report roots are essential multifunctional plant organs involved in water and nutrient uptake, metabolite storage, anchorage, mechanical support, and interaction with the soil environment. Understanding of this ‘hidden half’ provides potential for manipulation of root system architecture (RSA) traits to optimize resource use efficiency and grain yield in cereal crops. Unfortunately, root traits are highly neglected in breeding due to the challenges of phenotyping, but could have large rewards if the variability in RSA traits can be fully exploited. Until now, a plethora of genes have been characterized in detail for their potential role in improving RSA. The use of forward genetics approaches to find sequence variations in genes underpinning desirable RSA would be highly beneficial. Advances in computer vision applications have allowed image-based approaches for high-throughput phenotyping of RSA traits that can be used by any laboratory worldwide to make progress in understanding root function and dissection of the genetics. At the same time, the frontiers of root measurement include non-invasive methods like X-ray computer tomography and magnetic resonance imaging that facilitate new types of temporal studies. Root physiology and ecology are further supported by spatiotemporal root simulation modeling. The discovery of component traits providing improved resilience and yield advantage in target environments is a key necessity for mainstreaming root-based cereal breeding. The integrated use of pan-genome resources, now available in most cereals, coupled with new in-field phenotyping platforms has the potential for precise selection of superior genotypes with improved RSA.

59 BASIC BIOLOGICAL SCIENCES↗

An Overview of UME: Unstructured Mesh Explorations [Slides]

What is UME? UME extracts an important computational kernel from a large computational physics application, which is based on an unstructured mesh representation. The memory layout, indexing, data management, and communication patterns are as close to the original application as possible. The original application is a long-lived Fortran program, with ~750K source lines of code (sloc). UME is a C++17 implementation of a zone gradient operator, with about ~3K sloc.

97 MATHEMATICS AND COMPUTING↗

Local Orthogonal Cutting Method for Computing Medial Curves and Its Biomedical Applications

Medial curves have a wide range of applications in geometric modeling and analysis (such as shape matching) and biomedical engineering (such as morphometry and computer assisted surgery). The computation of medial curves poses significant challenges, both in terms of theoretical analysis and practical efficiency and reliability. In this paper, we propose a definition and analysis of medial curves and also describe an efficient and robust method for computing medial curves. Our approach is based on three key concepts: a local orthogonal decomposition of objects into substructures, a differential geometry concept called the interior center of curvature (ICC), and integrated stability and consistency tests. These concepts lend themselves to robust numerical techniques including eigenvalue analysis, weighted least squares approximations, and numerical minimization, resulting in an algorithm that is efficient and noise resistant. We illustrate the effectiveness and robustness of our approach with some highly complex, large-scale, noisy biomedical geometries derived from medical images, including lung airways and blood vessels. We also present comparisons of our method with some existing methods.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Navier: Dataflow Architecture for Computation Chemistry

Navier’s objectives were two evaluate the use of emerging technologies, especially dataflow accelerators, for high-performance computing (HPC) applications, specifically in the domain of chemistry, and to develop a prototype software stack to support such applications. Navier builds on capabilities previously developed by synergistic projects, such as PNNL Data Model Convergence (DMC) LDRD Hardware Advanced Workflows (HAW) and DuOMO, as well as DOE ARIAA. Throughout its 18 months, the Navier team developed new capabilities and artifacts at all levels of the HW/SW stack, provided a seamless way to integrate novel computing architectures (Sambanova SN10 and Xilinx Versal AI) into an existing software stack, developed chemistry workflows, data analytics tools, and HPC molecular dynamics workflows that leverage the developed stack and PNNL institutional investments in emerging architectures. Navier also explored the use of active learning to accelerate a computational chemistry workflow for organic molecules on PNNL Junction cluster (in collaboration with AMD/Xilinx). Navier developed tools, methodologies, and studies for hardware software co-design and (sparse) dataflow accelerators that are composable and can be used together or separately. These methodologies are now used in other projects, such as DOE AMAIS and HPDA. This report describes Navier’s achievement, the developed tools and methodologies, and the research findings and conclusions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implements sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

Speed Optimizations for Physics Ray Trace Algorithms

Ray tracing is a process used commonly in computer graphics and in physics to track light photons and particles, respectively. Much research was found on improving execution times for the computer graphics applications; however, in the short time frame of this literary review, almost no research was found on improving the execution times for the physics applications that were relevant to this problem. Two ray trace algorithms, a STL raytrace and a conebeam raytrace, were optimized using OpenMP and CUDA.

97 MATHEMATICS AND COMPUTING↗

Computers in neutron science

Abstract Neutron scattering provides a sensitive probe for materials structure and dynamics and has had a profound impact on research ranging from quantum topological materials to archaeology to aerospace alloys. These experiments are incredibly data-rich and often challenging to interpret. Computational studies have been integral in the growing success of neutron science. From data collection and reduction to analysis and interpretation, computers are used at every stage of modern neutron experiments. State-of-the-art software allows for a deeper understanding of these powerful unique experiments. This themed issue, guest-edited by Dr. Jeff Armstrong, Dr. Keith T Butler, and Dr. Matthew R Ryder, brings together a collection of research highlighting the state-of-the-art in the application of computers in neutron science.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Evaluating HPC Kernels for Processing in Memory

Memory subsystems contribute significantly to the performance and energy efficiency of high-performance computing (HPC) applications. Traditional memory technologies with conventional organization (e.g., DRAM) are struggling to keep up with the increasing memory requirements of modern applications. Techniques such as multilayer cache hierarchy and out-of-order execution are still falling short of mitigating the penalty incurred by memory accesses. Processing-in-memory (PIM), which involves moving memory-intensive kernels to memory for execution instead of bringing the data to the processing unit, is emerging as a promising technique. PIM has recently received traction among computer architecture researchers, and the increasing research activity surrounding this technique indicates its potential to alleviate main memory performance bottlenecks. In this paper, we characterize and identify memory-intensive HPC kernels, perform a first-order evaluation of the PIM technique for selected HPC kernels, quantify performance deviation, and analyze the key factors that affect PIM efficiency.

Asifuzzaman, Kazi↗