Search NASA⌕ Search

SEARCH · Search NASA

Results for “shared error”

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

Testing New Programming Paradigms with NAS Parallel Benchmarks

Over the past decade, high performance computing has evolved rapidly, not only in hardware architectures but also with increasing complexity of real applications. Technologies have been developing to aim at scaling up to thousands of processors on both distributed and shared memory systems. Development of parallel programs on these computers is always a challenging task. Today, writing parallel programs with message passing (e.g. MPI) is the most popular way of achieving scalability and high performance. However, writing message passing programs is difficult and error prone. Recent years new effort has been made in defining new parallel programming paradigms. The best examples are: HPF (based on data parallelism) and OpenMP (based on shared memory parallelism). Both provide simple and clear extensions to sequential programs, thus greatly simplify the tedious tasks encountered in writing message passing programs. HPF is independent of memory hierarchy, however, due to the immaturity of compiler technology its performance is still questionable. Although use of parallel compiler directives is not new, OpenMP offers a portable solution in the shared-memory domain. Another important development involves the tremendous progress in the internet and its associated technology. Although still in its infancy, Java promisses portability in a heterogeneous environment and offers possibility to "compile once and run anywhere." In light of testing these new technologies, we implemented new parallel versions of the NAS Parallel Benchmarks (NPBs) with HPF and OpenMP directives, and extended the work with Java and Java-threads. The purpose of this study is to examine the effectiveness of alternative programming paradigms. NPBs consist of five kernels and three simulated applications that mimic the computation and data movement of large scale computational fluid dynamics (CFD) applications. We started with the serial version included in NPB2.3. Optimization of memory and cache usage was applied to several benchmarks, noticeably BT and SP, resulting in better sequential performance. In order to overcome the lack of an HPF performance model and guide the development of the HPF codes, we employed an empirical performance model for several primitives found in the benchmarks. We encountered a few limitations of HPF, such as lack of supporting the "REDISTRIBUTION" directive and no easy way to handle irregular computation. The parallelization with OpenMP directives was done at the outer-most loop level to achieve the largest granularity. The performance of six HPF and OpenMP benchmarks is compared with their MPI counterparts for the Class-A problem size in the figure in next page. These results were obtained on an SGI Origin2000 (195MHz) with MIPSpro-f77 compiler 7.2.1 for OpenMP and MPI codes and PGI pghpf-2.4.3 compiler with MPI interface for HPF programs.

Jin, H.↗

International "Intercomparison of 3-Dimensional (3D) Radiation Codes" (13RC)

An international "Intercomparison of 3-dimensional (3D) Radiation Codes" 13RC) has been initiated. It is endorsed by the GEWEX Radiation Panel, and funded jointly by the United States Department of Energy ARM program, and by the National Aeronautics and Space Administration Radiation Sciences program. It is a 3-phase effort that has as its goals to: (1) understand the errors and limits of 3D methods; (2) provide 'baseline' cases for future 3D code development; (3) promote sharing of 3D tools; (4) derive guidelines for 3D tool selection; and (5) improve atmospheric science education in 3D radiation.

Cahalan, Robert F.↗

Three Dimensional Atmospheric Radiative Transfer-Applications and Methods Comparison

We review applications of 3D radiative transfer in the atmosphere, emphasizing the wide spectrum of scales important to remote sensing and modeling of cloud fields, and the characteristic scales introduced into observed radiances and fluxes by the distribution of photon pathlengths at conservative and absorbing wavelengths. We define the "plane-parallel bias", which is a measure of the importance of 3D cloud structure in large-scale models, and the "independent pixel errors" that quantify the significance of 3D effects in remote sensing, and emphasize their relative magnitude and scale dependence. A variety of approaches in current use in 3D radiative transfer, and issues of speed, accuracy, and flexibility are summarized. We also describe a recently initiated "International Intercomparison of 3-Dimensional Radiation Codes", or I3RC. I3RC is a 3-phase effort that has as its goals to: (1) understand the errors and limits of 3D methods; (2) provide "baseline" cases for future 3D code development; (3) promote sharing of 3D tools; (4) derive guidelines for 3D tool selection; and (5) improve atmospheric science education in 3D radiative transfer. Selected results from Phases 1 and 2 of I3RC are discussed. These are taken from five cloud fields: a 1D field of bar clouds, a 2D radar-derived field, a 3D Landsat-derived field, a stratiform cloud from the model of C. Moeng, and a convective cloud from the model of B. Stevens. Computations have been carried out for three monochromatic wavelengths (one conservative, one absorptive, and one thermal) and two solar zenith angles (0, 60 degrees).

