Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tolerance Bounds”

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 145 records · Page 8

Fast casual multicast

A new protocol is presented that efficiently implements a reliable, causally ordered multicast primitive and is easily extended into a totally ordered one. Intended for use in the ISIS toolkit, it offers a way to bypass the most costly aspects of ISIS while benefiting from virtual synchrony. The facility scales with bounded overhead. Measured speedups of more than an order of magnitude were obtained when the protocol was implemented within ISIS. One conclusion is that systems such as ISIS can achieve performance competitive with the best existing multicast facilities--a finding contradicting the widespread concern that fault-tolerance may be unacceptably costly.

Birman, Kenneth↗

Experimental validation of clock synchronization algorithms

The objective of this work is to validate mathematically derived clock synchronization theories and their associated algorithms through experiment. Two theories are considered, the Interactive Convergence Clock Synchronization Algorithm and the Midpoint Algorithm. Special clock circuitry was designed and built so that several operating conditions and failure modes (including malicious failures) could be tested. Both theories are shown to predict conservative upper bounds (i.e., measured values of clock skew were always less than the theory prediction). Insight gained during experimentation led to alternative derivations of the theories. These new theories accurately predict the behavior of the clock system. It is found that a 100 percent penalty is paid to tolerate worst-case failures. It is also shown that under optimal conditions (with minimum error and no failures) the clock skew can be as much as three clock ticks. Clock skew grows to six clock ticks when failures are present. Finally, it is concluded that one cannot rely solely on test procedures or theoretical analysis to predict worst-case conditions.

Palumbo, Daniel L.↗

High Level Design Proof of a Reliable Computing Platform

An architecture for fault-tolerant computing is formalized and shown to satisfy a key correctness property. The reliable computing platform uses replicated processors and majority voting to achieve fault tolerance. Under the assumption of a majority of processors working in each frame, we show that the replicated system computes the same results as a single processor system not subject to failures. Sufficient conditions are obtained to establish that the replicated system recovers from transient faults within a bounded amount of time. Three different voting schemes are examined and proved to satisfy the bounded recovery time conditions.

DiVito, Ben L.↗

Polarity-Tolerant Chloride Binding in Foldamer Capsules by Programmed Solvent-Exclusion

Persistent anion binding in a wide range of solution environments is a key challenge that continues to motivate and demand new strategies in synthetic receptor design. Though strong binding in low-polarity solvents has become routine, our ability to maintain high affinities in high-polarity solvents has not yet reached the standard set by nature. Anions are bound and transported regularly in aqueous environments by proteins that use secondary and tertiary structure to isolate anion binding sites from water. Inspired by this principle of solvent exclusion, we created a sequence-defined foldameric capsule whose global minimum conformation displays a helical folded state and is preorganized for 1:1 anion complexation. The high stability of the folded geometry and its ability to exclude solvent were supported by solid-state and solution phase studies. This capsule then withstood a 4-fold increase in solvent dielectric constant (εr) from dichloromethane (9) to acetonitrile (36) while maintaining a high and solvent-independent affinity of 10 5 M –1 ; ΔG ~ 28 kJ mol –1 . This behavior is unusual. More typical of solvent-dependent behavior, Cl – affinities were seen to plummet in control compounds, such as aryl-triazole macrocycles and pentads, with their solvent-exposed binding cavities susceptible to dielectric screening. Finally, dimethyl sulfoxide denatures the foldamer by putative solvent binding, which then lowers the foldamer’s Cl – affinity to normal levels. Furthermore, the design of this capsule demonstrates a new prototype for the development of potent receptors that can operate in polar solvents and has the potential to help manage hydrophilic anions present in the hydrosphere and biosphere.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Formal design and verification of a reliable computing platform for real-time control. Phase 1: Results

A high-level design is presented for a reliable computing platform for real-time control applications. Design tradeoffs and analyses related to the development of the fault-tolerant computing platform are discussed. The architecture is formalized and shown to satisfy a key correctness property. The reliable computing platform uses replicated processors and majority voting to achieve fault tolerance. Under the assumption of a majority of processors working in each frame, it is shown that the replicated system computes the same results as a single processor system not subject to failures. Sufficient conditions are obtained to establish that the replicated system recovers from transient faults within a bounded amount of time. Three different voting schemes are examined and proved to satisfy the bounded recovery time conditions.

Divito, Ben L.↗

Anderson acceleration with approximate calculations: Applications to scientific computing

Here we provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.

97 MATHEMATICS AND COMPUTING↗

A Convex Approach to Fault Tolerant Control

