Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Data parallelism”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Microbial sensor variation across biogeochemical conditions in the terrestrial deep subsurface

ABSTRACT Microbes can be found in abundance many kilometers underground. While microbial metabolic capabilities have been examined across different geochemical settings, it remains unclear how changes in subsurface niches affect microbial needs to sense and respond to their environment. To address this question, we examined how microbial extracellular sensor systems vary with environmental conditions across metagenomes at different Deep Mine Microbial Observatory (DeMMO) subsurface sites. Because two-component systems (TCSs) directly sense extracellular conditions and convert this information into intracellular biochemical responses, we expected that this sensor family would vary across isolated oligotrophic subterranean environments that differ in abiotic and biotic conditions. TCSs were found at all six subsurface sites, the service water control, and the surface site, with an average of 0.88 sensor histidine kinases (HKs) per 100 genes across all sites. Abundance was greater in subsurface fracture fluids compared with surface-derived fluids, and candidate phyla radiation (CPR) bacteria presented the lowest HK frequencies. Measures of microbial diversity, such as the Shannon diversity index, revealed that HK abundance is inversely correlated with microbial diversity ( r 2 = 0.81). Among the geochemical parameters measured, HK frequency correlated most strongly with variance in dissolved organic carbon ( r 2 = 0.82). Taken together, these results implicate the abiotic and biotic properties of an ecological niche as drivers of sensor needs, and they suggest that microbes in environments with large fluctuations in organic nutrients (e.g., lacustrine, terrestrial, and coastal ecosystems) may require greater TCS diversity than ecosystems with low nutrients (e.g., open ocean). IMPORTANCE The ability to detect extracellular environmental conditions is a fundamental property of all life forms. Because microbial two-component sensor systems convert information about extracellular conditions into biochemical information that controls their behaviors, we evaluated how two-component sensor systems evolved within the deep Earth across multiple sites where abiotic and biotic properties vary. We show that these sensor systems remain abundant in microbial consortia at all subterranean sampling sites and observe correlations between sensor system abundances and abiotic (dissolved organic carbon variation) and biotic (consortia diversity) properties. These results suggest that multiple environmental properties may drive sensor protein evolution and highlight the need for further studies of metagenomic and geochemical data in parallel to understand the drivers of microbial sensor evolution.

response regulator↗
DOE OSTI2021

DASSA v0.0.1

DASSA (Parallel DAS Data Storage and Analysis) provides a data storage engine and analysis engine for data from distributed acoustic sensing and other methods. It supports various data analysis operations, from FFT , signal filter, cross-correlation, compression, stacking etc.

Dong, Bin↗
DOE OSTI2020

DaCeML

Machine learning powered by data-centric parallel programming.

Rausch, Oliver↗
DOE OSTI2023

National Ignition Facility Opacity Time Resolved Spectrometer Systems Engineering Final Project

The National Ignition Facility (NIF) is the world’s largest and most energetic laser facility. The NIF system is designed to produce high energy density (temperature and pressure) conditions through the application of its 192 laser beams. One of the users of NIF is the opacity platform developed to study the opacities at temperatures and densities relevant to the solar interior and stellar evolution. The platform was developed to study iron (Fe) opacity at temperatures relevant to the solar interior. The opacity campaign uses spectrometers to gather data. Spectrometers utilize crystals to produce x-ray spectra that are recorded on time-integrated and time-resolved detectors. The opacity spectrometer (OpSpec) currently fielded and in use at NIF uses a time integrated film channel to collect data. The opacity spectrometer time resolved (OpSpecTR) will utilize novel hCMOS detectors to capture time resolved images of spectra of interest. The key stakeholders identified for OpSpecTR included the physicists responsible for OpSpec and OpSpecTR, the Target Area Science and Engineering (TASE) department at NIF, the NIF and Photon Science (NIF & PS) Opacity program, the Nevada National Security Site (NNSS) Physics and Engineering program, the Sandia hCMOS manufacturing and testing program, and the Los Alamos National Laboratory (LANL) program sponsor. The Target and Experimental Operations (TEXOPS) was identified as a key stakeholder because the group includes the individuals that will physically interact with the OpSpecTR system as it participates in NIF experiments. The opacity platform collects data in a unique orientation relative to the existing diagnostics fielded at NIF. The existing infrastructure at NIF uses a diagnostic manipulator (DIM) to insert the diagnostic near the target chamber center to collect data during a NIF shot. Existing diagnostics collect data through the center line of the DIM axis and collect relevant data perpendicular to this axis. The opacity platform requires crystals mounted in a specific orientation which requires data collection parallel to the DIM axis. This deviation from standard NIF practices was a key factor in developing requirements.