Cahalan, Robert F.↗

SPICE Module for the Satellite Orbit Analysis Program (SOAP)

A SPICE module for the Satellite Orbit Analysis Program (SOAP) precisely represents complex motion and maneuvers in an interactive, 3D animated environment with support for user-defined quantitative outputs. (SPICE stands for Spacecraft, Planet, Instrument, Camera-matrix, and Events). This module enables the SOAP software to exploit NASA mission ephemeris represented in the JPL Ancillary Information Facility (NAIF) SPICE formats. Ephemeris types supported include position, velocity, and orientation for spacecraft and planetary bodies including the Sun, planets, natural satellites, comets, and asteroids. Entire missions can now be imported into SOAP for 3D visualization, playback, and analysis. The SOAP analysis and display features can now leverage detailed mission files to offer the analyst both a numerically correct and aesthetically pleasing combination of results that can be varied to study many hypothetical scenarios. The software provides a modeling and simulation environment that can encompass a broad variety of problems using orbital prediction. For example, ground coverage analysis, communications analysis, power and thermal analysis, and 3D visualization that provide the user with insight into complex geometric relations are included. The SOAP SPICE module allows distributed science and engineering teams to share common mission models of known pedigree, which greatly reduces duplication of effort and the potential for error. The use of the software spans all phases of the space system lifecycle, from the study of future concepts to operations and anomaly analysis. It allows SOAP software to correctly position and orient all of the principal bodies of the Solar System within a single simulation session along with multiple spacecraft trajectories and the orientation of mission payloads. In addition to the 3D visualization, the user can define numeric variables and x-y plots to quantitatively assess metrics of interest.

Coggi, John↗

Multichannel error correction code decoder

A brief overview of a processing satellite for a mesh very-small-aperture (VSAT) communications network is provided. The multichannel error correction code (ECC) decoder system, the uplink signal generation and link simulation equipment, and the time-shared decoder are described. The testing is discussed. Applications of the time-shared decoder are recommended.

Wagner, Paul K.↗

An advanced teleoperator control system - Design and evaluation

The design goal of an advanced teleoperator control system is twofold: 1) to allow the operator's manual control to be robust to system nonlinearities such as time delays and operator's control errors, and 2) to support the high performance of teleoperation while reducing the operator's control burden by providing the master and slave arms with desirable dynamic properties and by allowing the slave arm to automatically perform such control tasks as compliance and force control in the form of task sharing. The authors present a novel teleoperator control system achieving the above design goal by taking the following into consideration: the human dynamics involved in generating control command based on visual and forced feedback is modeled and incorporated into the controller design and evaluation; the dynamic characteristics of slave and master arms are actively modified in such a way as to implement the desirable dynamic characteristics; and the force feedback is redefined in terms of the combination of opposition and force discrepancies in order to establish the required man/machine dynamic coordination under shared control. The proposed control system with human dynamics in the control loop is simulated and compared with a number of conventional methods in the presence of human control errors and time delays.

Lee, Sukhan↗

RACER: Effective Race Detection Using AspectJ

The limits of coding with joint constraints on detected and undetected error rates Programming errors occur frequently in large software systems, and even more so if these systems are concurrent. In the past, researchers have developed specialized programs to aid programmers detecting concurrent programming errors such as deadlocks, livelocks, starvation and data races. In this work we propose a language extension to the aspect-oriented programming language AspectJ, in the form of three new built-in pointcuts, lock(), unlock() and may be Shared(), which allow programmers to monitor program events where locks are granted or handed back, and where values are accessed that may be shared amongst multiple Java threads. We decide thread-locality using a static thread-local objects analysis developed by others. Using the three new primitive pointcuts, researchers can directly implement efficient monitoring algorithms to detect concurrent programming errors online. As an example, we expose a new algorithm which we call RACER, an adoption of the well-known ERASER algorithm to the memory model of Java. We implemented the new pointcuts as an extension to the Aspect Bench Compiler, implemented the RACER algorithm using this language extension and then applied the algorithm to the NASA K9 Rover Executive. Our experiments proved our implementation very effective. In the Rover Executive RACER finds 70 data races. Only one of these races was previously known.We further applied the algorithm to two other multi-threaded programs written by Computer Science researchers, in which we found races as well.

