Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “errors”

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 793 records · Page 44

Tuning the Interpolation Basis in a Multigrid Decomposition for Local Error Control

In the compression of scientific data, error-controlled compressors enable to considerably decrease the size of the dataset while maintaining adequate levels of accuracy. In this paper, we note that multi-level refactoring scheme such as MGARD i) rely on an approximation of the data based on the interpolation of coefficients, ii) estimate the resulting error with global metrics on the dataset. To improve on these two aspects, we propose a method that aims to divide the original dataset into blocks based on their smoothness and refactors each block separately with the most relevant interpolation order. We show the relevance of such a method on tailored datasets and the benefits and challenges when applying it to large scientific data.

Vidal, Nicolas [ORNL]↗

Spatial Support Vector Regression to Detect Silent Errors in the Exascale Era

As the exascale era approaches, the increasing capacity of high-performance computing (HPC) systems with targeted power and energy budget goals introduces significant challenges in reliability. Silent data corruptions (SDCs) or silent errors are one of the major sources that corrupt the executionresults of HPC applications without being detected. In this work, we explore a low-memory-overhead SDC detector, by leveraging epsilon-insensitive support vector machine regression, to detect SDCs that occur in HPC applications that can be characterized by an impact error bound. The key contributions are three fold. (1) Our design takes spatialfeatures (i.e., neighbouring data values for each data point in a snapshot) into training data, such that little memory overhead (less than 1%) is introduced. (2) We provide an in-depth study on the detection ability and performance with different parameters, and we optimize the detection range carefully. (3) Experiments with eight real-world HPC applications show thatour detector can achieve the detection sensitivity (i.e., recall) up to 99% yet suffer a less than 1% of false positive rate for most cases. Our detector incurs low performance overhead, 5% on average, for all benchmarks studied in the paper. Compared with other state-of-the-art techniques, our detector exhibits the best tradeoff considering the detection ability and overheads.

Subasi, Omer↗

MACORD: Online Adaptive Machine Learning Framework for Silent Error Detection

Future HPC systems with ever-increasing resource capacity (such as compute cores, memory and storage) may significantly increase the risks on reliability. Silent data corruptions (SDCs) or silent errors are one of the major sources that corrupt HPC execution results. Unlike fail-stop errors, SDCs are rather harmful and dangerous in that they cannot be detected by hardware. We propose an online machine-learning based silent data corruption detection framework (abbreviated as MACORD) for detecting SDCs in HPC applications. In particular, we comprehensively investigate the prediction ability of a multitude of machine-learning algorithms in our study, and enable the detector to automatically select the best-fit algorithms at runtime to adapt to the data dynamics. Our learning framework exhibits low memory overhead (less than 1%), since it takes only spatial features (i.e., neighboring data values for each data point in the current time step) into the training data. Experiments based on real-world scientific applications/benchmarks show that our framework can get the detection sensitivity (i.e., recall) up to 99% while the false positive rate is limited to 0.1% in most cases, which is one order of magnitude improvement compared with the latest state-of-art spatial technique.

Subasi, Omer↗

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↗

Machine Learning Based Multi-Physical-Model Blending for Enhancing Renewable Energy Forecast -- Improvement via Situation Dependent Error Correction

With increasing penetration of solar and wind energy to the total energy supply mix, the pressing need for accurate energy forecasting has become well-recognized. Here we report the development of a machine-learning based model blending approach for statistically combining multiple meteorological models for improving the accuracy of solar/wind power forecast. Importantly, we demonstrate that in addition to parameters to be predicted (such as solar irradiance and power), including additional atmospheric state parameters which collectively define weather situations as machine learning input provides further enhanced accuracy for the blended result. Functional analysis of variance shows that the error of individual model has substantial dependence on the weather situation. The machine-learning approach effectively reduces such situation dependent error thus produces more accurate results compared to conventional multi-model ensemble approaches based on simplistic equally or unequally weighted model averaging. Validation over an extended period of time results show over 30% improvement in solar irradiance/power forecast accuracy compared to forecasts based on the best individual model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A large-scale study of soft-errors on GPUs in the field

