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,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Distributed memory parallel Markov random fields using graph partitioning

Markov random fields (MRF) based algorithms have attracted a large amount of interest in image analysis due to their ability to exploit contextual information about data. Image data generated by experimental facilities, though, continues to grow larger and more complex, making it more difficult to analyze in a reasonable amount of time. Applying image processing algorithms to large datasets requires alternative approaches to circumvent performance problems. Aiming to provide scientists with a new tool to recover valuable information from such datasets, we developed a general purpose distributed memory parallel MRF-based image analysis framework (MPI-PMRF). MPI-PMRF overcomes performance and memory limitations by distributing data and computations across processors. The proposed approach was successfully tested with synthetic and experimental datasets. Additionally, the performance of the MPI-PMRF framework is analyzed through a detailed scalability study. We show that a performance increase is obtained while maintaining an accuracy of the segmentation results higher than 98%. The contributions of this paper are: (a) development of a distributed memory MRF framework; (b) measurement of the performance increase of the proposed approach; (c) verification of segmentation accuracy in both synthetic and experimental, real-world datasets

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗
DOE OSTI2021

Observational Capabilities to Capture Water Cycle Event Dynamics and Impacts in the Age of AI

This whitepaper is responsive to focal area (1) Data acquisition and assimilation enabled by machine learning (ML), Artificial Intelligence (AI), and advanced methods. Here we describe how Earth observations specific to water cycle disturbances can be collected in parallel with and integrated into future model development, and make use of the latest technologies other than AI/ ML such as 5G/satellite, edge computing, big data technologies, and cloud computing.

58 GEOSCIENCES↗
DOE OSTI2020

Parallel Particle Advection Bake-Off for Scientific Visualization Workloads

There are multiple algorithms for parallelizing particle advection for scientific visualization workloads. While many previous studies have contributed to the understanding of individual algorithms, our study aims to provide a holistic understanding of how algorithms perform relative to each other on various workloads. To accomplish this, we consider four popular parallelization algorithms and run a “bake-off” study (i.e., an empirical study) to identify the best matches for each. The study includes 216 tests, going to a concurrency of up to 8192 cores and considering data sets as large as 34 billion cells with 300 million particles. Overall, our study informs three important research questions: (1) which parallelization algorithms perform best for a given workload?, (2) why?, and (3) what are the unsolved problems in parallel particle advection? In terms of findings, we find that the seeding box is the most important factor in choosing the best algorithm, and also that there is a significant opportunity for improvement in execution time, scalability, and efficiency.

Pugmire, Dave↗
DOE OSTI2021

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗
DOE OSTI2026

Investigation and Diagnosis of Faulty Data Channels in CMS Outer Tracker Module Testing

The High-Luminosity Large Hadron Collider (HL-LHC) is currently undergoing upgrades to improve its luminosity. In parallel, this requires an upgrade to the Compact Muon Solenoid (CMS)’s Outer Tracker, consisting of Pixel-Strip (PS) and Strip-Strip (2S) modules that can accurately track the path of charged particles originating from the collisions. It follows that such complex modules call for extensive testing, requiring a sophisticated Data Acquisition (DAQ) system that can perform specific tests to assess their performance. In addition, errors caused by the hardware of a given testing station, and its associated data channel, need to be accurately identified to guarantee proper testing of modules. We have developed a software extension to the Phase-II Outer Tracker Analyzer of Test Outputs (POTATO), which is a specialized software designed to analyze and grade all of the module tests through a centralized database. This extension categorizes and analyzes module test results by its station and data channel. Its analysis can be used to identify trends in grading that indicate issues in these channels’ grading process rather than in the individual modules. This poster shows our methodology and results for identifying faulty data channels. Using this extension, we can quickly diagnose and address problems in our DAQ system, ensuring proper evaluation corrections for each module.

Chen, Angus [Fermilab]↗
DOE OSTI2026

Investigation and Diagnosis of Faulty Data Channels in CMS Outer Tracker Module Testing