data analysis↗

Preliminary Error Characterization and Parametric Error Model for the Automatic Dependent Surveillance - Contract Extended Projected Profile Message

A critical component of Trajectory-Based Operations (TBO) is the ability for a consistent and accurate 4-dimensional trajectory (4DT) to be shared and synchronized between airborne and ground systems as well as amongst various ground automation systems. The Aeronautical Telecommunication Network—Baseline 2 (ATN-B2) standard defines the Extended Projected Profile (EPP) trajectory that can be sent via Automatic Dependent Surveillance-Contract (ADS-C) from an aircraft to ground automation. The EPP trajectory message contains a representation of the reference trajectory from an aircraft’s Flight Management System (FMS). In this work, a set of scenarios were run in a high-fidelity aircraft and FMS simulation to perform an initial characterization of EPP trajectory errors under a given set of conditions. The parameters investigated were the route length, route type, wind magnitude error, wind direction error, and with and without a required time-of-arrival (RTA) constraint. In addition, linear regression was used to identify a set of EPP error models for the cross-track, vertical, and time errors.

Guerreiro, Nelson M.↗

Performance evaluation of a six-axis generalized force-reflecting teleoperator

Work in real-time distributed computation and control has culminated in a prototype force-reflecting telemanipulation system having a dissimilar master (cable-driven, force-reflecting hand controller) and a slave (PUMA 560 robot with custom controller), an extremely high sampling rate (1000 Hz), and a low loop computation delay (5 msec). In a series of experiments with this system and five trained test operators covering over 100 hours of teleoperation, performance was measured in a series of generic and application-driven tasks with and without force feedback, and with control shared between teleoperation and local sensor referenced control. Measurements defining task performance included 100-Hz recording of six-axis force/torque information from the slave manipulator wrist, task completion time, and visual observation of predefined task errors. The task consisted of high precision peg-in-hole insertion, electrical connectors, velcro attach-de-attach, and a twist-lock multi-pin connector. Each task was repeated three times under several operating conditions: normal bilateral telemanipulation, forward position control without force feedback, and shared control. In shared control, orientation was locally servo controlled to comply with applied torques, while translation was under operator control. All performance measures improved as capability was added along a spectrum of capabilities ranging from pure position control through force-reflecting teleoperation and shared control. Performance was optimal for the bare-handed operator.

Hannaford, B.↗

Occultation by a possible third satellite of Neptune

The 24 May 1981 close approach of Neptune to an uncataloged star was photoelectrically monitored from two observatories separated by 6 kilometers parallel to the occultation track. An 8.1-second drop in signal, recorded simultaneously at both sites, is interpreted as resulting from the passage of a third satellite of Neptune in front of the star. From the duration of the event, the derived minimum diameter for an object sharing Neptune's motion is 180 kilometers. If the object was in Neptune's equatorial plane and there are no significant errors in the prediction ephemeris, the object was located at a distance of 3 Neptune radii from Neptune's center.

Reitsema, H. J.↗

MIDAS - A microcomputer-based image display and analysis system with full Landsat frame processing capabilities

Image Display and Analysis Systems (MIDAS) developed at NASA/Ames for the analysis of Landsat MSS images is described. The MIDAS computer power and memory, graphics, resource-sharing, expansion and upgrade, environment and maintenance, and software/user-interface requirements are outlined; the implementation hardware (including 32-bit microprocessor, 512K error-correcting RAM, 70 or 140-Mbyte formatted disk drive, 512 x 512 x 24 color frame buffer, and local-area-network transceiver) and applications software (ELAS, CIE, and P-EDITOR) are characterized; and implementation problems, performance data, and costs are examined. Planned improvements in MIDAS hardware and design goals and areas of exploration for MIDAS software are discussed.