Parallelism provided by the GPU architecture has enabled domain scientists to simulate physical phenomena at a much faster rate and finer granularity than what was previously possible by CPU-based large-scale clusters. Architecture researchers have been investigating reliability characteristics of GPUs and innovating techniques to increase the reliability of these emerging computing devices. Such efforts are often guided by technology projections and simplistic scientific kernels, and performed using architectural simulators and modeling tools. Lack of large-scale field data impedes the effectiveness of such efforts. This study attempts to bridge this gap by presenting a large-scale field data analysis of GPU reliability. We characterize and quantify different kinds of soft-errors on the Titan supercomputer's GPU nodes. Our study uncovers several interesting and previously unknown insights about the characteristics and impact of soft-errors.

Nie, Bin↗

Analysis of field errors for LARP Nb 3 Sn HQ03 quadrupole magnet

The U.S. LHC Accelerator Research Program, in close collaboration with CERN, has developed three generations of high-gradient quadrupole (HQ) Nb 3 Sn model magnets, to support the development of the 150 mm aperture Nb 3 Sn quadrupole magnets for the High-Luminosity LHC. The latest generation, HQ03, featured coils with better uniformity of coil dimensions and properties than the earlier generations. We tested the HQ03 magnet at FNAL, including the field quality study. The profiles of low-order harmonics along the magnet aperture observed at 15 kA, 1.9 K can be traced back to the assembled coil pack before the magnet assembly. Based on the measured harmonics in the magnet center region, the coil block positioning tolerance was analyzed and compared with earlier HQ01 and HQ02 magnets to correlate with coil and magnet fabrication. Our study the capability of correcting the low-order non-allowed field errors, magnetic shims were installed in HQ03. Furthermore, the expected shim contribution agreed well with the calculation. For the persistent-current effect, the measured a4 can be related to 4% higher in the strand magnetization of one coil with respect to the other three coils. Lastly, we compare the field errors due to the inter-strand coupling currents between HQ03 and HQ02.

43 PARTICLE ACCELERATORS↗

An Adaptive Bayesian Parameter Estimation of a Synchronous Generator Under Gross Errors

Polynomial-chaos-expansion-based surrogate models have recently been advocated in the literature for power system dynamic parameter estimation. Regarding the estimation of the uncertain generator parameters, a Bayesian inference framework has been proposed based on a polynomial-based reduced-order representation of the synchronous machines using assumed parameter values. Then, the non-Gaussian posterior probability distribution functions (pdfs) of these parameters are recovered through the stochastic sampling approach efficiently. However, facing very large parameter errors, the reliability of the surrogate model decreases, yielding biased estimation results. To overcome this problem, here we develop hierarchical Bayesian inference framework that processes the measurements provided by phasor measurement units, while making use of multifidelity surrogates together with the importance sampling method. The latter allows us to estimate in an efficient manner the posterior pdfs of the uncertain parameters through the normalized weights of the prior samples. To improve the accuracy of the posterior pdfs, an adaptive procedure is further adopted in the importance sampling for the gradual evolution of its proposal functions. The new proposals assist in fine-tuning the sample space and thereby help to construct surrogates with higher fidelity. Through an iterative process, this approach is able to estimate accurately and efficiently non-Gaussian posterior pdfs of the uncertain generator parameters subject to gross errors.

42 ENGINEERING↗

Closed-Loop Error Learning Control for Uncertain Nonlinear Systems With Experimental Validation on a Mobile Robot

