SEARCH · Search NASA

Results for “compression algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

DOE OSTI2021

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗

DOE OSTI2021

Optimizing Error-Bounded Lossy Compression for Scientific Data on GPUs

Error-bounded lossy compression is a critical technique for significantly reducing scientific data volumes. With ever-emerging heterogeneous high-performance computing (HPC) architecture, GPU-accelerated error-bounded compressors (such as CUSZ and cuZFP) have been developed. However, they suffer from either low performance or low compression ratios. To this end, we propose CUSZ+ to target both high compression ratios and throughputs. We identify that data sparsity and data smoothness are key factors for high compression throughputs. Our key contributions in this work are fourfold: (1) We propose an efficient compression workflow to adaptively perform run-length encoding and/or variable-length encoding. (2) We derive Lorenzo reconstruction in decompression as multidimensional partial-sum computation and propose a fine-grained Lorenzo reconstruction algorithm for GPU architectures. (3) We carefully optimize each of CUSZ kernels by leveraging state-of-the-art CUDA parallel primitives. (4) We evaluate CUSZ+ using seven real-world HPC application datasets on V100 and A100 GPUs. Experiments show CUSZ+ improves the compression throughputs and ratios by up to 18.4x and 5.3x, respectively, over CUSZ on the tested datasets.

Tian, Jiannan↗

DOE OSTI2023

TDD LoRa and Delta Encoding in Low-Power Networks of Environmental Sensor Arrays for Temperature and Deformation Monitoring

Abstract Densely distributed sensor networks can revolutionize environmental observations by providing real-time data with an unprecedented spatiotemporal resolution. However, field deployments often pose unique challenges in terms of power provisions and wireless connectivity. We present a framework for wirelessly connected distributed sensor arrays for near-surface temperature and/or deformation monitoring. Our research focuses on a novel time division duplex implementation of the LoRa protocol, enabling battery powered base stations and avoiding collisions within the network. In order to minimize transmissions and improve battery life throughout the network, we propose a dedicated delta encoding algorithm that utilizes the spatial and temporal similarity in the acquired data sets. We implemented the developed technologies in a AA battery powered hardware platform that can be used as a wireless data logger or base station, and we conducted an assessment of the power consumption. Without data compression, the projected battery life for a data logger is 4.74 years, and a wireless base stations can last several weeks or months depending on the amount of network traffic. The delta encoding algorithm can further improve this battery life with a factor of up to 3.50. Our results demonstrate the viability of the proposed methods for low-power environmental wireless sensor networks.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2023

Differentiable Earth mover’s distance for data compression at the high-luminosity LHC

Abstract The Earth mover’s distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms via gradient descent. In this paper, we train a convolutional neural network (CNN) to learn a differentiable, fast approximation of the EMD and demonstrate that it can be used as a substitute for computing-intensive EMD implementations. We apply this differentiable approximation in the training of an autoencoder-inspired neural network (encoder NN) for data compression at the high-luminosity LHC at CERN The goal of this encoder NN is to compress the data while preserving the information related to the distribution of energy deposits in particle detectors. We demonstrate that the performance of our encoder NN trained using the differentiable EMD CNN surpasses that of training with loss functions based on mean squared error.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2019

Variable Precision Computing

This report summarizes the activities and major accomplishments of the Variable Precision Computing Strategic Initiative project. The overarching goal of this project was to initiate and promote a new paradigm in High Performance Computing (HPC) that would fundamentally change how we represent and make use of representations of real numbers in finite precision and that would establish Lawrence Livermore National Laboratory (LLNL) as a leader in precision-related research for HPC. We pursued three integrated and concurrent research thrusts: new, more dynamic data representations to address data motion and capacity limitations; improved mixed precision algorithms to accelerate computation and to leverage new hardware; and new tools to help developers reason about precision and to automate code transformations. Within these thrust areas, we made significant advances in the use of compressed array data types in numerical calculations, in the theoretical justification, in improved performance, and in the prospects of hardware implementation; in the development of metrics to significantly reduce the storage needs of molecular dynamics simulations; in the development and analysis of efficient mixed-precision algorithms for time-dependent partial differential equations and for orthogonal factorization; and in the capability of tools that can analyze sensitivity of computed results to choices in precision and that can make automated code transformations based on such analysis. We established that there are definite opportunities to realize significant improvements in HPC above and beyond the 2x limits of traditional mixed precision using the technologies we have developed. The project produced numerous papers, presentations, and posters in important venues as well as open-source software contributions to the community, and many of the new capabilities have initiated or are being leveraged in ongoing projects.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Genetic algorithm optimization of a chemical kinetic mechanism for propane at engine relevant conditions

