Search NASA⌕ Search

SEARCH · Search NASA

Results for “data parallel”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Detailed Chemical Abundances for a Benchmark Sample of M Dwarfs from the APOGEE Survey

Individual chemical abundances for 14 elements (C, O, Na, Mg, Al, Si, K, Ca, Ti, V, Cr, Mn, Fe, and Ni) are derived for a sample of M dwarfs using high-resolution, near-infrared H-band spectra from the Sloan Digital Sky Survey-IV/Apache Point Observatory Galactic Evolution Experiment (APOGEE) survey. The quantitative analysis included synthetic spectra computed with 1D LTE plane-parallel MARCS models using the APOGEE Data Release 17 line list to determine chemical abundances. The sample consists of 11 M dwarfs in binary systems with warmer FGK dwarf primaries and 10 measured interferometric angular diameters. To minimize atomic diffusion effects, [X/Fe] ratios are used to compare M dwarfs in binary systems and literature results for their warmer primary stars, indicating good agreement (<0.08 dex) for all studied elements. The mean abundance difference in primaries minus this work's M dwarfs is –0.05 ± 0.03 dex. It indicates that M dwarfs in binary systems are a reliable way to calibrate empirical relationships. A comparison with abundance, effective temperature, and surface gravity results from the APOGEE Stellar Parameter and Chemical Abundances Pipeline (ASPCAP) Data Release 16 finds a systematic offset of [M/H], T eff , log g = +0.21 dex, –50 K, and 0.30 dex, respectively, although ASPCAP [X/Fe] ratios are generally consistent with this study. The metallicities of the M dwarfs cover the range of [Fe/H] = –0.9 to +0.4 and are used to investigate Galactic chemical evolution via trends of [X/Fe] as a function of [Fe/H]. The behavior of the various elemental abundances [X/Fe] versus [Fe/H] agrees well with the corresponding trends derived from warmer FGK dwarfs, demonstrating that the APOGEE spectra can be used to examine Galactic chemical evolution using large samples of selected M dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Chandra Follow-up of the SDSS DR8 Redmapper Catalog Using the MATCha Pipeline

In order to place constraints on cosmology through optical surveys of galaxy clusters, one must first understand the properties of those clusters. To this end, we introduce the Mass Analysis Tool for Chandra (MATCha), a pipeline that uses a parallellized algorithm to analyze archival Chandra data. MATCha simultaneously calculates X-ray temperatures and luminosities and performs centering measurements for hundreds of potential galaxy clusters using archival X-ray exposures. We run MATCha on the redMaPPer SDSS DR8 cluster catalog and use MATCha's output X-ray temperatures and luminosities to analyze the galaxy cluster temperature–richness, luminosity–richness, luminosity–temperature, and temperature–luminosity scaling relations. We detect 447 clusters and determine 246 r 2500 temperatures across all redshifts. Within 0.1 < z < 0.35, we find that r 2500 T X scales with optical richness (λ) as $\mathrm{ln}\left(\tfrac{{k}_{B}{T}_{{\rm{X}}}}{1.0\,\mathrm{keV}}\right)=(0.52\pm 0.05)\mathrm{ln}\left(\tfrac{\lambda }{70}\right)+(1.85\pm 0.03)$ with an intrinsic scatter of $0.27\pm 0.02$ ($1\sigma $). We investigate the distribution of offsets between the X-ray center and redMaPPer center within 0.1 < z < 0.35, finding that 68%.3 ± 6.5% of clusters are well-centered. However, we find a broad tail of large offsets in this distribution, and we explore some of the causes of redMaPPer miscentering.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Real-time software upgrade

The various technologies presented herein relate to upgrading industrial control software in real-time. During utilization of a first software to control an industrial process, a determination can be made that the first software needs to be replaced (e.g., partially or entirely) owing to a newer version of software is ready to be deployed, a vulnerability in the first software has been determined, etc. Rather than closing the industrial process down while the first software is replaced, a second software can be deployed such that the first software and the second software are operating in parallel (e.g., receiving the same operational data, process states). When a critical point (upgrade location) in the first software has been reached, control of the industrial process can be switched to the second software, thereby enabling control of the industrial process to occur without having to temporarily cease operation and/or monitoring of the industrial process.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Uranium(VI) Sorption onto Montmorillonite Clay in the Presence of Ca2+/Calcite Impurities

