SEARCH · Search NASA

Results for “Parallel 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.

SourceResearch connectionFrom yearThrough year

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

At least 1,045 records · Page 58

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Interactive Web Application for Traffic Simulation Data Management and Visualization

As traffic simulation software becomes more effective for realistically simulating and analyzing traffic dynamics and vehicle interactions on the mesoscopic and microscopic level, the management, dissemination, and collaborative visualization of traffic simulation results produced by individual transportation planners presents a significant challenge. Existing online content management systems have a very limited capability in allowing users to query specific traffic simulation scenarios and geospatially visualize simulation results through shareable and interactive web interfaces. This paper presents a web-based application for promoting the archiving, sharing, and visualization of large-scale traffic simulation outputs. The application is developed to enhance cyber-physical controls, communications, and public education for collaborative transportation planning. Unique features of the web application include: (a) allowing users to upload their new traffic simulation scenarios (parameters and outputs), as well as search existing scenarios using easily accessible interfaces; (b) optimizing simulation output files with heterogeneous data formats and projected coordinate systems for web-based storage and management using a scalable and searchable data/metadata standard; (c) standardizing user-uploaded simulation outputs using web interfaces and data processing libraries with parallel computing capacity; and (d) providing shareable web visual interfaces for visualizing the traffic flow and signal information stored in simulation outputs (e.g., regional traffic patterns and individual vehicle interactions) and visually comparing multiple simulation outputs both spatially and temporally. Furthermore, the paper presents the conceptual design and implementation of this application, and demonstrates the application’s performance for sharing, comparing, and visualizing simulation outputs from VISSIM and SUMO, two commonly used traffic simulation software programs.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2018

SIESTA-SIPs: Massively parallel spectrum-slicing eigensolver for an ab initio molecular dynamics package

Integration of Shift-and-Invert Parallel spectral transformation (SIPs) eigensolver (as implemented in the SLEPc library) into an ab initio molecular dynamics package, SIESTA, is described. The effectiveness of the code is demonstrated on applications to polyethylene chains, boron nitride sheets, and bulk water clusters. For problems with the same number of orbitals, the performance of the SLEPc eigensolver depends on the sparsity of the matrices involved, favoring reduced dimensional systems such as polyethylene or boron nitride sheets in comparison to bulk systems like water clusters. For all problems investigated, performance of SIESTA-SIPs exceeds the performance of SIESTA with default solver (ScaLAPACK) at the larger number of cores and the larger number of orbitals. A method that improves the load-balance with each iteration in the self-consistency cycle by exploiting the emerging knowledge of the eigenvalue spectrum is demonstrated

ab initio↗

DOE OSTI2017

A graph-based computational framework for simulation and optimisation of coupled infrastructure networks

Here, we present a computational framework that facilitates the construction, instantiation, and analysis of large-scale optimization and simulation applications of coupled energy networks. The framework integrates the optimization modeling package PLASMO and the simulation package DMNetwork (built around PETSc). These tools use a common graphbased abstraction that enables us to achieve compatibility between data structures and to build applications that use network models of different physical fidelity. We also describe how to embed these tools within complex computational workflows using SWIFT, which is a tool that facilitates parallel execution of multiple simulation runs and management of input and output data. We discuss how to use these capabilities to target coupled natural gas and electricity systems.

42 ENGINEERING↗

DOE OSTI2024

Accuracy of the explicit energy-conserving particle-in-cell method for under-resolved simulations of capacitively coupled plasma discharges

The traditional explicit electrostatic momentum-conserving particle-in-cell algorithm requires strict resolution of the electron Debye length to deliver numerical stability and accuracy. The explicit electrostatic energy-conserving particle-in-cell algorithm alleviates this constraint with minimal modification to the traditional algorithm, retaining its simplicity, ease of parallelization, and acceleration on modern supercomputing architectures. In this article, we apply the algorithm to model a one-dimensional radio frequency capacitively coupled plasma discharge relevant to industrial applications. The energy-conserving approach closely matches the results from the momentum-conserving algorithm and retains accuracy even for cell sizes up to 8 times the electron Debye length. For even larger cells, the algorithm loses accuracy due to poor resolution of steep gradients within the radio frequency sheath. Accuracy can be recovered by adopting a non-uniform grid, which resolves the sheath and allows for cell sizes up to 32 times the electron Debye length in the quasi-neutral bulk of the discharge. The effect is an up to 8 times reduction in the number of required simulation cells, an improvement that can compound in higher-dimensional simulations. We therefore consider the explicit energy-conserving algorithm as a promising approach to significantly reduce the computational cost of full-scale device simulations and a pathway to delivering kinetic simulation capabilities of use to industry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis

