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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Data parallel sorting for particle simulation

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Dagum, Leonardo↗
NASA NTRS2021

Time-Critical Coordination of UAS with Non-Ideal Autopilots under Lossy Communication Networks

In this presentation we will explore several distributed consensus algorithms developed to maintain coordination among a fleet of heterogeneous UAS subject to external disturbances. An overview of the network assumptions and autopilot performance bounds required to meet the coordination objective will be provided. In particular, we will leverage passivity-based stability conditions for bidirectional networks that require the communication graph to be connected in an integral sense, but may fail to connect pointwise in time during the entire mission. Non-ideal autopilots that can only track a desired speed profile with a prescribed precision induce an error in vehicle coordination. The autopilot performance bounds will be propagated through the coordination dynamics to understand the limits introduced by autopilots.

conensus↗
NASA NTRS1997

Multidimensional Trellis Coded Phase Modulation Using a Multilevel Concatenation Approach: Codes for AWGN and Fading Channels - Part 2

In this paper, we will use the construction technique proposed in to construct multidimensional trellis coded modulation (TCM) codes for both the additive white Gaussian noise (AWGN) and the fading channels. Analytical performance bounds and simulation results show that these codes perform very well and achieve significant coding gains over uncoded reference modulation systems. In addition, the proposed technique can be used to construct codes which have a performance/decoding complexity advantage over the codes listed in literature.

Rajpal, Sandeep↗
NASA NTRS1996

Dataflow Design Tool: User's Manual

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Jones, Robert L., III↗
NASA NTRS1973

Bounds on the performance of a class of digital communication systems

Bounds on the capacity of a class of digital communication channels are derived. Equating the bounds on capacity to rate-distortion functions of (typical) sources in turn produces bounds on the performance of a class of digital communication systems. For ratios of squared quantization level to noise variance much less than one, the power requirements for this class of digital communication systems are shown to be within approximately 3 dB of the theoretical optimum.

Polk, D. R.↗
NASA NTRS1990

Computational efficiency of parallel combinatorial OR-tree searches

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

Li, Guo-Jie↗
DOE OSTI2020

Detecting Low-level Radiation Sources Using Border Monitoring Gamma Sensors

We consider a problem of detecting a low-level radiation source using a network of Gamma spectral sensors placed on the periphery of a monitored region. We propose a computationally light-weight, correlation-based method which is primarily intended for systems with limited computing capacity. Sensor measurements are combined at the fusion by first generating decisions at each time step and then taking their majority vote within a time widow. At each time step, decisions are generated using two strategies: (i) SUM method based on a threshold decision on a correlation statistic derived from measurements from all sensors, and (ii) OR method based on logical-OR of threshold decisions based on correlations statistics of individual sensor measurements. We derive analytical performance bounds for false alarm rates of SUM and OR methods, and show that their performance is enhanced by the temporal smoothing of majority vote within a time window. Using measurements from a test campaign, we generate a border monitoring scenario with twelve 2"x2" NaI Gamma sensors deployed on the periphery of 42m x 42m outdoor region. A Cs-137 source is moved in a straight-line across this region, starting several meters outside and finally moving away from it. We illustrate the performance of both correlation-based detection methods, and compare their performances with each other and with a particle filter method. Overall, under small false-alarm conditions, the OR fusion is found to produce better detection performance.

Sen, Satyabrata↗
NASA NTRS1991

ATAMM analysis tool

Diagnostics software for analyzing Algorithm to Architecture Mapping Model (ATAMM) based concurrent processing systems is presented. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. The tool graphically displays algorithm activities and processor activities for evaluation of the behavior and performance of an ATAMM based system. The tool's measurement capabilities indicate computing speed, throughput, concurrency, resource utilization, and overhead. Evaluations are performed on a simulated system using the software tool. The tool is used to estimate theoretical lower bound performance. Analysis results are shown to be comparable to the predictions.