The storage of nuclear waste creates a series of significant environmental risks. One attempt to minimize these potential impacts is the use of underground geological repositories, where waste containers are surrounded by geologic buffer materials creating an engineered barrier. One buffer material that has been of interest is bentonite, which is largely composed of montmorillonite clay. These barriers limit the mobility of radioactive contaminants, such as uranium(VI), into environmental systems based on contaminant sorption onto the clay material. System conditions, such as pH, the presence of mineral impurities such as calcite, and the concentrations of U(VI) and atmospheric CO2 also affect the sorption behavior of U(VI) onto these clay barriers. This study focuses on the effects of Ca2+ and calcite (CaCO3), a common impurity found in montmorillonite on the sorption behavior of U(VI). Computer simulations of the chemical solution species (chemical form) of U(VI), in the absence and presence of Ca2+/calcite impurities are performed in parallel with laboratory sorption experiments. Experimental data will be compared to modeling results to help obtain further insights regarding the impacts of Ca2+/calcite impurities on U(VI) solution speciation and sorption behavior onto montmorillonite.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Comparison of Hybrid K-Edge Densitometer (HKED) Performance Operating with the Canberra Lynx MCA and the Canberra ICB-NIM Electronics

From the 1991 until 2008 the Canberra Hybrid K-Edge Densitometer systems were provided with ICB-NIM (Integrated Control Bus – Nuclear Instrument Module) acquisition electronics. Newer electronics modules, such as the Lynx, were not supported under the VMS based operating system. The LYNX module was provided as the standard acquisition electronics following the release of the Windows based CHKED software. This report compares the electronics dead-time, gain shifts, detector resolution and measurement performance of the HKED system operated with the two types of acquisition modules. The comparison was performed using measurements obtained with the ORNL HKED system. The original intent of this study was to take advantage of both the timing and energy outputs from the HPGE detector to acquire data with both sets of electronics in parallel. Although this approach has been applied successfully with other systems, in this case we found the timing output produced a significant amount of noise such that a comparison between the electronics would be invalid. So the comparative measurements were performed sequentially. The ICB-NIM data was acquired over the course of 12 months with 255 measurements while the LYNX data was acquired over a period of 10 months with 75 measurements. To simplify the comparison, all data used in this study was acquired using the Canberra CHKED (V1.0) software package. The performance analysis was based primarily on the peak locations, peak widths and concentration values reported by the CHKED software. The raw spectra from the XRF measurements were also examined to extract additional 109Cd peak location and width data for the hybrid measurements (the standard hybrid report template does not report these values).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗
DOE OSTI2017

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗
DOE OSTI2021

Misuse Detection for a Generalized SFR Test Reactor

Sodium-cooled Fast Reactors (SFRs) present unique challenges for international safeguards. SFRs possess neutron physics characteristics that if configured appropriately could produce more fissile material than consumed. An adversary state may choose to build an SFR, justified by a lack of domestic natural uranium and limited access or interest to procuring uranium from international markets. Once constructed, the state may choose to misuse the SFR for the purpose of diverting fissile plutonium from declared operation. This work shows that a demonstration SFR does not need to be configured as a plutonium breeder to create one Significant Quantity (SQ) of plutonium in a short amount of time (e.g., one to few years). However, such an extreme case of misuse would change the core reactivity in such a way as to be easily indicated by deviations of control rod position compared to declared operation. In this work a contrived SFR demonstration reactor was modeled for the purpose of exploring proliferation scenarios and how such misuse could be detected using the SFR's Reactor Data Acquisition System (RDAS). Typically, the International Atomic Energy Agency (IAEA) does not have access to the control rod position, power, thermal, pressure sensing and indicating systems of nuclear power plants. However, this work shows that such data streams can be compared against a parallel detailed simulation model (a Digital Twin) to detect possible misuse.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2019