Here, we present a new software system PETSc TSAdjoint for first-order and second order adjoint sensitivity analysis of time-dependent nonlinear differential equations. The derivative calculation in PETSc TSAdjoint is essentially a high-level algorithmic differentiation process. The adjoint models are derived by differentiating the timestepping algorithms and implementing them based on the parallel infrastructure in PETSc. Full differentiation of the library code, including MPI routines, is avoided, and users do not need to derive their own adjoint models for their specific applications. PETSc TSAdjoint can compute the first-order derivative, that is, the gradient of a scalar functional, and the Hessian-vector product, which carries second-order derivative information, while requiring minimal input (a few callbacks) from the users. The adjoint model employs optimal checkpointing schemes in a manner that is transparent to users. Finally, usability, efficiency, and scalability are demonstrated through examples from a variety of applications.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2026

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

DOE OSTI2018

Partitioning and Communication Strategies for Sparse Non-negative Matrix Factorization

Non-negative matrix factorization (NMF), the problem of finding two non-negative low-rank factors whose product approximates an input matrix, is a useful tool for many data mining and scientific applications such as topic modeling in text mining and unmixing in microscopy. In this paper, we focus on scaling algorithms for NMF to very large sparse datasets and massively parallel machines by employing effective algorithms, communication patterns, and partitioning schemes that leverage the sparsity of the input matrix. We consider two previous works developed for related problems, one that uses a fine-grained partitioning strategy using a point-to-point communication pattern and one that uses a Cartesian, or checkerboard, partitioning strategy using a collective-based communication pattern. We show that a combination of the previous approaches balances the demands of the various computations within NMF algorithms and achieves high efficiency and scalability. From the experiments, we see that our proposed strategy runs up to 10x faster than the state of the art on real-world datasets.

Kaya, Oguz↗

DOE OSTI2019

Laboratory-Based X-ray Absorption Spectroscopy on a Working Pouch Cell Battery at Industrially-Relevant Charging Rates

Li-ion battery (LIB) research has continuing importance for the entire range of applications from consumer products to vehicle electrification and grid stabilization. In many cases, standard electrochemical methods only provide an overall voltage or specific capacity, giving an inadequate description of parallel redox processes or chemical gradients at the particle and pack level. X-ray absorption fine structure (XAFS) is frequently used to augment bulk electrochemical data, as it provides element-specific changes in oxidation state and local atomic structure. Such microscopic descriptors are crucial for elucidating charge transfer and structural changes associated with bonding or site mixing, two key factors in evaluating state of charge and modes of cell failure. However, the impact of XAFS on LIB research has been significantly constrained by a logistical barrier: contemporary XAFS work is performed almost exclusively at synchrotron X-ray light sources, where beamtime is infrequent and experiment time-frames are limited. In this report we show that modern laboratory-based XAFS cannot only be applied to, e.g., characterization of ex situ LIB electrode materials, but can also be used for operando studies at industrially-relevant charging rates in a standard pouch cell preparation. Such capability enables accelerated discovery of new materials and improved operation modes for LIBs.

25 ENERGY STORAGE↗

DOE OSTI2017

Genten: Software for Generalized Tensor Decompositions v. 1.0.0

Tensors, or multidimensional arrays, are a powerful mathematical means of describing multiway data. This software provides computational means for decomposing or approximating a given tensor in terms of smaller tensors of lower dimension, focusing on decomposition of large, sparse tensors. These techniques have applications in many scientific areas, including signal processing, linear algebra, computer vision, numerical analysis, data mining, graph analysis, neuroscience and more. The software is designed to take advantage of parallelism present emerging computer architectures such has multi-core CPUs, many-core accelerators such as the Intel Xeon Phi, and computation-oriented GPUs to enable efficient processing of large tensors.

Phipps, EricT.↗

DOE OSTI2016

Plasma Interactions with Mixed Materials and Impurity Transport

