Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance bound”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

Electrical, Electronic and Electromechanical (EEE) Parts in the New Space Paradigm: When is Better the Enemy of Good Enough?

As the space business rapidly evolves to accommodate a lower cost model of development and operation via concepts such as commercial space and small spacecraft (aka, CubeSats), traditional EEE parts screening and qualification methods are being scrutinized under a risk-reward trade space. In this presentation, two basic concepts will be the overarching theme: 1) The movement from complete risk aversion EEE parts methods to managing andor accepting risk via alternate approaches; and, 2) A discussion of over-design focusing on both electrical design performance and bounding margins.

Electrical, Electronic, and Electromechanical (EEE↗
NASA NTRSDate not supplied

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗
NASA NTRS1976

Preentry communications study. Outer planets atmospheric entry probe

A pre-entry communications study is presented for a relay link between a Jupiter entry probe and a spacecraft in hyperbolic orbit. Two generic communications links of interest are described: a pre-entry link to a spun spacecraft antenna, and a pre-entry link to a despun spacecraft antenna. The propagation environment of Jupiter is defined. Although this is one of the least well known features of Jupiter, enough information exists to reasonably establish bounds on the performance of a communications link. Within these bounds, optimal carrier frequencies are defined. The next step is to identify optimal relative geometries between the probe and the spacecraft. Optimal trajectories are established for both spun and despun spacecraft antennas. Given the optimal carrier frequencies, and the optimal trajectories, the data carrying capacities of the pre-entry links are defined. The impact of incorporating pre-entry communications into a basic post entry probe is then assessed. This assessment covers the disciplines of thermal control, power source, mass properties and design layout. A conceptual design is developed of an electronically despun antenna for use on a Pioneer class of spacecraft.

Hinrichs, C. A.↗
NASA NTRS1987

Performance analysis of parallel branch and bound search with the hypercube architecture

With the availability of commercial parallel computers, researchers are examining new classes of problems which might benefit from parallel computing. This paper presents results of an investigation of the class of search intensive problems. The specific problem discussed is the Least-Cost Branch and Bound search method of deadline job scheduling. The object-oriented design methodology was used to map the problem into a parallel solution. While the initial design was good for a prototype, the best performance resulted from fine-tuning the algorithm for a specific computer. The experiments analyze the computation time, the speed up over a VAX 11/785, and the load balance of the problem when using loosely coupled multiprocessor system based on the hypercube architecture.

Mraz, Richard T.↗
NASA NTRS1990

Strategies for concurrent processing of complex algorithms in data driven architectures

The performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures is examined. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called ATAMM (Algorithm To Architecture Mapping Model). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Stoughton, John W.↗
NASA NTRS1990

Strategies for concurrent processing of complex algorithms in data driven architectures

Performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures are discussed. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called algorithm to architecture mapping model (ATAMM). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Som, Sukhamoy↗
NASA NTRS1985

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗
NASA NTRS2023

A Confidence-Based Approach to Including Survivors in a Probabilistic TID Failure Assessment

A probabilistic total ionizing dose (TID) failure assessment is extended to include survivor data, enabling the bounding of failure probability to a desired confidence level (CL) without failure data. The extension provides an avenue for analyzing microelectronics tested for TID without reaching a failure mode, a scenario often encountered by missions utilizing commercial-off-the-shelf (COTS) technologies. Using the type-I censored likelihood formulation and a realistic upper bound on expected device performance, the failure probability space is bounded by confidence contours within the context of a variable environment. The framework accommodates any type of distribution assumed for the part failure or the environment under consideration. Furthermore, the framework can be utilized pre-emptively to plan future device TID tests, minimizing costs while meeting survival requirements. Heritage data may also be used as survivors to further minimize testing costs when parts are from the same lot, but the amount of constraint derived from heritage is limited. Altogether, the framework enables a formal, mathematically rigorous analysis of radiation tolerant devices tested to a maximum dose, as well as flight heritage, in a hardness assurance methodology.

confidence↗
NASA NTRS2003

Structured Uncertainty Bound Determination From Data for Control and Performance Validation

This report attempts to document the broad scope of issues that must be satisfactorily resolved before one can expect to methodically obtain, with a reasonable confidence, a near-optimal robust closed loop performance in physical applications. These include elements of signal processing, noise identification, system identification, model validation, and uncertainty modeling. Based on a recently developed methodology involving a parameterization of all model validating uncertainty sets for a given linear fractional transformation (LFT) structure and noise allowance, a new software, Uncertainty Bound Identification (UBID) toolbox, which conveniently executes model validation tests and determine uncertainty bounds from data, has been designed and is currently available. This toolbox also serves to benchmark the current state-of-the-art in uncertainty bound determination and in turn facilitate benchmarking of robust control technology. To help clarify the methodology and use of the new software, two tutorial examples are provided. The first involves the uncertainty characterization of a flexible structure dynamics, and the second example involves a closed loop performance validation of a ducted fan based on an uncertainty bound from data. These examples, along with other simulation and experimental results, also help describe the many factors and assumptions that determine the degree of success in applying robust control theory to practical problems.

Lim, Kyong B.↗
NASA NTRS1991

Multi-stage decoding for multi-level block modulation codes

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Lin, Shu↗
NASA NTRS1984

On the impact of communication complexity in the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D.↗
NASA NTRS2014

Evaluation of the Trade Space Between UAS Maneuver Performance and SAA System Performance Requirements

A need exists to safely integrate Unmanned Aircraft Systems (UAS) into the National Airspace System. Replacing manned aircraft's see-and-avoid capability in the absence of an onboard pilot is one of the key challenges associated with safe integration. Sense-and-avoid (SAA) systems will have to achieve yet-to-be-determined required separation distances for a wide range of encounters. They will also need to account for the maneuver performance of the UAS they are paired with. The work described in this paper is aimed at developing an understanding of the trade space between UAS maneuver performance and SAA system performance requirements. An assessment of current manned and unmanned aircraft performance was used to establish potential UAS performance test matrix bounds. Then, nearterm UAS integration work was used to narrow down the scope. A simulator was developed with sufficient fidelity to assess SAA system performance requirements for a wide range of encounters. The simulator generates closest-point-of-approach (CPA) data from the wide range of UAS performance models maneuvering against a single intruder with various encounter geometries. The simulator is described herein and has both a graphical user interface and batch interface to support detailed analysis of individual UAS encounters and macro analysis of a very large set of UAS and encounter models, respectively. Results from the simulator using approximate performance data from a well-known manned aircraft is presented to provide insight into the problem and as verification and validation of the simulator. Analysis of climb, descent, and level turn maneuvers to avoid a collision is presented. Noting the diversity of backgrounds in the UAS community, a description of the UAS aerodynamic and propulsive design and performance parameters is included. Initial attempts to model the results made it clear that developing maneuver performance groups is required. Discussion of the performance groups developed and how to know in which group an aircraft belongs for a given flight condition and encounter is included. The groups are specific to airplane, flight condition, and encounter, rather than airplane-only specific. Results and methodology for developing UAS maneuver performance requirements are presented for each maneuver as well. Results for the vertical maneuver indicate that a minimum specific excess power value can assure a minimum CPA for a given time-to-go prediction. However, smaller values of specific excess power may achieve or exceed the same CPA if the UAS has sufficient speed to trade for altitude. Level turn results are less impacted by specific excess power and are presented as a function of turn rate. The effect of altitude is also discussed for the turns. Next steps and future work are discussed. Future studies will lead to better quantification of the preliminary results and cover the remainder of the proposed test matrix. It is anticipated that this will be done in conjunction with RTCA SC-228 over the next few months.

Jack, Devin P.↗
NASA NTRSDate not supplied

Monte Carlo Simulations for Evaluating the Accuracy of GLM Detection Efficiency and False Alarm Rate Retrievals

The performance of the Geostationary Lightning Mapper has been evaluated through comparison with other satellite lightning sensors and ground-based networks. However, because the performance of these reference sensors is both imperfect and imperfectly known, the true performance of GLM can only be estimated through such a process. In particular, GLM performance metrics such as detection efficiency (DE) and false alarm rate (FAR) retrieved through comparison with reference networks are affected by those networks’ own DE, FAR, and spatiotemporal accuracy, as well as the selected flash matching criteria. This study presents follow-on results from an ongoing analysis that uses a Monte Carlo simulation-based inversion technique to quantify the effect on retrieved GLM performance of a reasonable range of reference network DE, FAR, spatiotemporal accuracy, and the associated geographic patterns of each. These results help quantify and bound the actual performance of GLM and the attendant uncertainties when comparing GLM to imperfect reference networks.

Katrina Virts↗
NASA NTRS1984

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗
NASA NTRS2014

Exploration of the Trade Space Between Unmanned Aircraft Systems Descent Maneuver Performance and Sense-and-Avoid System Performance Requirements

A need exists to safely integrate Unmanned Aircraft Systems (UAS) into the United States' National Airspace System. Replacing manned aircraft's see-and-avoid capability in the absence of an onboard pilot is one of the key challenges associated with safe integration. Sense-and-avoid (SAA) systems will have to achieve yet-to-be-determined required separation distances for a wide range of encounters. They will also need to account for the maneuver performance of the UAS they are paired with. The work described in this paper is aimed at developing an understanding of the trade space between UAS maneuver performance and SAA system performance requirements, focusing on a descent avoidance maneuver. An assessment of current manned and unmanned aircraft performance was used to establish potential UAS performance test matrix bounds. Then, near-term UAS integration work was used to narrow down the scope. A simulator was developed with sufficient fidelity to assess SAA system performance requirements. The simulator generates closest-point-of-approach (CPA) data from the wide range of UAS performance models maneuvering against a single intruder with various encounter geometries. Initial attempts to model the results made it clear that developing maneuver performance groups is required. Discussion of the performance groups developed and how to know in which group an aircraft belongs for a given flight condition and encounter is included. The groups are airplane, flight condition, and encounter specific, rather than airplane-only specific. Results and methodology for developing UAS maneuver performance requirements are presented for a descent avoidance maneuver. Results for the descent maneuver indicate that a minimum specific excess power magnitude can assure a minimum CPA for a given time-to-go prediction. However, smaller amounts of specific excess power may achieve or exceed the same CPA if the UAS has sufficient speed to trade for altitude. The results of this study will support UAS maneuver performance requirements development for integrating UAS in the NAS. The methods described are being used to help RTCA Special Committee 228 develop requirements.

Jack, Devin P.↗
NASA NTRS1998

The P-Mesh: A Commodity-based Scalable Network Architecture for Clusters

We designed a new network architecture, the P-Mesh which combines the scalability and fault resilience of a torus with the performance of a switch. We compare the scalability, performance, and cost of the hub, switch, torus, tree, and P-Mesh architectures. The latter three are capable of scaling to thousands of nodes, however, the torus has severe performance limitations with that many processors. The tree and P-Mesh have similar latency, bandwidth, and bisection bandwidth, but the P-Mesh outperforms the switch architecture (a lower bound for tree performance) on 16-node NAB Parallel Benchmark tests by up to 23%, and costs 40% less. Further, the P-Mesh has better fault resilience characteristics. The P-Mesh architecture trades increased management overhead for lower cost, and is a good bridging technology while the price of tree uplinks is expensive.

Nitzberg, Bill↗
NASA NTRS2013

Performance Evaluation of Large Aperture 'Polished Panel' Optical Receivers Based on Experimental Data

Recent interest in hybrid RF/Optical communications has led to the development and installation of a "polished-panel" optical receiver evaluation assembly on the 34-meter research antenna at Deep-Space Station 13 (DSS-13) at NASA's Goldstone Communications Complex. The test setup consists of a custom aluminum panel polished to optical smoothness, and a large-sensor CCD camera designed to image the point-spread function (PSF) generated by the polished aluminum panel. Extensive data has been obtained via realtime tracking and imaging of planets and stars at DSS-13. Both "on-source" and "off-source" data were recorded at various elevations, enabling the development of realistic simulations and analytic models to help determine the performance of future deep-space communications systems operating with on-off keying (OOK) or pulse-position-modulated (PPM) signaling formats with photon-counting detection, and compared with the ultimate quantum bound on detection performance for these modulations. Experimentally determined PSFs were scaled to provide realistic signal-distributions across a photon-counting detector array when a pulse is received, and uncoded as well as block-coded performance analyzed and evaluated for a well-known class of block codes.

on-off keying (OOK)↗