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 1,063 records · Page 59

Load Forecasting Based Distribution System Network Reconfiguration -- A Distributed Data-Driven Approach

In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonconvexity of the three-phase balanced optimal power flow, a second-order cone program (SOCP) based approach is used to relax the optimal power flow problem. Then, the alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in distributed manner. Considering the limited number of the switches and the increasing computation capability, the proposed network reconfiguration is solved in a parallel way. The numerical results demonstrate the feasible and effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Multi-Model Adaptive Kalman Filtering Approach to Power System Dynamic State Estimation

Accurate information about dynamic states (such as rotor angle and speed of a synchronous machine) is important for monitoring and controlling power system rotor-angle stability. In this paper, a multi-model adaptive Kalman filtering (MMAKF) approach is proposed to accurately and robustly estimate power system dynamic states. This approach consists of three major steps: (i) multiple Kalman filtering approaches, i.e., the extended Kalman filter (EKF), unscented Kalman filter (UKF), ensemble Kalman filter (EnKF), and cubature Kalman filter (CKF), are run concurrently in parallel to estimate the dynamic states of a synchronous generator using phasor measurement unit data; (ii) probability indexes, which quantify the likelihood of each estimation model, are determined at each time step using hypothesis testing based on the measurement innovation; (iii) the a posteriori estimate of states is obtained using the best-fix approach. The two-area four-machine system is used to evaluate the effectiveness of the proposed MMAKF approach. It is shown through the Monte-Carlo method that the estimation accuracy and robustness of the proposed approach is better than those from any individual filtering algorithm.

multi-model adaptive Kalman Filtering, Power Syste↗

P4: Portable Parallel Processing Pipelines for Interactive Information Visualization

We present P4, an information visualization toolkit that combines declarative design specification and GPU computing for building high-performance interactive systems. Most of the existing information visualization toolkits do not harness the power of parallel processors in today's mainstream computers. P4 leverages GPU computing to accelerate both data processing and visualization rendering for interactive visualization applications. P4's programming interface offers a declarative visualization grammar for rapid specifications of data transformations, visual encodings, and interactions. By simplifying the development of GPU-accelerated visualization systems while supporting a high degree of flexibility and customization for design specification, P4 narrows the gap between expressiveness and scalability in information visualization toolkits. Through a range of examples and benchmark tests, we demonstrate that P4 provides high efficiency for creating interactive visualizations and offers drastic performance improvement over current state-of-the-art toolkits.

97 MATHEMATICS AND COMPUTING↗

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗

AMReX and pyAMReX: Looking beyond the exascale computing project

AMReX is a software framework for the development of block-structured mesh applications with adaptive mesh refinement (AMR). AMReX was initially developed and supported by the AMReX Co-Design Center as part of the U.S. DOE Exascale Computing Project (ECP), and is continuing to grow post-ECP. In addition to adding new functionality and performance improvements to the core AMReX framework, we have also developed a Python binding, pyAMReX, that provides a bridge between AMReX-based application codes and the data science ecosystem. pyAMReX provides zero-copy application GPU data access for AI/ML, in situ analysis and application coupling, and enables rapid, massively parallel prototyping. In this paper we review the overall functionality of AMReX and pyAMReX, focusing on new developments, new functionality, and optimizations of key operations. We also summarize capabilities of ECP projects that used AMReX and provide an overview of new, non-ECP applications.

Myers, Andrew↗

Oil and gas flow through fractures and along interfaces in well cement

A number of wells at the Strategic Petroleum Reserve (SPR) have shown sustained, positive pressure (referred to as sustained casing pressure or SCP) in the cemented annulus behind the production casing. To better understand how SCP may develop for SPR conditions, we conducted gas and oil flow tests on cement specimens with flaws including cement fractures and discrete interfaces along a cement-steel contact. Many specimens were tested initially with gas, followed by oil, and finally with gas again to identify how the fluid type may affect the flow through flaws in the well cement. Nitrogen was used as the gas, and silicone oil with properties similar to typical crude oil was used in most tests. One set of measurements were made with crude oil. Composite steel-cement specimen with corroded steel were also tested. For both gas and oil tests, the measured flow test data were used to interpret permeability and, assuming the cubic law for flow between parallel plates, the corresponding hydraulic aperture of the flaw. The hydraulic apertures for the flawed specimens ranged from about 20 to >100 μm, which corresponds to permeabilities of about 10 -14 to 10 -12 m 2 , respectively; these hydraulic apertures are consistent with the range of values interpreted from field measurements on leaky wells. Observed differences between the flow of gas and oil were attributed to a number of factors, including non-linear flow of gas, possible blocking of flow paths by solids within the crude oil, two-phase gas and oil flow and the presence of residual oil in the cement flaw. Furthermore, we determined that corroded steel itself is permeable. Using input values consistent with the gas and oil flow measurements, we conducted one-dimensional simulations of gas and oil flow through cemented annulus systems to investigate the role of flaw size and fluid type on the expected response (i.e., pressure build-up) in the annular cement.