Towards Native Execution of Deep Learning on a Leadership-Class HPC System

Large parallel machines generally offer the best parallel performance with "native execution" that is achieved using codes developed with the optimized compilers, communication libraries, and runtimes offered on the machines. In this paper, we report and analyze performance results from native execution of deep learning on a leadership-class high-performance computing (HPC) system. Using our new code called DeepEx, we present a study of the parallel speed up and convergence rates of learning achieved with native parallel execution. In the trade-off between computational parallelism and synchronized convergence, we first focus on maximizing parallelism while still obtaining convergence. Scaling results are reported from execution on up to 15,000 GPUs using two scientific data sets from atom microscopy and protein folding applications, and also using the popular ImageNet data set. In terms of the traditional measure of parallel speed up, excellent scaling is observed up to 12,000 GPUs. Additionally, accounting for convergence rates of deep learning accuracy or error, a deep learning-specific metric called "learning speed up" is also tracked. The performance results indicate the need to evaluate parallel deep learning execution in terms of learning speed up, and point to additional directions for improved exploitation of high-end HPC systems.

Yoginath, Srikanth↗
DOE OSTI2016

Next Generation Protein Interactomes for Plant Systems Biology and Biomass Feedstock Research

Biofuel crop cultivation is a necessary step in heading towards a sustainable future, making their genomic studies a priority. While technology platforms that currently exist for studying non-model crop species, like switch-grass or sorghum, have yielded large quantities of genomic and expression data, still a large gap exists between molecular mechanism and phenotype. The aspect of molecular activity at the level of protein-protein interactions has recently begun to bridge this gap, providing a more global perspective. Interactome analysis has defined more specific functional roles of proteins based on their interaction partners, neighborhoods, and other network features, making it possible to distinguish unique modules of immune response to different plant pathogens(Jiang, Dong, and Zhang 2016). As we work towards cultivating heartier biofuel crops, interactome data will lead to uncovering crop-specific defense and development networks. However, the collection of protein interaction data has been limited to expensive, time-consuming, hard-to-scale assays that mostly require cloned ORF collections. For these reasons, we have successfully developed a highly scalable, economical, and sensitive yeast two-hybrid assay, ProCREate, that can be universally applied to generate proteome-wide primary interactome data. ProCREate enables en masse pooling and massively paralleled sequencing for the identification of interacting proteins by exploiting Cre-lox recombination. ProCREate can be used to screen ORF/cDNA libraries from feedstock plant tissues. The interactome data generated will yield deeper insight into many molecular processes and pathways that can be used to guide improvement of feedstock productivity and sustainability.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

SHAD: the Scalable High-performance Algorithms and Data-structures Library

The unprecedented amount of data that needs to be processed in emerging data analytics applications poses novel challenges to industry and academia. Scalability and high performance become more than a desirable feature because, due to the scale and the nature of the problems, they draw the line between what is achievable and what is unfeasible. In this paper, we propose SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD adopts a modular design that confines low level details and promotes reuse. SHAD's core is built on an Abstract Runtime Interface which enhances portability and identifies the minimal set of features of the underlying system required by the framework. The core library includes common data-structures such as: Array, Vector, Map and Set. These are designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries. We have validated and evaluated our design with a performance and scalability study of the core components of the library. We have validated the design flexibility by proposing a Graph Library as an example of SHAD extension, which implements two different graph data-structures; we evaluate their performance with a set of graph applications. Experimental results show that the approach is promising in terms of both performance and scalability. On a distributed system with 320 cores, SHAD Arrays are able to sustain a throughput of 65 billion operations per second, while SHAD Maps sustain 1 billion of operations per second. Algorithms implemented using the Graph Library exhibit performance and scalability comparable to a custom solution, but with smaller development effort.

Castellana, Vito G.↗
DOE OSTI2020

Stripmap SAR Data Collection Geometry on a Round Earth