The High-Luminosity Large Hadron Collider (HL-LHC) is currently undergoing upgrades to improve its luminosity. In parallel, this requires an upgrade to the Compact Muon Solenoid (CMS)’s Outer Tracker, consisting of Pixel-Strip (PS) and Strip-Strip (2S) modules that can accurately track the path of charged particles originating from the collisions. It follows that such complex modules call for extensive testing, requiring a sophisticated Data Acquisition (DAQ) system that can perform specific tests to assess their performance. In addition, errors caused by the hardware of a given testing station, and its associated data channel, need to be accurately identified to guarantee proper testing of modules. We have developed a software extension to the Phase-II Outer Tracker Analyzer of Test Outputs (POTATO), which is a specialized software designed to analyze and grade all of the module tests through a centralized database. This extension categorizes and analyzes module test results by its station and data channel. Its analysis can be used to identify trends in grading that indicate issues in these channels’ grading process rather than in the individual modules. This poster shows our methodology and results for identifying faulty data channels. Using this extension, we can quickly diagnose and address problems in our DAQ system, ensuring proper evaluation corrections for each module.

Chen, Angus [Fermilab]↗
DOE OSTI2016

Dragonfly : an implementation of the expand–maximize–compress algorithm for single-particle imaging

Single-particle imaging (SPI) with X-ray free-electron lasers has the potential to change fundamentally how biomacromolecules are imaged. The structure would be derived from millions of diffraction patterns, each from a different copy of the macromolecule before it is torn apart by radiation damage. The challenges posed by the resultant data stream are staggering: millions of incomplete, noisy and un-oriented patterns have to be computationally assembled into a three-dimensional intensity map and then phase reconstructed. In this paper, the Dragonfly software package is described, based on a parallel implementation of the expand–maximize–compress reconstruction algorithm that is well suited for this task. Auxiliary modules to simulate SPI data streams are also included to assess the feasibility of proposed SPI experiments at the Linac Coherent Light Source, Stanford, California, USA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Estimating Lossy Compressibility of Scientific Data Using Deep Neural Networks

Simulation based scientific applications generate increasingly large amounts of data on high-performance computing (HPC) systems. To allow data to be stored and analyzed efficiently, data compression is often utilized to reduce the volume and velocity of data. However, a question often raised by domain scientists is the level of compression that can be expected so that they can make more informed decisions, balancing between accuracy and performance. In this letter, we propose a deep neural network based approach for estimating the compressibility of scientific data. To train the neural network, we build both general features as well as compressor-specific features so that the characteristics of both data and lossy compressors are captured in training. Our approach is demonstrated to outperform a prior analytical model as well as a sampling based approach in the case of a biased estimation, i.e., for SZ. However, for the unbiased estimation (i.e., ZFP), the sampling based approach yields the best accuracy, despite the high overhead involved in sampling the target dataset.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Study of Electromagnetic Electron Cyclotron Waves for Kappa Distribution with AC Field in the Magnetosphere of Saturn

Parallel propagating electromagnetic electron cyclotron (EMEC) waves in the extended plasma sheet (~12R{sub S}) and in the outer magnetosphere (~18R{sub S}) of Saturn have been studied. A dispersion relation for parallel propagating relativistic EMEC waves has been applied to the magnetosphere of Saturn, and comparisons have been made with the data of Voyager 1 at these radial distances. The detailed investigations for EMEC waves have been done in the presence of the perpendicular AC electric field, using the kappa distribution function. The relativistic temporal growth rate is calculated by the method of characteristic solution with the data provided by Voyager 1. The effect of the suprathermal electron density, temperature anisotropy, frequency of AC electric field, thermal energy of ions, and relativistic factor on the temporal growth rate of EMEC wave emission has been studied. The simulation results show that the growth of parallel propagating EMEC waves is significantly affected by variations in the temperature anisotropy, electron density, ion thermal energy, and relativistic factor in both the extended plasma sheet and the outer magnetosphere of Saturn. The temperature anisotropy (T⊥/T{sub ║}), ion thermal energy (K{sub B}T{sub ║i}), and electron density (n{sub 0}) have been found to be a major source of free energy for parallel propagating EMEC waves in both regions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Evaluation of Visualization Heuristics