Propane has demonstrated significant potential for reductions in greenhouse gas and pollutant emissions in medium- and heavy-duty engine applications, but further improvements require accurate, compact, and scalable chemical kinetic mechanisms to design the next generation of propane fueled engines, particularly at the boosted operating conditions necessary to meet the power density demand of medium- and heavy-duty applications. In this work, six key chemical reactions were identified in a reduced mechanism with 70 species and 352 reactions through a sensitivity analysis performed at conditions typical of thermodynamic trajectories observed in a high compression ratio, long stroke engine operated on propane from throttled to boosted operating conditions. While the original mechanism was validated against rapid compression machine (RCM) data, it was found to overpredict experimental autoignition tendencies in 2-zone, 0-D SI engine simulations performed in Chemkin Pro. Subsequently, a genetic algorithm approach was used to optimize the six reaction rate parameters within established uncertainty bounds by performing RCM simulations and comparing to two independent sets of literature ignition delay times for propane, thus generating two new kinetic mechanisms. The first optimization achieved a mean absolute percent error (MPE) reduction in 2nd stage ignition delay of 61.4% in seven generations, while the second optimization utilized a newer experimental RCM dataset, and achieved MPE reduction of 56.7% in seven generations, and further marginal improvement to 57.8% reduction in 34 generations. Finally, the two mechanisms were then evaluated again in the 2-zone 0-D SI engine model in Chemkin Pro comparing typical mean and knocking cycle trajectories, and it was found that the second optimized mechanism provided better prediction of knock onset at the representative conditions evaluated in this work, particularly for higher load operating conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Enhanced detection of paramagnetic fluorine-19 magnetic resonance imaging agents using zero echo time sequence and compressed sensing

Fluorine-19 ( 19 F) magnetic resonance imaging (MRI) is an emerging technique offering specific detection of labeled cells in vivo. Lengthy acquisition times and modest signal-to-noise ratio (SNR) makes three-dimensional spin-density–weighted 19 F imaging challenging. Recent advances in tracer paramagnetic metallo-perfluorocarbon (MPFC) nanoemulsion probes have shown multifold SNR improvements due to an accelerated 19 F T 1 relaxation rate and a commensurate gain in imaging speed and averages. However, 19 F T 2 -reduction and increased linewidth limit the amount of metal additive in MPFC probes, thus constraining the ultimate SNR. To overcome these barriers, we describe a compressed sampling (CS) scheme, implemented using a “zero” echo time (ZTE) sequence, with data reconstructed via a sparsity-promoting algorithm. Our CS-ZTE scheme acquires k-space data using an undersampled spherical radial pattern and signal averaging. Image reconstruction employs off-the-shelf sparse solvers to solve a joint total variation and -norm regularized least square problem. To evaluate CS-ZTE, we performed simulations and acquired 19 F MRI data at 11.7 T in phantoms and mice receiving MPFC-labeled dendritic cells. For MPFC-labeled cells in vivo, we show SNR gains of ~6.3 × with 8-fold undersampling. We show that this enhancement is due to three mechanisms including undersampling and commensurate increase in signal averaging in a fixed scan time, denoising attributes from the CS algorithm, and paramagnetic reduction of T 1 . Importantly, 19 F image intensity analyses yield accurate estimates of absolute quantification of 19 F spins. Overall, the CS-ZTE method using MPFC probes achieves ultrafast imaging, a substantial boost in detection sensitivity, accurate 19 F spin quantification, and minimal image artifacts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2015

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linear reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Quantum-inspired method for solving the Vlasov-Poisson equations

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

A Consensus Equilibrium Approach for 3-D Land Seismic Shots Recovery