A stripmap Synthetic Aperture Radar (SAR) image is a long SAR image along some centerline, and formed from multiple synthetic apertures. At issue is that the centerline in the image actually corresponds to an arc on a round earth, and multiple strategies exist for fitting the image centerline to the round earth. Some of those strategies involve Rhumb lines, great circle paths, and great ellipse paths. Some are better than others in polar regions. Notions of parallel flight paths for the radar during data collection also require careful consideration of the geometry of a round earth.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

IAEA Coordinated Research Project on HTGR Reactor Physics, Thermal-hydraulics and Depletion Uncertainty Analysis

The continued development of High Temperature Gas Cooled Reactors (HTGRs) requires verification of HTGR design and safety features with reliable high fidelity physics models and robust, efficient, and accurate codes. The predictive capability of coupled neutronics/thermal-hydraulics and depletion simulations for reactor design and safety analysis can be assessed with sensitivity analysis (SA) and uncertainty analysis (UA) methods. Uncertainty originates from errors in physical data, manufacturing uncertainties, modelling and computational algorithms. (The interested reader is referred to the large body of published SA and UA literature for a more complete overview of the various types of uncertainties, methodologies and results obtained). SA is helpful for ranking the various sources of uncertainty and error in the results of core analyses. SA and UA are required to address cost, safety, and licensing needs and should be applied to all aspects of reactor multi-physics simulation. SA and UA can guide experimental, modelling, and algorithm research and development. Current SA and UA rely either on derivative-based methods such as stochastic sampling methods or on generalized perturbation theory to obtain sensitivity coefficients. Neither approach addresses all needs. In order to benefit from recent advances in modelling and simulation and the availability of new covariance data (nuclear data uncertainties) extensive sensitivity and uncertainty studies are needed for quantification of the impact of different sources of uncertainties on the design and safety parameters of HTGRs. Only a parallel effort in advanced simulation and in nuclear data improvement will be able to provide designers with more robust and well validated calculation tools to meet design target accuracies. In February 2009, the Technical Working Group on Gas-Cooled Reactors (TWG-GCR) of the International Atomic Energy Agency (IAEA) recommended that the proposed Coordinated Research Program (CRP) on the HTGR Uncertainty Analysis in Modelling (UAM) be implemented. This CRP is a continuation of the previous IAEA and Organization for Economic Co-operation and Development (OECD)/Nuclear Energy Agency (NEA) international activities on Verification and Validation (V&V) of available analytical capabilities for HTGR simulation for design and safety evaluations. Within the framework of these activities different numerical and experimental benchmark problems were performed and insight was gained about specific physics phenomena and the adequacy of analysis methods.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Optimizing Management of Persistent Data Structures in High-Performance Analytics

Large-scale data analytics workflows ingest massive input data into various data structures, including graphs and key-value datastores. These data structures undergo multiple transformations and computations and are typically reused in incremental and iterative analytics workflows. Persisting in-memory views of these data structures enables reusing them beyond the scope of a single program run while avoiding repetitive raw data ingestion overheads. Memory-mapped I/O enables persisting in-memory data structures without data serialization and deserialization overheads. However, memory-mapped I/O lacks the key feature of persisting consistent snapshots of these data structures for incremental ingestion and processing. The obstacles to efficient virtual memory snapshots using memory-mapped I/O include background writebacks outside the application’s control, and the significantly high storage footprint of such snapshots. To address these limitations, we present Privateer, a memory and storage management tool that enables storage-efficient virtual memory snapshotting while also optimizing snapshot I/O performance. Here, we integrated Privateer into Metall, a state-of-the-art persistent memory allocator for C++, and the Lightning Memory-Mapped Database (LMDB), a widely-used key-value datastore in data analytics and machine learning. Privateer optimized application performance by 1.22× when storing data structure snapshots to node-local storage, and up to 16.7× when storing snapshots to a parallel file system. Privateer also optimizes storage efficiency of incremental data structure snapshots by up to 11× using data deduplication and compression.

Computer science↗
DOE OSTI2025

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