Heuristics have been used since the early 1990's in the Human Computer Interaction (HCI) domain, for evaluating user interfaces. Most notably, heuristics developed by Nielsen and Molich (1990) have been used by the HCI community. Forsell and Johansson (2010) used the same methodology as Nielsen and Molich and developed a set of 10 heuristics for information visualization. Currently, neither the information visualization or the visual analytics community has adopted these heuristics. However, several studies have been conducted using heuristics. Hearst et al. (2015) found that using the heuristics for visualizations along with asking questions about the data resulted in complementary results as the questions about the data could compensate for heuristics that were difficult to understand and apply. Heli Väätäjä et al. (2016) found that heuristics related to interaction, veracity, and aesthetics needed to be added to the Forsell and Johansson (2010) set. They also noted that a lack of domain knowledge caused the evaluators issues in conducting a heuristic evaluation. We conducted a controlled experiment to determine what factors might impact the expert evaluators' capability to conduct a heuristic evaluation of a static information visualization. In particular, we wanted to understand how their familiarity with the visualizations and their experience in conducting heuristic evaluations impacted their evaluations of visualizations. We recruited 10 participants who were domain experts in the visualization field each having experience with one of more of the following: user experience design or research, user interface development, and human computer interaction research. We used a heuristic set proposed by Forsell and Johansson. Participants were also asked to complete a demographic survey in which they rated their experience with each visualization type generally, their experience conducting heuristic evaluations, their experience using each visualization type to extract information, and their experience developing and creating each visualization type. The participants were shown a series of 5 common visualizations (Scatterplots, Sunbursts, Tree Maps, Parallel Sets, and Area Graphs) all displaying the VAST 2008 Mini Challenge Two- Migrant Boats data . Participants were given a suggested analytical question related to each visualization to keep in mind as they applied the 10 heuristics to each visualization. They were asked if they could find any usability problems in the visualizations and which heuristic(s) helped them to identify these problems. The participants were asked to rate how relevant each heuristic was for evaluating each visualization along with rating how confident they felt in their ability to apply the heuristic to evaluate each visualization. At the conclusion of the study, participants provided qualitative feedback on the usability issues of each visualization. Additionally, we collected eye tracking data on 6 of the 10 participants. We will be using this data to determine how long participants looked at the various visualizations and what parts of the visualizations they focused on. We had two hypotheses for this empirical evaluation: 1.The Forsell and Johansson heuristics of Orientation and help, Data set reduction, and Prompting are less useful for static visualizations because they require some interaction in order to test completely. 2.Participants that do not have experience with heuristic evaluation will provide lower evaluation scores for the heuristics compared to those that have experience. Related to hypothesis 1, as our study used only static visualizations, interaction-related usability challenges should be harder to identify. This should result in lower usefulness ratings for those heuristics. Preliminary results indicate that participants found it more difficult to apply heuristics to unfamiliar visualizations.

Williams, Ryan G.↗
DOE OSTI2019

A nonlinear data-driven reduced order model for computational homogenization with physics/pattern-guided sampling

Developing an accurate nonlinear reduced order model from simulation data has been an outstanding research topic for many years. For many physical systems, data collection is very expensive and the optimal data distribution is not known in advance. Thus, maximizing the information gain remains a grand challenge. In a recent paper, Bhattacharjee and Matouš (2016) proposed a manifold-based nonlinear reduced order model for multiscale problems in mechanics of materials. Expanding this work here, we develop a novel sampling strategy based on the physics/pattern-guided data distribution. Our adaptive sampling strategy relies on enrichment of sub-manifolds based on the principal stretches and rotational sensitivity analysis. This novel sampling strategy substantially decreases the number of snapshots needed for accurate reduced order model construction (i.e., ~5 x reduction of snapshots over Bhattacharjee and Matouš (2016)). Moreover, we build the nonlinear manifold using the displacement rather than deformation gradient data. We provide rigorous verification and error assessment. We demonstrate both localization and homogenization of the multiscale solution on a large particulate composite unit cell.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GPU Acceleration of Large-Scale Full-Frequency GW Calculations

Many-body perturbation theory is a powerful method to simulate electronic excitations in molecules and materials starting from the output of density functional theory calculations. By implementing the theory efficiently so as to run at scale on the latest leadership high-performance computing systems it is possible to extend the scope of GW calculations. Here, we present a GPU acceleration study of the full-frequency GW method as implemented in the WEST code. Excellent performance is achieved through the use of (i) optimized GPU libraries, e.g., cuFFT and cuBLAS, (ii) a hierarchical parallelization strategy that minimizes CPU-CPU, CPU-GPU, and GPU-GPU data transfer operations, (iii) nonblocking MPI communications that overlap with GPU computations, and (iv) mixed precision in selected portions of the code. A series of performance benchmarks has been carried out on leadership high-performance computing systems, showing a substantial speedup of the GPU-accelerated version of WEST with respect to its CPU version. Good strong and weak scaling is demonstrated using up to 25 920 GPUs. Finally, we showcase the capability of the GPU version of WEST for large-scale, full-frequency GW calculations of realistic systems, e.g., a nanostructure, an interface, and a defect, comprising up to 10 368 valence electrons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