Physical and budget constraints often result in inadequate sampling for accurate subsurface imaging. Preprocessing approaches, such as missing trace interpolation, are typically employed to enhance seismic data in such cases. The compressed sensing (CS) framework has been applied for modeling missing seismic data, which is estimated by sparsity-based computational algorithms. While existing work mainly focuses on recovering missing traces resulting from receiver subsampling, source subsampling has greater economical advantages, as sources are more expensive than receivers. Moreover, stronger image models different from sparsity have not been explored for source recovery. This work presents a consensus equilibrium (CE) approach to recover missing seismic shots, which enables to incorporate various regularization operators modeling different data priors. Here, simulation results from a real 3-D land seismic dataset demonstrate that the CE approach provides more accurate estimations of the linear and hyperbolic events in the recovered shots, compared with pure sparsity-based reconstructions.

58 GEOSCIENCES↗

DOE OSTI2025

The Alamo multiphysics solver for phase field simulations with strong-form mechanics and block structured adaptive mesh refinement

Alamo is a high-performance scientific code that uses block-structured adaptive mesh refinement to solve such problems as: the ignition and burn of solid rocket propellant, plasticity, damage and fracture in materials undergoing loading, and the interaction of compressible flow with eroding solid materials. Alamo is powered by AMReX, and provides a set of unique methods, models, and algorithms that enable it to solve solid-mechanics problems (coupled to other physical behavior such as fluid flow or thermal diffusion) using the power of block-structured adaptive mesh refinement.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Report on local data recovery approaches suitable for weather and climate prediction (Deliverable 1.3) (V.1.0)

Numerical weather and climate prediction rates as one of the scientific applications whose accuracy improvements greatly depend on the growth of the available computing power. As the number of cores in top computing facilities pushes into the millions, increasing average frequency of hardware and software failures forces users to review their algorithms and systems in order to protect simulations from breakdown. This report surveys approaches for fault-tolerance in numerical algorithms and system resilience in parallel simulations from the perspective of numerical weather and climate prediction systems. A selection of existing strategies is analyzed, featuring interpolation-restart and compressed checkpointing for the numerics, in-memory checkpointing, user-level failure mitigation-based and backup-based methods for the systems. Numerical examples showcase the performance of the techniques in addressing faults, with particular emphasis on iterative solvers for linear systems, a staple of atmospheric fluid flow solvers. The potential impact of these strategies is discussed in relation to current development of numerical weather prediction algorithms and systems towards the exascale. Trade-offs between performance, efficiency and effectiveness of resiliency strategies are analyzed and some recommendations outlined for future developments.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Baseline Face Detection, Head Pose Estimation, and Coarse Direction Detection for Facial Data in the SHRP2 Naturalistic Driving Study

Keeping a driver focused on the road is one of the most critical steps in insuring the safe operation of a vehicle. The Strategic Highway Research Program 2 (SHRP2) has over 3,100 recorded videos of volunteer drivers during a period of 2 years. This extensive naturalistic driving study (NDS) contains over one million hours of video and associated data that could aid safety researchers in understanding where the driver s attention is focused. Manual analysis of this data is infeasible, therefore efforts are underway to develop automated feature extraction algorithms to process and characterize the data. The real-world nature, volume, and acquisition conditions are unmatched in the transportation community, but there are also challenges because the data has relatively low resolution, high compression rates, and differing illumination conditions. A smaller dataset, the head pose validation study, is available which used the same recording equipment as SHRP2 but is more easily accessible with less privacy constraints. In this work we report initial head pose accuracy using commercial and open source face pose estimation algorithms on the head pose validation data set.

Paone, Jeffrey R↗

DOE OSTI2016

Dimensionality Reduction Algorithms for Big Nuclear Data Streams with Application to SCALE Cross Sections