This article develops a closed-loop error learning control (CLELC) algorithm for feedback linearizable systems with experimental validation on a mobile robot. Traditional feedback and feedforward controllers are designed based on the nominal model by using the feedback linearization control (FLC) method. Then, an intelligent controller is designed based on the sliding mode learning algorithm that utilizes closed-loop error dynamics to learn the system behavior. The controllers are working in parallel, and the intelligent controller can gradually replace the feedback controller from the control of the system. In addition to the stability of the sliding mode learning algorithm, the closed-loop stability of an nth-order feedback linearizable system is proven. The simulation results demonstrate that the CLELC algorithm can improve control performance (e.g., smaller rise time, settling time, and overshoot) in the absence of uncertainties, and also provides robust control performance in the presence of uncertainties as compared to traditional FLC method. To test the efficiency and efficacy of the CLELC algorithm, the trajectory tracking problem of a tracked mobile robot is studied in real time. The experimental results demonstrate that the CLELC algorithm ensures highly accurate trajectory tracking performance than traditional FLC method.

97 MATHEMATICS AND COMPUTING↗

Sinusoidal Siemens star spatial frequency response measurement errors due to misidentified target centers

Numerous methods are available to measure the spatial frequency response (SFR) of an optical system. A recent change to the ISO 12233 photography resolution standard includes a sinusoidal Siemens star test target. We take the sinusoidal Siemens star proposed by the ISO 12233 standard, measure system SFR, and perform an analysis of errors induced by incorrectly identifying the center of a test target. We show a closed-form solution for the radial profile intensity measurement given an incorrectly determined center and describe how this error reduces the measured SFR of the system. As a result, using the closed-form solution, we propose a two-step process by which test target centers are corrected and the measured SFR is restored to the nominal, correctly centered values.

79 ASTRONOMY AND ASTROPHYSICS↗

Measurement Error and Resolution in Quantitative Stable Isotope Probing: Implications for Experimental Design

Quantitative stable isotope probing (qSIP) estimates isotope tracer incorporation into DNA of individual microbes and can link microbial biodiversity and biogeochemistry in complex communities. As with any quantitative estimation technique, qSIP involves measurement error, and a fuller understanding of error, precision, and statistical power benefits qSIP experimental design and data interpretation. We used several qSIP data sets—from soil and seawater microbiomes—to evaluate how variance in isotope incorporation estimates depends on organism abundance and resolution of the density fractionation scheme. We assessed statistical power for replicated qSIP studies, plus sensitivity and specificity for unreplicated designs. As a taxon’s abundance increases, the variance of its weighted mean density declines. Nine fractions appear to be a reasonable trade-off between cost and precision for most qSIP applications. Increasing the number of density fractions beyond that reduces variance, although the magnitude of this benefit declines with additional fractions. Our analysis suggests that, if a taxon has an isotope enrichment of 10 atom% excess, there is a 60% chance that this will be detected as significantly different from zero (with alpha 0.1). With five replicates, isotope enrichment of 5 atom% could be detected with power (0.6) and alpha (0.1). Finally, we illustrate the importance of internal standards, which can help to calibrate per sample conversions of %GC to mean weighted density. These results should benefit researchers designing future SIP experiments and provide a useful reference for metagenomic SIP applications where both financial and computational limitations constrain experimental scope.

59 BASIC BIOLOGICAL SCIENCES↗

Decoy States and Low-Density Parity-Check Error-Correcting Codes in Quantum Cryptography with Phase–Time Coding

The cryptographic robustness of quantum key distribution (QKD) with phase–time coding against a photon number splitting (PNS) attack is analyzed. The line length up to which a secret key distribution is guaranteed is determined both by the protocol itself and by the efficiency of error correction in raw keys. The effect of different parameters of avalanche single-photon detectors on the length of the secret key distribution line is investigated. To correct errors, various versions of low-density parity-check (LDPC) codes are considered whose efficiency today is the closest to the Shannon theoretical limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the errors in measuring the particle density by the light absorption method

The accuracy of absorption measurements of the density of particles in a given quantum state as a function of the light absorption coefficient is analyzed. Errors caused by the finite accuracy in measuring the intensity of the light passing through a medium in the presence of different types of noise in the recorded signal are considered. Optimal values of the absorption coefficient and the factors capable of multiplying errors when deviating from these values are determined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms

Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speedups and lower storage cost if applied appropriately. The growing interest in employing mixed precision computations motivates the need for rounding error analysis that properly handles behavior from mixed precision arithmetic. We develop mixed precision variants of existing Householder QR algorithms and show error analyses supported by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Memory Errors in Modern Systems: The Good, The Bad, and The Ugly