02 PETROLEUM↗

A view into FleCSI [Slides]

FleCSI is largely based around sharing of memory spaces. FleCSI facilitates parallel execution and sharing of memory across memory spaces. Execute() transforms sender-side data structures into receiver-side data structures.

97 MATHEMATICS AND COMPUTING↗

Interagency Agreement No. DE-SC0006988 (Final Technical Report)

The overarching goal of this project was to advance understanding of deep convection updraft microphysics—the source of long-lived stratiform ice—by combining detailed mining of in situ and remote sensing data from the MC3E field campaign with detailed 3D simulations. The project began with parallel work, first strictly on the remote-sensing observation side via dedicated analysis of polarimetric radar signatures, which is a relatively new area, on the one hand. On the other hand, a more traditional but well-formulated preparation and comparison of detailed aerosol-aware simulations with in situ measurements was prepared. In the final phase of this work, these parallel elements were brought together into an integrated analysis of in situ and remote-sensing observations with model results. The project also supported team member involvement in collaborative activities.

54 ENVIRONMENTAL SCIENCES↗

Progress Report on Performance of A709 and G91 Steels in Sodium

Specimens in six different processing and heat treatment conditions of A709 H58776 were exposed to sodium at 550, 600, and 650°C, respectively for various exposure times. G91 base metal was tested in sodium at 550, 600, and 650°C, and G91 weldment at 550 and 600°C, respectively. Parallel thermal aging experiments were conducted on G91 and A709 to obtain thermal aging data for comparison with sodium exposure results to separate the thermal and sodium effects. The corrosion data obtained on A709 steel continue to show low corrosion rates, which indicate good compatibility of A709 with sodium when oxygen content is controlled. G91 has also shown acceptable corrosion rates over the temperature range of 550-650°C in sodium. Thermal aging or sodium exposures reduced the tensile strength, uniform elongation, and total elongation for A709 ESR, AOD specimens. These specimens consistently showed higher yield stress and tensile strength and lower uniform and total elongations after sodium exposure than after thermal aging under comparable testing conditions. It implies that there was an additional effect of sodium exposure that gave rise to an increase in tensile strength of A709. Dynamic strain aginginduced flow serrations were completely removed by either thermal aging or sodium exposure at 650°C, which imply that carbon or nitrogen in solution was removed from the solution and formed precipitates during aging or sodium exposures. The tensile data ruled out the possibility of decarburization under the sodium exposure conditions. The HOMO specimens behaved somewhat differently from the ESR and AOD specimens in sodium. While thermal aging and sodium exposures at 550 and 600°C decreased the yield stress and the ultimate tensile strength of G91, there was virtually no additional effect resulting from sodium exposures at these two temperatures. In contrast, sodium exposures at 650°C had a drastic effect on the yield stress and the ultimate tensile strength of G91. It is suggested that G91 experienced decarburization in the 650°C sodium environments. Carbon concentrations in sodium in the SMT-1 and SMT-2 loops were determined by a foil equilibration method. The estimated carbon concentration was in the range of 0.8-1.2 ppm in the SMT-1 loop and 0.3-0.7 ppm in the SMT-2 loop. The carbon activity in sodium in the SMT-2 loop was estimated to be 0.03-0.08 at 600°C, and 0.08-0.2 at 550°C. The carbon activity in sodium at 650°C in the SMT-1 loop was 0.04-0.07. Equilibrium simulation of the carburization – decarburization processes was conducted for A709 and G91 steels exposed in sodium environments at temperatures of 550-700°C. The carbon activity-concentration relationship for G91 was re-evaluated by considering four phases in G91, i.e. bcc ferrite, M 23 C 6 , NbC and VC carbides. It was found that the carburization-decarburization process in G91 steel was dictated by M 23 C 6 carbides at high carbon activities, while NbC carbides dominated the process at low carbon activities. Formation of NbC increases the decarburization resistance of G91 steel. It remains to be understood whether the decarburization resistance provided by MC carbides in G91 can be maintained during long-term operations of SFRs. The carbon concentration-activity relationship for A709 was calculated based on the equilibrium of fcc-austenite and M 23 C 6 carbide phase. The calculations showed that A709 decarburizes at 650°C in the SMT-1 loop environments, which is different from the experimental findings. The carbon concentration-activity relationship in A709 was further evaluated by considering four phases, including fcc-austenite, M 23 C 6 , NbC, and TiC carbide phases. TiC is the most stable carbides among the three carbide phases. The carburization-decarburization process in A709 is dictated by M 23 C 6 carbides at high carbon activities and by TiC at low carbon activities. Formation of TiC increases the decarburization resistance of A709 steel. Because of the complexity of the precipitation process in A709 during sodium exposures, detailed characterization of precipitates in sodium-exposed specimens and improved thermodynamic models are needed to understand the carburization-decarburization behavior of A709. Kinetic analysis of carbon transfer will be investigated for G91 and A709 in future work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