Hofman, L. B.↗

Using Block-local Atomicity to Detect Stale-value Concurrency Errors

Data races do not cover all kinds of concurrency errors. This paper presents a data-flow-based technique to find stale-value errors, which are not found by low-level and high-level data race algorithms. Stale values denote copies of shared data where the copy is no longer synchronized. The algorithm to detect such values works as a consistency check that does not require any assumptions or annotations of the program. It has been implemented as a static analysis in JNuke. The analysis is sound and requires only a single execution trace if implemented as a run-time checking algorithm. Being based on an analysis of Java bytecode, it encompasses the full program semantics, including arbitrarily complex expressions. Related techniques are more complex and more prone to over-reporting.

Artho, Cyrille↗

Multichannel Error Correction Code Decoder

NASA Lewis Research Center's Digital Systems Technology Branch has an ongoing program in modulation, coding, onboard processing, and switching. Recently, NASA completed a project to incorporate a time-shared decoder into the very-small-aperture terminal (VSAT) onboard-processing mesh architecture. The primary goal was to demonstrate a time-shared decoder for a regenerative satellite that uses asynchronous, frequency-division multiple access (FDMA) uplink channels, thereby identifying hardware and power requirements and fault-tolerant issues that would have to be addressed in a operational system. A secondary goal was to integrate and test, in a system environment, two NASA-sponsored, proof-of-concept hardware deliverables: the Harris Corp. high-speed Bose Chaudhuri-Hocquenghem (BCH) codec and the TRW multichannel demultiplexer/demodulator (MCDD). A beneficial byproduct of this project was the development of flexible, multichannel-uplink signal-generation equipment.

Source record↗

Pulse-code-modulation baseline correction for low signal-to-noise ratios

Time-shared integrate-hold-dump circuits separate the dc level due to the signal /bit information/ from the dc signal due to the baseline error. The system detects the baseline error, filters it, and then algebraically adds enough voltage to a servo loop to reduce the error to zero.

Stephens, T. J.↗

Uniformly high-order accurate non-oscillatory schemes, 1

The construction and the analysis of nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws was begun. These schemes share many desirable properties with total variation diminishing schemes (TVD), but TVD schemes have at most first order accuracy, in the sense of truncation error, at extreme of the solution. A uniformly second order approximation was constucted, which is nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time. This is achieved via a nonoscillatory piecewise linear reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell.

Harten, A.↗

Numerical solution of the unsteady Navier-Stokes equation

The construction and the analysis of nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws are discussed. These schemes share many desirable properties with total variation diminishing schemes, but TVD schemes have at most first-order accuracy, in the sense of truncation error, at extrema of the solution. In this paper a uniformly second-order approximation is constructed, which is nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time. This is achieved via a nonoscillatory piecewise linear reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell.

Osher, Stanley J.↗

Local concurrent error detection and correction in data structures using virtual backpointers

A new technique, based on virtual backpointers, for local concurrent error detection and correction in linked data structures is presented. Two new data structures, the Virtual Double Linked List, and the B-tree with Virtual Backpointers, are described. For these structures, double errors can be detected in 0(1) time and errors detected during forward moves can be corrected in 0(1) time. The application of a concurrent auditor process to data structure error detection and correction is analyzed, and an implementation is described, to determine the effect on mean time to failure of a multi-user shared database system. The implementation utilizes a Sequent shared memory multiprocessor system operating on a shared databased of Virtual Double Linked Lists.

Li, C. C.↗

Local concurrent error detection and correction in data structures using virtual backpointers

A new technique, based on virtual backpointers, for local concurrent error detection and correction in linked data strutures is presented. Two new data structures, the Virtual Double Linked List, and the B-tree with Virtual Backpointers, are described. For these structures, double errors can be detected in 0(1) time and errors detected during forward moves can be corrected in 0(1) time. The application of a concurrent auditor process to data structure error detection and correction is analyzed, and an implementation is described, to determine the effect on mean time to failure of a multi-user shared database system. The implementation utilizes a Sequent shared memory multiprocessor system operating on a shared database of Virtual Double Linked Lists.

Li, Chung-Chi Jim↗