The design of control laws for dynamic systems with the potential for actuator failures is considered in this work. The use of Linear Matrix Inequalities allows more freedom in controller design criteria than typically available with robust control. This work proposes an extension of fault-scheduled control design techniques that can find a fixed controller with provable performance over a set of plants. Through convexity of the objective function, performance bounds on this set of plants implies performance bounds on a range of systems defined by a convex hull. This is used to incorporate performance bounds for a variety of soft and hard failures into the control design problem.

Maghami, Peiman G.↗

Interplay of freeze-in and freeze-out: Lepton-flavored dark matter and muon colliders

We study a lepton-flavored dark matter model and its signatures at a future muon collider. We focus on the less-explored regime of feeble dark matter interactions, which suppresses the dangerous lepton-flavor-violating processes, gives rise to dark matter freeze-in production, and leads to long-lived particle signatures at colliders. We find that the interplay of dark matter freeze-in and its mediator freeze-out gives rise to an upper bound of around TeV scales on the dark matter mass. The signatures of this model depend on the lifetime of the mediator and can range from generic prompt decays to more exotic long-lived particle signals. In the prompt region, we calculate the signal yield, study useful kinematics cuts, and report tolerable systematics that would allow for a 5 σ discovery. In the long-lived region, we calculate the number of charged tracks and displaced lepton signals of our model in different parts of the detector and uncover kinematic features that can be used for background rejection. We show that, unlike in hadron colliders, multiple production channels contribute significantly, which leads to sharply distinct kinematics for electroweakly charged long-lived particle signals. Ultimately, the collider signatures of this lepton-flavored dark matter model are common among models of electroweak-charged new physics, rendering this model a useful and broadly applicable benchmark model for future muon collider studies that can help inform work on detector design and studies of systematics. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

Development of a Fan for Future Space Suit Applications

NASA's next generation space suit system will place new demands on the fan used to circulate breathing gas through the ventilation loop of the portable life support system. Long duration missions with frequent extravehicular activities (EVAs), the requirement for significant increases in reliability and durability, and a mission profile that imposes strict limits on weight, volume and power create the basis for a set of requirements that demand more performance than is available from existing fan designs. This paper describes the development of a new fan to meet these needs. A centrifugal fan was designed with a normal operating speed of approximately 39,400 rpm to meet the ventilation flow requirements while also meeting the aggressive minimal packaging, weight and power requirements. The prototype fan also operates at 56,000 rpm to satisfy a second operating condition associated with a single fan providing ventilation flow to two spacesuits connected in series. This fan incorporates a novel nonmetallic "can" to keep the oxygen flow separate from the motor electronics, thus eliminating ignition potential. The nonmetallic can enables a small package size and low power consumption. To keep cost and schedule within project bounds a commercial motor controller was used. The fan design has been detailed and implemented using materials and approaches selected to address anticipated mission needs. Test data is presented to show how this fan performs relative to anticipated ventilation requirements for the EVA portable life support system. Additionally, data is presented to show tolerance to anticipated environmental factors such as acoustics, shock, and vibration. Recommendations for forward work to progress the technology readiness level and prepare the fan for the next EVA space suit system are also discussed.

Paul. Heather L.↗

Sensitivity of liquid bridges subject to axial residual acceleration

It has become evident that the float zone crystal growth method and isothermal liquid bridges may be very sensitive to the residual acceleration environment of a spacelab. Using a slender-body approximation, the problem of determining the axisymmetric response of the shape of the free surface of a cylindrical liquid column bounded by two solid regions is modeled by a one-dimensional system of nonlinear equations. It is found that the sensitivity of the zone shape depends on the static Bond number, BO, aspect ratio, and viscosity, as well as the amplitude and frequency of the disturbance. The general trend is an increase in tolerable residual gravity with increasing frequency. At the eigenfrequencies of the zone, however, there are dramatic deviations from this trend. At these frequencies the tolerable residual gravity level can be two orders of magnitude lower at this frequency.

Zhang, Yiqiang↗

A Performance Prediction Model for a Fault-Tolerant Computer During Recovery and Restoration

The modeling and design of a fault-tolerant multiprocessor system is addressed. Of interest is the behavior of the system during recovery and restoration after a fault has occurred. The multiprocessor systems are based on the Algorithm to Architecture Mapping Model (ATAMM) and the fault considered is the death of a processor. The developed model is useful in the determination of performance bounds of the system during recovery and restoration. The performance bounds include time to recover from the fault, time to restore the system, and determination of any permanent delay in the input to output latency after the system has regained steady state. Implementation of an ATAMM based computer was developed for a four-processor generic VHSIC spaceborne computer (GVSC) as the target system. A simulation of the GVSC was also written on the code used in the ATAMM Multicomputer Operating System (AMOS). The simulation is used to verify the new model for tracking the propagation of the delay through the system and predicting the behavior of the transient state of recovery and restoration. The model is shown to accurately predict the transient behavior of an ATAMM based multicomputer during recovery and restoration.