42 ENGINEERING↗
DOE OSTI2020

Advanced Laboratory and Field Arrays: Evaluating Sampling Techniques for MHK Biological Monitoring (Task 6)

The overall goal of the task was to identify cost effective biological sampling techniques for MHK environmental monitoring. Protected, demersal, and pelagic fish and selected nektonic invertebrates were surveyed using capture and remote sensing techniques at the PacWave sites. The performance of capture and remote sensing monitoring techniques were evaluated and generic nekton monitoring indices were developed for MHK technologies and sites. In parallel to data collections at the PacWave site, the ability of regression models to characterize, detect, and predict change in acoustic data was evaluated using acoustic data collected in Admiralty Inlet, WA, during a biological monitoring study of the proposed SnoPud tidal turbine project site. Expected outcomes of these efforts included an evaluation of instrumentation and techniques used to monitor biological variability; identification of data streams that can be used to detect and quantify change; and sampling requirements to ensure detection of change in monitored variables.

13 HYDRO ENERGY↗
DOE OSTI2026

rustpix

rustpix is a high-performance, open-source Rust library with first-class Python bindings (via PyO3) for processing pixel-detector data in neutron imaging. It targets time-stamping detectors such as Timepix3 (TPX3) at ORNL's Spallation Neutron Source (VENUS beamline), where each detected neutron deposits charge across a cluster of pixels within a very high-rate event stream (96M+ hits/sec). rustpix parses TPX3 event data in parallel using memory-mapped I/O, offers four interchangeable clustering algorithms (ABS adjacency-based search, DBSCAN, graph/union-find connected components, and a parallel grid method), and extracts weighted, super-resolved centroids to produce neutron-event lists. A streaming architecture lets it process files larger than available memory. rustpix is distributed as a pip-installable Python package (with NumPy integration), Rust crates, a command-line tool, and an interactive GUI; it writes HDF5, Apache Arrow, and CSV; and it is designed to extend to TPX4 and other detector types. Released as open-source under the MIT License.