Jones, Robert↗
NASA NTRS1995

Transfer function bounds on the performance of turbo codes

In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are useful in estimating the 'error floor' that is difficult to measure by simulation, and they provide insight on how to lower this floor. More refined bounds are needed for accurate performance measures at lower signal-to-noise ratios.

Divsalar, D.↗
NASA NTRS1995

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Jones, Robert L., III↗
DOE OSTI2021

Review of Literature Related to Nuclear Data Mini-Apps

his document reviews nuclear data mini-apps prevalent in the published scientific literature. It is intended to identify algorithmic and computer architecture considerations of relevance to optimizing GIDI/MCGIDI for GPU-based architectures. While some of the works considered here focus on CPU-based architectures, the performance-limiting factors and mitigating strategies identified often extend to GPU-based architectures, particularly in the context of latency-bound performance. A brief overview of the cross section (XS) lookup process is given in Section 1 and a detailed analysis of nuclear data mini-apps follows in Section 2. Concluding remarks are offered in Section 3.

42 ENGINEERING↗
DOE OSTI2021

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2007

Smart Sensor Node Development, Testing and Implementation for ISHM

A main design criterion for a robust Integrated Systems Health Management (ISHM) system is summed up best by the statement "No data is better than bad data". Traditional data acquisition systems are calibrated in a controlled environment and guaranteed to perform bounded by their tested conditions. To successfully design and implement a real world ISHM system, the data acquisition and signal conditioning needs to function in an uncontrolled environment. Development and testing focuses on a design with the ability to self check in order to extend calibration times, report internal faults and drifts and notify the overall system when the data acquisition is not performing as it should. All of this will be designed in a system that is flexible, requiring little redesign to be deployed on a wide variety of systems. Development progress and testing results will be reported.

Mengers, Timothy↗
NASA NTRS2007

Smart Sensor Node Development, Testing and Implementation for Rocket Propulsion Systems

Successful design and implementation of an Integrated System Health Management (ISHM) approach for rocket propulsion systems requires the capability improve the reliability of complex systems by detecting and diagnosing problems. One of the critical elements in the ISHM is an intelligent sensor node for data acquisition that meets specific requirements for rocket motor testing including accuracy, sample rate and size/weight. Traditional data acquisition systems are calibrated in a controlled environment and guaranteed to perform bounded by their tested conditions. In a real world ISHM system, the data acquisition and signal conditioning needs to function in an uncontrolled environment. Development and testing of this sensor node focuses on a design with the ability to self check in order to extend calibration times, report internal faults and drifts and notify the overall system when the data acquisition is not performing as it should. All of this will be designed within a system that is flexible, requiring little re-design to be deployed on a wide variety of systems. Progress in this design and initial testing of prototype units will be reported.

Mengers, Timothy R.↗
NASA NTRS1999

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.↗
DOE OSTI2020

Filtering adaptive output feedback control for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics

This article synthesizes a filtering adaptive output feedback controller for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics. The multivariable nonlinear systems under consideration have both matched and mismatched uncertainties, which satisfy the semiglobal Lipschitz condition. The unmodeled dynamics are bounded-input bounded-output stable. By adopting an estimation/cancellation strategy, a piecewise constant adaptive law drives the estimation error to zero at every time instant, which yields the adaptive parameters; a disturbance rejection control law is designed to compensate the nonlinear uncertainties within the bandwidth of low-pass filters. The matched uncertainties are cancelled directly by adopting their opposite in the control signal, while a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. A feedforward control law is designed to track a given command. Since the virtual reference system defines the best performance that can be achieved by the closed-loop system, the uniform performance bounds are derived for the states and control signals via comparison. Both numerical and practical examples are provided to illustrate the effectiveness of the proposed filtering adaptive output feedback control architecture, comparisons with the model reference adaptive control demonstrates the superiority of the proposed control method.

filtering adaptive control, mismatched uncertainit↗