2011.5 Revision of the Evaluated Nuclear Data Library: ENDL2011.5 (legacy and GNDS), and ENDL2011.5-direct

LLNL’s Nuclear Data and Theory Group has created the 2011.5 revised release of the Evaluated Nuclear Data Library (ENDL2011.5). ENDL2011.5 is designed to support LLNL’s current and future nuclear data needs and will be employed in nuclear reactor, nuclear security and stockpile stewardship simulations with ASC codes. This database is currently the most complete nuclear database for Monte Carlo and deterministic transport of neutrons and charged particles. This library was assembled with strong support from the ASC PEM and Attribution programs, leveraged with support from Campaign 4 and the DOE/Office of Science’s US Nuclear Data Program. This document lists the revisions made in ENDL2011.5 compared with the data existing in the original ENDL2011.2 and ENDL2011.3 releases. These changes are made in parallel with some similar revisions for ENDL2009.5. We also describe ENDL2011.5-direct that directly uses ENDF sources wherever possible.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PyFLEXTRKR: a flexible feature tracking Python software for convective cloud analysis

Abstract. This paper describes the new open-source framework PyFLEXTRKR (Python FLEXible object TRacKeR), a flexible atmospheric feature tracking software package with specific capabilities to track convective clouds from a variety of observations and model simulations. This software can track any atmospheric 2D objects and handle merging and splitting explicitly. The package has a collection of multi-object identification algorithms, scalable parallelization options, and has been optimized for large datasets including global high-resolution data. We demonstrate applications of PyFLEXTRKR on tracking individual deep convective cells and mesoscale convective systems from observations and model simulations ranging from large-eddy resolving (∼100s m) to mesoscale (∼10s km) resolutions. Visualization, post-processing, and statistical analysis tools are included in the package. New Lagrangian analyses of convective clouds produced by PyFLEXTRKR applicable to a wide range of datasets and scales facilitate advanced model evaluation and development efforts as well as scientific discovery.

54 ENVIRONMENTAL SCIENCES↗

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗

Programming with BIG data in R: Scaling analytics from one to thousands of nodes

Here, we present a tutorial overview showing how one can achieve scalable performance with R. We do so by utilizing several package extensions, including those from the pbdR project. These packages consist of high performance, high-level interfaces to and extensions of MPI, PBLAS, ScaLAPACK, I/O libraries, profiling libraries, and more. While these libraries shine brightest on large distributed platforms, they also work rather well on small clusters and often, surprisingly, even on a laptop with only two cores. Our tutorial begins with recommendations on how to get more performance out of your R code before considering parallel implementations. Because R is a high-level language, a function can have a deep hierarchy of operations. For big data, this can easily lead to inefficiency. Profiling is an important tool to understand the performance of an R code for both serial and parallel improvements.

97 MATHEMATICS AND COMPUTING↗

The Profiled Feldman-Cousins Method for Confidence Interval Construction for the Nova 3-Flavor Oscillation Analysis

The small interaction cross-section of neutrinos makes experimental neutrino physics particularly responsive to technological advancements. A significant development leveraged by the NOvA experiment is large-scale parallel processing, enabling novel computational approaches to longstanding experimental challenges. Central to managing the resulting high-throughput data is NOvA’s implementation of the Freight Train model, designed for efficient data production and handling.This dissertation details the methodology and execution of the NOvA 2024 3-Flavor Oscillation Analysis, supported by a comprehensive dataset spanning ten years. It emphasizes frequentist results refined through the Feldman-Cousins (FC) technique, specifically addressing confidence interval corrections in parameter estimation. The computational intensity associated with Feldman-Cousins arises from extensive Monte Carlo simulations, which were substantially mitigated through parallel computing on the Perlmutter supercomputer at the National Energy Research Scientific Computing Center (NERSC), employing the MPI framework.To further enhance computational efficiency, an Importance Sampling method is introduced and evaluated, demonstrating significant potential to reduce complexity, particularly in exploring extreme parameter space regions. This thesis presents both the successful application of advanced computational resources and the development of sophisticated statistical techniques, aiming to enhance the precision and scope of neutrino oscillation analyses.