Zhang, Chen [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2022

Systems and methods for tensor scheduling

A technique for efficient scheduling of operations in a program for parallelized execution thereof using a multi-processor runtime environment having two or more processors includes constraining the type or number of loop optimization transforms that may be explored such that memory and processing capacity available for the scheduling task are not exceeded, while facilitating a tradeoff between memory locality, parallelization, and/or data communication between memory modules of the multi-processor runtime environment.

Meister, Benoit J.↗
DOE OSTI2023

Generalizing mkFit and its Application to HL-LHC

mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both thread- and data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offline workflow of the CMS experiment. The CMS tracking performs a series of iterations, targeting reconstruction of tracks of increasing difficulty after removing hits associated to tracks found in previous iterations. mkFit has been adopted for several of the tracking iterations, which contribute to the majority of reconstructed tracks. When tested in the standard conditions for production jobs, speedups in track pattern recognition are on average of the order of 3.5x for the iterations where it is used (3-7x depending on the iteration). Multiple factors contribute to the observed speedups, including vectorization and a lightweight geometry description, as well as improved memory management and single precision. Efficient vectorization is achieved with both the icc and the gcc (default in CMSSW) compilers and relies on a dedicated library for small matrix operations, Matriplex, which has recently been released in a public repository. While the mkFit geometry description already featured levels of abstraction from the actual Phase-1 CMS tracker, several components of the implementations were still tied to that specific geometry. We have further generalized the geometry description and the configuration of the run-time parameters, in order to enable support for the Phase-2 upgraded tracker geometry for the HL-LHC and potentially other detector configurations. The implementation strategy and high-level code changes required for the HL-LHC geometry are presented. Speedups in track building from mkFit imply that track fitting becomes a comparably time consuming step of the tracking chain.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

HARMONY: Large-Scale Architecture Search for Efficient Hybrid Language Models

As large language models scale to trillions of parameters, their computational and memory requirements present critical challenges for efficient training and deployment. While Mixture of Experts (MoE) architectures enable efficient scaling through sparse parameter activation, and state-space models like Mamba offer linear-time complexity, principled methods for combining these paradigms remain undeveloped. We introduce HARMONY (Hybrid Architecture Research for Mamba, Optimized with Neural efficiencY), a multi-objective evolutionary neural architecture search framework for discovering efficient hybrid language models that integrate Transformer attention mechanisms, Mixture-of-Experts routing, and Mamba state-space components. Through large-scale distributed search using 16,384 MI250X GPUs on the Frontier supercomputer, HARMONY explores a comprehensive design space encompassing six attention variants (MHA, MQA, GQA, MLA, SWA, and Mamba-2), variable MoE configurations with both routed and shared experts, and extensive Mamba hyperparameters. Our framework discovers heterogeneous architectures that balance training performance with computational efficiency through multi-objective optimization incorporating latency penalties and fitness-based selection. Analysis of discovered architectures reveals that optimal hybrid designs favor heterogeneous component mixing rather than homogeneous patterns, with Mamba-2 and Multi-Head Latent Attention (MLA) emerging as preferred mechanisms. Discovered architectures demonstrate superior training efficiency: our best configuration achieves a final perplexity of 1.0874 with 2.38B parameters while processing 4,320 tokens/second, outperforming significantly larger manually designed models. Full-scale evaluation shows HARMONY's top architectures achieve better loss trajectories than equivalently-sized models using state-of-the-art configurations including Mixtral, Jamba, and Samba. Additionally, we demonstrate 91% weak scaling efficiency when training discovered 36B-parameter models across 1,024 GPUs. HARMONY is released as an open framework with comprehensive tools for building and training hybrid models using expert-data-pipeline parallelism, democratizing access to automated architecture design for next-generation language models.

Herron, Emily [ORNL] (ORCID:0000000273008172)↗
DOE OSTI2021

Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs

We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple events using nested OpenMP parallelism on CPU or CUDA streams on GPU. The new implementation along with earlier work in developing a parallelized and vectorized implementation of the combinatoric Kalman filter algorithm has enabled efficient global reconstruction of the entire event on modern computer architectures. We demonstrate the performance of the new implementation on Intel Xeon and NVIDIA GPU architectures.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Black-box statistical prediction of lossy compression ratios for scientific data

Lossy compressors are increasingly adopted in scientific research, tackling volumes of data from experiments or parallel numerical simulations and facilitating data storage and movement. In contrast with the notion of entropy in lossless compression, no theoretical or data-based quantification of lossy compressibility exists for scientific data. Users rely on trial and error to assess lossy compression performance. As a strong data-driven effort toward quantifying lossy compressibility of scientific datasets, we provide a statistical framework to predict compression ratios of lossy compressors. Our method is a two-step framework where (i) compressor-agnostic predictors are computed and (ii) statistical prediction models relying on these predictors are trained on observed compression ratios. Proposed predictors exploit spatial correlations and notions of entropy and lossyness via the quantized entropy. We study 8+ compressors on 6 scientific datasets and achieve a median percentage prediction error less than 12%, which is substantially smaller than that of other methods while achieving at least a 8.8× speedup for searching for a specific compression ratio and 7.8× speedup for determining the best compressor out of a collection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

FPGA-based computing system for processing data in size, weight, and power constrained environments

Technologies that are well-suited for use in size, weight, and power (SWAP)-constrained environments are described herein. A host controller dispatches data processing instructions to hardware acceleration engines (HAEs) of one or more field programmable gate arrays (FPGAs) and further dispatches data transfer instructions to a memory controller, such that the HAEs perform processing operations on data stored in local memory devices of the HAEs in parallel with other data being transferred from external memory devices coupled to the FPGA(s) to the local memory devices.

Napier, Matthew↗
DOE OSTI2024

Parallel IO Libraries for Managing HEP Experimental Data

The computing and storage requirements of the energy and intensity frontiers will grow significantly during the Run 4 & 5 and the HL-LHC era. Similarly, in the intensity frontier, with larger trig ger readouts during supernovae explosions, the Deep Underground Neutrino Experiment (DUNE) will have unique computing challenges that could be addressed by the use of parallel and accelerated dataprocessing capabilities. Most of the requirements of the energy and intensity frontier experiments rely on increasing the role of high performance computing (HPC) in the HEP community. In this presentation, we will describe our ongoing efforts that are focused on using HPC resources for the next generation HEP experiments. The HEPCCE (High Energy Physics-Center for Computational Excellence) IOS (Input/Output and Storage) group has been developing approaches to map HEP data to the HDF5 , an IO library optimized for the HPC platforms to store the intermediate HEP data. The complex HEP data products are serialized using ROOT to allow for experiment independent general mapping approaches of the HEP data to the HDF5 format. The mapping approaches can be optimized for high performance parallel IO. Similarly, simpler data can be directly mapped into the HDF5, which can also be suitable for offloading into the GPUs directly. We will present our works on both complex and simple data model models.

Bashyal, Amit↗