Several recent publications have shown that hardware faults in the memory subsystem are commonplace. These faults are predicted to become more frequent in future systems that contain orders of magnitude more DRAM and SRAM than found in current memory subsystems. These memory subsystems will need to provide resilience techniques to tolerate these faults when deployed in high-performance computing systems and data centers containing tens of thousands of nodes. Therefore, it is critical to understand the efficacy of current hardware resilience techniques to determine whether they will be suitable for future systems. In this paper, we present a study of DRAM and SRAM faults and errors from the field. We use data from two leadership-class high-performance computer systems to analyze the reliability impact of hardware resilience schemes that are deployed in current systems. Our study has several key findings about the efficacy of many currently deployed reliability techniques such as DRAM ECC, DDR address/command parity, and SRAM ECC and parity. We also perform a methodological study, and find that counting errors instead of faults, a common practice among researchers and data center operators, can lead to incorrect conclusions about system reliability. Lastly, we use our data to project the needs of future large-scale systems. We find that SRAM faults are unlikely to pose a significantly larger reliability threat in the future, while DRAM faults will be a major concern and stronger DRAM resilience schemes will be needed to maintain acceptable failure rates similar to those found on today's systems.

97 MATHEMATICS AND COMPUTING↗

Reducing Soft-error Vulnerability of Caches using Data Compression

With ongoing chip miniaturization and voltage scaling, particle strike-induced soft errors present increasingly severe threat to the reliability of on-chip caches. In this paper, we present a technique to reduce the vulnerability of caches to soft-errors. Our technique uses data compression to reduce the number of vulnerable data bits in the cache and performs selective duplication of more critical data-bits to provide extra protection to them. Microarchitectural simulations have shown that our technique is effective in reducing architectural vulnerability factor (AVF) of the cache and outperforms another technique. For single and dual-core system configuration, the average reduction in AVF is 5.59X and 8.44X, respectively. Also, the implementation and performance overheads of our technique are minimal and it is useful for a broad range of workloads.

Mittal, Sparsh↗

BonVoision: Leveraging Spatial Data Smoothness For Recovery From Memory Soft Errors

The increasing soft error rates in memory systems raise an emerging concern for modern computing systems. As a result, detectable but uncorrectable errors (DUEs) become potentially more frequent and affect HPC applications. Today, upon encountering a DUE, HPC applications crash, incurring significant performance, storage, and energy overheads. In this paper, we propose a technique to continue application execution past a DUE through the repair of the corrupted memory data by leveraging spatial data smoothness. We present BonVoision, a run-time system that intercepts DUE events, analyzes the binary to identify data elements in the structural neighborhood of the event, and fixes the corrupted data elements by interpolating from the values in their neighborhood. Our evaluation demonstrates that BonVoision incurs negligible overhead and outperforms other recovery strategies by a factor of 2×, on average. We demonstrate that BonVoision also improves the efficiency of existing checkpointing/restart schemes by approximately increasing the optimal checkpoint interval by 23%.

Fang, Bo↗

CaliQEC: In-situ Qubit Calibration for Surface Code Quantum Error Correction

Quantum Error Correction (QEC) is essential for fault-tolerant, large-scale quantum computation. However, error drift in qubits undermines QEC performance during long computations, necessitating frequent calibration. Conventional calibration methods disrupt quantum states, requiring system downtime and rendering in situ calibration impractical. To address this challenge, we propose QECali, a novel framework that enables in situ calibration for surface codes. Our evaluation demonstrates that QECali introduces modest qubit overhead and negligible increases in execution time, offering the first practical solution for in situ calibration in surface code based quantum computation.

Fang, Xiang [University of California, Santa Barba↗