A planar-sheet nongraphitic zero-bandgap sp 2 carbon phase made by the low-temperature reaction of γ-graphyne

The highest sheet symmetry form of graphyne, with one triple bond between each neighboring hexagon in graphene, irreversibly transforms exothermically at ambient pressure and low temperatures into a nongraphitic, planar-sheet, zero-bandgap phase consisting of intrasheet-bonded sp 2 carbons. The synthesis of this sp 2 carbon phase is demonstrated, and other carbon phases are described for possible future synthesis from graphyne without breaking graphyne bonds. While measurements and theory indicate that the reacting graphyne becomes nonplanar because of sheet wrinkling produced by dimensional mismatch between reacted and nonreacted sheet regions, sheet planarity is regained when the reaction is complete. Although the observed elimination of triple bonds to make parallel planar sp 2 carbon sheets likely requires ordered transformation within each sheet, diffraction data for reacted multisheet stacks indicate that the relative lateral positions of neighboring sheets are disordered, as predicted, since no crystalline diffraction peak (other than for the intersheet spacing) is observed.

Aliev, Ali E. (ORCID:0000000300349707)↗
DOE OSTI2015

Integration of PanDA workload management system with Titan supercomputer at OLCF

The PanDA (Production and Distributed Analysis) workload management system (WMS) was developed to meet the scale and complexity of LHC distributed computing for the ATLAS experiment. While PanDA currently distributes jobs to more than 100,000 cores at well over 100 Grid sites, the future LHC data taking runs will require more resources than Grid computing can possibly provide. To alleviate these challenges, ATLAS is engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with Titan supercomputer at Oak Ridge Leadership Computing Facility (OLCF). The current approach utilizes a modified PanDA pilot framework for job submission to Titan’s batch queues and local data management, with light-weight MPI wrappers to run single threaded workloads in parallel on Titan’s multi-core worker nodes. It also gives PanDA new capability to collect, in real time, information about unused worker nodes on Titan, which allows precise definition of the size and duration of jobs submitted to Titan according to available free resources. This capability significantly reduces PanDA job wait time while improving Titan’s utilization efficiency. This implementation was tested with a variety of Monte-Carlo workloads on Titan and is being tested on several other supercomputing platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Phyllosphere exudates select for distinct microbiome members in sorghum epicuticular wax and aerial root mucilage

Phyllosphere exudates create specialized microhabitats that shape microbial community diversity. We explored the microbiome associated with two sorghum phyllosphere exudates, the epicuticular wax and aerial root mucilage. We assessed the microbiome associated with the wax from sorghum plants over two growth stages, and the root mucilage additionally from nitrogen-fertilized and non-fertilized plants. In parallel, we isolated and characterized hundreds of bacteria from wax and mucilage, and integrated data from cultivation-independent and cultivation-dependent approaches to gain insights into exudate diversity and bacterial phenotypes. We found that Sphingomonadaceae and Rhizobiaceae families were the major taxa in the wax regardless of water availability and plant developmental stage to plants. The cultivation-independent mucilage-associated bacterial microbiome contained Erwiniaceae, Flavobacteriaceae, Rhizobiaceae, Pseudomonadaceae, Sphingomonadaceae, and its structure was strongly influenced by sorghum development but only modestly influenced by fertilization. In contrast, the fungal community structure of mucilage was strongly affected by the year of sampling but not by fertilization or plant developmental stage, suggesting a decoupling of fungal-bacterial dynamics in the mucilage. Our bacterial isolate collection from wax and mucilage had several isolates that matched 100% to detected amplicon sequence variants, and were enriched on media that selected for phenotypes including phosphate solubilization, putative diazotrophy, resistance to desiccation, capability to grow on methanol as a carbon source, and ability to grow in the presence of linalool and β-caryophyllene (terpenes in sorghum wax). This work expands our understanding of the microbiome of phyllosphere exudates and supports our long-term goal to translate microbiome research to support sorghum cultivation.

59 BASIC BIOLOGICAL SCIENCES↗