The project brings together three discipline areas at LLNL to develop advanced capability to predict the impact of plasma/material interactions (PMI) on metallic surfaces in magnetic fusion energy (MFE) devices. These areas are (1) modeling transport of wall impurity ions through the edge plasma to the core plasma, (2) construction of a laser blow-off (LBO) system for injecting precise amounts of metallic atoms into a tokamak plasma, and (3) material science analysis of fundamental processes that modify metallic surfaces during plasma bombardment. The focus is on tungsten (W), which is being used for the ITER divertor and in designs of future MFE devices. In area (1), we have worked with the University of California, San Diego (UCSD) on applications of the UEDGE/DUSTT coupled codes to predict the influx of impurity ions from W dust through the edge plasma, including periodic edge-plasma oscillations, and revived a parallel version of UEDGE to speed up these simulations. In addition, the impurity transport model in the 2D UEDGE code has been implemented into the 3D BOUT++ turbulence/transport code to allow fundamental analysis of the impact of strong plasma turbulence on the impurity transport. In area (2), construction and testing of the LBO injection system has been completed. The original plan to install the LBO on the National Spherical Torus Experiment Upgrade (NSTX-U) at Princeton and its use to validate the impurity transport simulations is delayed owing to NSTX-U being offline for substantial magnetic coil repair period. In area (3), an analytic model has been developed to explain the growth of W tendrils (or fuzz) observed for helium-containing plasmas. Molecular dynamics calculations of W sputtering by W and deuterium (D) ions shows that a spatial blending of interatomic potentials is needed to describe the near-surface and deeper regions of the material.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Ex-Core Radiation Transport Modeling with VERA User Manual

It is important to be able to accurately predict the neutron flux outside the immediate reactor core for a variety of safety and material analyses. Monte Carlo radiation transport calculations are required to produce these high–fidelity ex-core responses. The Virtual Environment for Reactor Applications (VERA) provides the automated capability to launch independent Shift fixed-source and eigenvalue Monte Carlo (MC) calculations for user-specified state points during a standard Virtual Environment for Reactor Applications (VERA) calculation. VERA couples MPACT with COBRA-TF (CTF) to Shift to perform ex-core tallies for multiple state points concurrently, with each component capable of parallel execution on independent processor domains. In these ex-core calculations, MPACT is coupled to CTF and performs the in-core depletion and heat transfer calculation, followed by a fixed-source Shift transport calculation including ex-core regions to produce ex-core responses. The fission source, fuel pin temperatures, moderator temperature and density, boron concentration, and fuel pin depleted isotopic compositions can be transferred to Shift from the MPACT calculation. Specifically, VERA performs fluence calculations in the core barrel outward to the end of the pressure vessel and detector response calculations in ex-core detectors. It also performs the requested tallies in any user-defined ex-core regions. VERA takes advantage of the General Geometry (GG) package in Shift. This gives VERA the flexibility to explicitly model features outside the core barrel, including detailed vessel models, detectors, and power plant details. A very limited set of experimental and numerical benchmarks is available for ex-core simulation comparison. The Consortium for Advanced Simulation of Light Water Reactors has developed a set of ex-core benchmark problems to include as part of the VERA verification and validation set of problems. The ex-core capability in VERA has been tested on small representative assembly problems, multi-assembly problems, as well as quarter-core and full-core problems. VERA View has also been extended to visualize these vessel fluence results from VERA. This manual serves to present a guide to VERA users about the methodology behind ex-core calculations and the details of input, output, and analysis of results from these calculations. Details in this version of the manual are based on features in VERA 4.0.1.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Low-Power Deep Learning Inference using the SpiNNaker Neuromorphic Platform

n this presentation we will discuss recent results on using the SpiNNaker neuromorphic platform (48-chip model) for deep learning neural network inference. We use the Sandia Labs developed Whet stone spiking deep learning library to train deep multi-layer perceptrons and convolutional neural networks suitable for the spiking substrate on the neural hardware architecture. By using the massively parallel nature of SpiNNaker, we are able to achieve, under certain network topologies, substantial network tiling and consequentially impressive inference throughput. Such high-throughput systems may have eventual application in remote sensing applications where large images need to be chipped, scanned, and processed quickly. Additionally, we explore complex topologies that push the limits of the SpiNNaker routing hardware and investigate how that impacts mapping software-implemented networks to on-hardware instantiations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Block smoothers and generalized ideal interpolation in AMG (Final Report)

The Pennsylvania State University (“Subcontractor”) worked on developing new parallel algebraic multilevel methods suitable for solving PDEs. Specifically, work on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications was completed. A main emphasis was on the design of new ideal algebraic multigrid interpolation for problems such as Maxwell’s equations where block smoothers are needed and the standard form of ideal interpolation is not an effective choice.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

AMReX