A central problem in performing accurate nuclear reactor simulations is the ability to capture the changes in the few group microscopic cross sections as functions of system state, e.g. moderator density, fuel temperature, or neutron spectrum, and time and/or burnup of the fuel. For most reactor simulation scenarios, this results in huge data stream, which must be interpolated as needed by downstream calculations (e.g., core-wide simulation). This is typically accomplished by using sophisticated interpolating functions to capture the few-group variations over the wide range of conditions expected during operation. To address handling this big data, this paper explores the use of dimensionality reduction (DR) techniques to identify the true dimensionality of the data prior to its use in the calculations. This could significantly reduce the computational cost required for data processing/manipulation, thus reducing a significant portion of the total calculations time. By way of an example, in the current version of the ORIGEN-ARP module, the assembly-averaged microscopic cross sections at different conditions, e.g., fuel enrichments, irradiation history and water density, which are calculated using the TRITON sequence and interpolated on-demand by the ARP module to model assembly depletion for a wide range of assembly types (e.g. Westinghouse 17x17 and GE 9x9) over a wide range of conditions. This approach typically results in ∼1 GB per assembly type, which although not insurmountable, can be impractical for distribution. and it is the premise of this paper that most of this data is heavily correlated and hence can take great benefit of condensation via DR. To demonstrate DR, the proposed algorithm is applied to the nuclear data streams generated by SCALE 6.1. Using the depletion sequence (TRITON), microscopic cross sections are calculated for a mixed oxide (MOX) fuel assembly design at a representative range of fuel enrichments and fuel burnup. In conventional core simulators, multi dimensional interpolation of these cross sections is used to provides neutronics feedback due to local conditions without returning to expensive TRITON calculations for every change. This paper shows that dimensionality reduction can help compress the size of the cross section data without sacrificing the accuracy of their reconstruction at all conditions of interest. This work explores the application of dimensionality reduction algorithms to nuclear data streams typically employed in support of conventional full-core reactor calculations which rely on interpolation of pre-calculated microscopic cross sections. In particular, analysis of the few group MOX cross sections revealed that a large degree of dependencies exist between the few-group cross sections, which can be revealed via range-finding algorithms. Specifically, correlations between different reaction types for the same isotope have been identified, and correlations between different enrichments and correlations across different isotopes have been identified. This paper demonstrates that the reduction errors can be quantified, and they are uncorrelated with the range of variations for the various cross sections. In future work, we will focus on identifying the smallest rank that takes into account all types of correlations across the range of conditions used to model cross section variations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

Multilevel Techniques for Compression and Reduction of Scientific Data---The Unstructured Case

Previous work on multilevel techniques for compression and reduction of scientific data is extended to the case of data given on unstructured meshes in two and three dimensions. The centerpiece of the work is a decomposition algorithm which is shown to be optimal, in terms of both storage and operational complexity, applicable to unstructured grids in both two and three dimensions, and which implicitly gives a Riesz basis that can be exploited to reduce the data while maintaining rigorous bounds on the loss incurred. The flexibility of the approach is illustrated by applications to potential flow around an airfoil and the effect of compression on quantities of interest relevant to airfoil design; compression of computational simulation of a nonlinear reaction-diffusion system with special attention given to the problem of time series reduction; and, data from a simulation of magnetically confined plasma in a fusion reactor reduced so as to preserve the electric field computed from the data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Resilience and fault tolerance in high-performance computing for numerical weather and climate prediction

Progress in numerical weather and climate prediction accuracy greatly depends on the growth of the available computing power. As the number of cores in top computing facilities pushes into the millions, increased average frequency of hardware and software failures forces users to review their algorithms and systems in order to protect simulations from breakdown. This report surveys hardware, application-level and algorithm-level resilience approaches of particular relevance to time-critical numerical weather and climate prediction systems. A selection of applicable existing strategies is analysed, featuring interpolation-restart and compressed checkpointing for the numerical schemes, in-memory checkpointing, user-level failure mitigation and backup-based methods for the systems. Numerical examples showcase the performance of the techniques in addressing faults, with particular emphasis on iterative solvers for linear systems, a staple of atmospheric fluid flow solvers. The potential impact of these strategies is discussed in relation to current development of numerical weather prediction algorithms and systems towards the exascale. Trade-offs between performance, efficiency and effectiveness of resiliency strategies are analysed and some recommendations outlined for future developments.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2026

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗

DOE OSTI2023

PeleLMeX: an AMR Low Mach Number Reactive Flow Simulation Code without level sub-cycling

PeleLMeX simulates chemically reacting low Mach number flows with block-structured adaptive mesh refinement (AMR). The code is built upon the AMReX library, which provides the underlying data structures and tools to manage and operate on them across massively parallel computing architectures. PeleLMeX algorithmic features are inherited from its predecessor PeleLM but key improvements allow representation of more complex physical processes. Together with its compressible flow counterpart PeleC, the thermo-chemistry library PelePhysics and the multi-physics library PeleMP, it forms the Pele suite of open-source reactive flow simulation codes.

97 MATHEMATICS AND COMPUTING↗