Dye ajdye11190@gmail.com, Andrew Joseph [Mississip↗

FastProNGS: fast preprocessing of next-generation sequencing reads

Background Next-generation sequencing technology is developing rapidly and the vast amount of data that is generated needs to be preprocessed for downstream analyses. Yet, until now, software that can efficiently make all the quality assessments and filtration of raw data is still lacking. Results We developed FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest. Read information before and after filtration can be output in plain-text, JSON, or HTML formats with user-friendly visualization. Conclusions FastProNGS is a rapid, standardized, and user-friendly tool for preprocessing next-generation sequencing data within minutes. It is an all-in-one software that is convenient for bulk data analysis. It is additionally very flexible and can implement different functions using different user-set parameter combinations.

97 MATHEMATICS AND COMPUTING↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗

Comparison of Distributive Consensus Algorithms for AnomalyDetection on the Power-Grid

As an increasing number of devices in the power-grid rely on high-precision clocks to measure electrical properties and time stamp data, GPS receivers have become a vulnerability on the power-grid. GPS spoofing attacks, in which a fake signal is transmitted, can cause sensor measurement errors that can misinform protective equipment and grid operators for both the transmission and distribution grid. The technology being developed to secure precision clocks in the transmission grid are not appropriate for the distribution grid. Thus, there is a need to developed anomaly detection algorithms that are suitable for the hardware available on the distribution grid. Traditionally, a distributed detection framework is comprised of spatially distributed nodes which acquire observations about a quantity of interest and sends the data to the fusion center, where a global decision is made. Instead the distribution grid has low-power devices, such as smart inverters and microPMUs, that could be used to perform highly parallelized calculations. Having on node calculations is beneficial since it is more network and computation efficient, as the more calculations can be performed where the data is being captured instead of communicating across a slow network to a centralized fusion center. Instead, we could employ an alternate peer-to-peer type of information exchange on the distribution grid that can still reach a global decision. A decentralized approach to anomaly detection makes efficient use of the computational and network bandwidth that exists, and it also lacks the single point of failure of a centralized approach. Thus, a decentralized local information exchange and/or inference is preferred. Lastly, the unreliability of the distribution grid network connections and potential noise or error in the measurements must be considered. In order to produce an effective detection tool, a Byzantine-fault tolerant and asynchronous algorithm must be developed. Thus, the first phase of our project is to develop a distributed, decentralized, asynchronous, Byzantine-fault tolerant, collaborative autonomy-based anomaly detection algorithm to collectively analyze clusters of data for signs of a malicious attack.

97 MATHEMATICS AND COMPUTING↗

Investigating the impacts of solid phase extraction on dissolved organic matter optical signatures and the pairing with high‐resolution mass spectrometry data across a freshwater stream network

Abstract Advancing our understanding of dissolved organic matter (DOM) chemistry in aquatic systems necessitates the integration of data streams from multiple analytical platforms. Some measurements require pretreatment with solid phase extraction (SPE), while others are performed directly on whole water samples. Evidence has suggested that SPE will be biased against select DOM fractions, leading to concerns over the ability to establish data linkages across platforms with variable needs for SPE pretreatment, such as those from optical measurements and those that provide high‐resolution molecular information. Here, we directly addressed this concern by assessing the impact of SPE on DOM optical properties through excitation–emission matrices with parallel factor analysis (PARAFAC) for 47 samples across a stream network within a single watershed reflective of variable DOM sources. PARAFAC data was further paired with molecular information obtained by Fourier transform ion cyclotron resonance mass spectrometry (FTICR‐MS). A comparison of PARAFAC models first revealed no systematic qualitative differences in major components between whole water DOM and DOM isolated by SPE (SPE‐DOM); however, quantitative biases against select components were observed. Further linkages with FTICR‐MS data revealed that the molecular fingerprint associated with each PARAFAC component was consistent between the whole water DOM and SPE‐DOM. Our results suggest that bulk scale linkages across these analytical platforms could be inferred irrespective of the observed quantitative biases resulting from SPE for samples within this example watershed. This work represents a key step toward the systematic evaluation of linkages between optical and high‐resolution mass spectrometry datasets in freshwater lotic environments.

59 BASIC BIOLOGICAL SCIENCES↗