AMReX is a software framework for the development and implementation of massively parallel algorithms using block-structured adaptive mesh refinement (AMR). Block-structured AMR provides the basis for the temporal and spatial discretization strategy for a large variety of applications of interest to the DOE. AMReX provides a unified infrastructure with the functionality needed for applications to be able to effectively and efficiently utilize machines from laptops to exascale accelerator-based architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multi-physics algorithms. AMReX supports algorithms that solve systems of partial differential equations (PDEs) in simple or complex geometries, and those that use particles and/or particle-mesh operations to represent component physical processes.

Zhang, Weiqun↗

DOE OSTI2015

A generalized reconstruction framework for unconventional PET systems

Purpose: Quantitative estimation of the radionuclide activity concentration in positron emission tomography (PET) requires precise modeling of PET physics. The authors are focused on designing unconventional PET geometries for specific applications. This work reports the creation of a generalized reconstruction framework, capable of reconstructing tomographic PET data for systems that use right cuboidal detector elements positioned at arbitrary geometry using a regular Cartesian grid of image voxels. Methods: The authors report on a variety of design choices and optimization for the creation of the generalized framework. The image reconstruction algorithm is maximum likelihood-expectation–maximization. System geometry can be specified using a simple script. Given the geometry, a symmetry seeking algorithm finds existing symmetry in the geometry with respect to the image grid to improve the memory usage/speed. Normalization is approached from a geometry independent perspective. The system matrix is computed using the Siddon’s algorithm and subcrystal approach. The program is parallelized through open multiprocessing and message passing interface libraries. A wide variety of systems can be modeled using the framework. This is made possible by modeling the underlying physics and data correction, while generalizing the geometry dependent features. Results: Application of the framework for three novel PET systems, each designed for a specific application, is presented to demonstrate the robustness of the framework in modeling PET systems of unconventional geometry. Three PET systems of unconventional geometry are studied. (1) Virtual-pinhole half-ring insert integrated into Biograph-40: although the insert device improves image quality over conventional whole-body scanner, the image quality varies depending on the position of the insert and the object. (2) Virtual-pinhole flat-panel insert integrated into Biograph-40: preliminary results from an investigation into a modular flat-panel insert are presented. (3) Plant PET system: a reconfigurable PET system for imaging plants, with resolution of greater than 3.3 mm, is shown. Using the automated symmetry seeking algorithm, the authors achieved a compression ratio of the storage and memory requirement by a factor of approximately 50 for the half-ring and flat-panel systems. For plant PET system, the compression ratio is approximately five. The ratio depends on the level of symmetry that exists in different geometries. Conclusions: This work brings the field closer to arbitrary geometry reconstruction. A generalized reconstruction framework can be used to validate multiple hypotheses and the effort required to investigate each system is reduced. Memory usage/speed can be improved with certain optimizations.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2023

HEPnOS: a Specialized Data Service for High Energy Physics Analysis

In this paper, we present HEPnOS, a distributed data service for managing data produced by high-energy physics (HEP) experiments. Using HEPnOS, HEP applications can use HPC resources more effciently than traditional fle-based applications. The fle-based model leads to a rigid, chunk-based allocation of computational resources and limits the number of cores that can be used concurrently by an HEP application. The fundamental problem is that organizing domain-specifc data into fles inadvertently introduces a single, artifcial, confated tuning parameter that puts key optimization goals into confict: larger fle sizes reduce metadata overhead and thus improve I/O effciency, but smaller fle sizes provide more opportunity for workfow parallelism and load balancing. In this work, we introduce a domain-specifc data service that decouples that constraint so that data can be accessed and processed in its natural granularity while still maintaining I/O effciency. By removing the constraints introduced by fle handling we are able to obtain better scaling and make effcient use of more cores for processing a fxed-sized data sample. We demonstrate the improved scalability by using an application developed in the fle-based paradigm and comparing it to a version modifed to use HEPnOS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2017

An Analytical Time–Domain Expression for the Net Ripple Produced by Parallel Interleaved Converters

We apply modular arithmetic and Fourier series to analyze the superposition of N interleaved triangular waveforms with identical amplitudes and duty-ratios. Here, interleaving refers to the condition when a collection of periodic waveforms with identical periods are each uniformly phase-shifted across one period. The main result is a time-domain expression which provides an exact representation of the summed and interleaved triangular waveforms, where the peak amplitude and parameters of the time-periodic component are all specified in closed-form. Analysis is general and can be used to study various applications in multi-converter systems. This model is unique not only in that it reveals a simple and intuitive expression for the net ripple, but its derivation via modular arithmetic and Fourier series is distinct from prior approaches. The analytical framework is experimentally validated with a system of three parallel converters under time-varying operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting

Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.

Android security↗