Obando, Rodrigo A.↗

Reliability Model Generator for fault-tolerant systems

This paper discusses an analysis tool, the Reliability Model Generator, that reasons from structural and functional system design specifications to generate a reliability model for the system under investigation. The resultant model defines a system state space sufficient to characterize the effects of single and multiple component failures. This model may then be examined by the analyst or used as input to an existing reliability evaluation tool, the Semi-Markov Unreliability Range Evaluator (SURE), to compute numeric bounds for system reliability (i.e., safety, mission success, availability, etc.). In defining the input to the Reliability Model Generator, a separation of the component function from structural specification is proposed to allow easy modification for analysis of alternative architectures. A hierarchical system description paradigm promotes multiple abstractions, thereby enabling analysis at all phases of the design process. The work described in this paper has been supported under NASA contract NAS1-10899, Integrated Airframe/Propulsion Control System Architecture (IAPSA II). IAPSA II promotes a system engineering methodology and supporting analytical tools to evaluate flight control architecture configuration alternatives during early phases of the design cycle when the cost and schedule impact of design revisions is minimal. Emphasis is placed on traceability to ensure that the requirements drive the resulting design.

Catherine M McCann↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Permutation codes for sources.

Source encoding techniques based on permutation codes are investigated. For a broad class of distortion measures it is shown that optimum encoding of a source permutation code is easy to instrument even for very long block lengths. Also, the nonparametric nature of permutation encoding is well suited to situations involving unknown source statistics. For the squared-error distortion measure a procedure for generating good permutation codes of a given rate and block length is described. The performance of such codes for a memoryless Gaussian source is compared both with the rate-distortion function bound and with the performance of various quantization schemes. The comparison reveals that permutation codes are asymptotically ideal for small rates and perform as well as the best entropy-coded quantizers presently known for intermediate rates. They can be made to compare favorably at high rates, too, provided the coding delay associated with extremely long block lengths is tolerable.

Berger, T.↗

Divergence in the ABA gene regulatory network underlies differential growth control

The phytohormone abscisic acid (ABA) is a central regulator of acclimation to environmental stress; however, its contribution to differences in stress tolerance between species is unclear. To establish a comparative framework for understanding how stress hormone signalling pathways diverge across species, we studied the growth response of four Brassicaceae species to ABA treatment and generated transcriptomic and DNA affinity purification and sequencing datasets to construct a cross-species gene regulatory network (GRN) for ABA. In this work, comparison of genes bound directly by ABA-responsive element binding factors suggests that cis-factors are most important for determining the target loci represented in the ABA GRN of a particular species. Using this GRN, we reveal how rewiring of growth hormone subnetworks contributes to stark differences in the response to ABA in the extremophyte Schrenkiella parvula. Our study provides a model for understanding how divergence in gene regulation can lead to species-specific physiological outcomes in response to hormonal cues.

59 BASIC BIOLOGICAL SCIENCES↗

RAPIDS: Reconciling Availability, Accuracy, and Performance in Managing Geo-Distributed Scientific Data

In modern science, big data plays an increasingly important role. Many scientific applications, such as running simulations on supercomputers or conducting experiments on advanced instruments, produce huge amount of data at unprecedented speed. Analyzing and understanding such big data is the key for scientists to make scientific breakthroughs. However, data might become unavailable for scientists to access when outages or maintenance of the storage system occur, which severely hinders scientific discovery. To improve the data availability, data duplication and erasure coding (EC) are often used. But as the scientific data gets larger, using these two methods can cause considerable storage and network overhead.In this paper, we propose RAPIDS, a hybrid approach that combines the multigrid-based error-bounded lossy compression with erasure coding, to significantly reduce the storage and network overhead required for maintaining high data availability. Our experiments show that RAPIDS reduces the storage overhead by up to 7.5x and network overhead by up to 3x to achieve the same level of availability compared to the regular EC method. We improve RAPIDS by building two models to optimize the fault tolerance configurations and data gathering strategy. We demonstrate that RAPIDS significantly improves performance when running on many CPU cores in parallel or on GPUs.

Wan, Lipeng↗

Reduction Of Sizes Of Semi-Markov Reliability Models

Trimming technique reduces computational effort by order of magnitude while introducing negligible error. Error bound depends on only three parameters from semi-Markov model: maximum sum of rates for failure transitions leaving any state, maximum average holding time for recovery-mode state, and operating time for system. Error bound computed before any model generated, enabling modeler to decide immediately whether or not model can be trimmed. Trimming procedure specified by precise and easy description, making it easy to include trimming procedure in program generating mathematical models for use in assessing reliability. Typical application of technique in design of digital control systems required to be extremely reliable. In addition to aerospace applications, fault-tolerant design has growing importance in wide range of industrial applications.

White, Allan L.↗