Search NASA⌕ Search

SEARCH · Search NASA

Results for “shared”

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 217 records · Page 12

Force-reflective teleoperated system with shared and compliant control capabilities

The force-reflecting teleoperator breadboard is described. It is the first system among available Research and Development systems with the following combined capabilities: (1) The master input device is not a replica of the slave arm. It is a general purpose device which can be applied to the control of different robot arms through proper mathematical transformations. (2) Force reflection generated in the master hand controller is referenced to forces and moments measured by a six DOF force-moment sensor at the base of the robot hand. (3) The system permits a smooth spectrum of operations between full manual, shared manual and automatic, and full automatic (called traded) control. (4) The system can be operated with variable compliance or stiffness in force-reflecting control. Some of the key points of the system are the data handling and computing architecture, the communication method, and the handling of mathematical transformations. The architecture is a fully synchronized pipeline. The communication method achieves optimal use of a parallel communication channel between the local and remote computing nodes. A time delay box is also implemented in this communication channel permitting experiments with up to 8 sec time delay. The mathematical transformations are computed faster than 1 msec so that control at each node can be operated at 1 kHz servo rate without interpolation. This results in an overall force-reflecting loop rate of 200 Hz.

Szakaly, Z.↗

Design for steering accuracy in antenna arrays using shared optical phase shifters

Uniform linear phased arrays where many radiating elements share a relatively small number of phase shifters are investigated. Such architectures arise in arrays which derive the time delays in the signal paths from a small group of independent phase shifters. In particular, a true time-delay device which has been suggested recently for optically controlled arrays is used as the basic phase shifter. Different architectures, viz. alternative procedures of deriving the necessary time delay for each antenna in the face of phase-shifter inaccuracies, are examined. The variance of the steered beam's direction is used as the performance criterion. The direction-optimal architecture is obtained by means of quadratic programming, and is shown not to be unique. The nonuniqueness of the optimal architecture is exploited to improve other characteristics of the array's beam shape, and the optimal solution is shown to compare favorably with a suboptimal interleaved solution which is easier to implement.

Kam, Moshe↗

Space Station heat pipe advanced radiator element (SHARE) flight test results and analysis

The SHARE experiment, which consisted of a single 51 ft long by 1 ft wide prototypical Space Station heat pipe radiator panel, was flown aboard STS-29 in March 1989. Several problems were uncovered during the flight which limited performance. Extensive post-flight analysis has revealed that the manifold connecting the evaporator and condenser sections did not prime properly in 0-g, and that a mismatch in hydraulic diameters between the evaporator and condenser caused large bubbles to be present in the liquid channel at startup. These bubbles subsequently became trapped at the evaporator entrance, halting liquid flow and causing premature dryout of the evaporator wall grooves. The experiment did demonstrate heat pipe transport capability of up to 1572 W with near isothermality in both the evaporator and condenser for short periods of time.

Kosson, Robert↗

Visual scanning with or without spatial uncertainty and time-sharing performance

An experiment is reported that examines the pattern of task interference between visual scanning as a sequential and selective attention process and other concurrent spatial or verbal processing tasks. A distinction is proposed between visual scanning with or without spatial uncertainty regarding the possible differential effects of these two types of scanning on interference with other concurrent processes. The experiment required the subject to perform a simulated primary tracking task, which was time-shared with a secondary spatial or verbal decision task. The relevant information that was needed to perform the decision tasks were displayed with or without spatial uncertainty. The experiment employed a 2 x 2 x 2 design with types of scanning (with or without spatial uncertainty), expected scanning distance (low/high), and codes of concurrent processing (spatial/verbal) as the three experimental factors. The results provide strong evidence that visual scanning as a spatial exploratory activity produces greater task interference with concurrent spatial tasks than with concurrent verbal tasks. Furthermore, spatial uncertainty in visual scanning is identified to be the crucial factor in producing this differential effect.

Liu, Yili↗

Cache-based error recovery for shared memory multiprocessor systems

A multiprocessor cache-based checkpointing and recovery scheme for of recovering from transient processor errors in a shared-memory multiprocessor with private caches is presented. New implementation techniques that use checkpoint identifiers and recovery stacks to reduce performance degradation in processor utilization during normal execution are examined. This cache-based checkpointing technique prevents rollback propagation, provides for rapid recovery, and can be integrated into standard cache coherence protocols. An analytical model is used to estimate the relative performance of the scheme during normal execution. Extensions that take error latency into account are presented.

Wu, Kun-Lung↗

Error recovery in shared memory multiprocessors using private caches

The problem of recovering from processor transient faults in shared memory multiprocesses systems is examined. A user-transparent checkpointing and recovery scheme using private caches is presented. Processes can recover from errors due to faulty processors by restarting from the checkpointed computation state. Implementation techniques using checkpoint identifiers and recovery stacks are examined as a means of reducing performance degradation in processor utilization during normal execution. This cache-based checkpointing technique prevents rollback propagation, provides rapid recovery, and can be integrated into standard cache coherence protocols. An analytical model is used to estimate the relative performance of the scheme during normal execution. Extensions to take error latency into account are presented.

Wu, Kun-Lung↗

A Byzantine resilient processor with an encoded fault-tolerant shared memory

The memory requirements for ultra-reliable computers are expected to increase due to future increases in mission functionality and operating-system requirements. This increase will have a negative effect on the reliability and cost of the system. Increased memory size will also reduce the ability to reintegrate a channel after a transient fault, since the time required to reintegrate a channel in a conventional fault-tolerant processor is dominated by memory realignment time. A Byzantine Resilient Fault-Tolerant Processor with Fault-Tolerant Shared Memory (FTP/FTSM) is presented as a solution to these problems. The FTSM uses an encoded memory system, which reduces the memory requirement by one-half compared to a conventional quad-FTP design. This increases the reliability and decreases the cost of the system. The realignment problem is also addressed by the FTSM. Because any single error is corrected upon a read from the FTSM, a faulty channel's corrupted memory does not need realignment before reintegration of the faulty channel. A combination of correct-on-access and background scrubbing is proposed to prevent the accumulation of transient errors in the memory. With a hardware-implemented scrubber, the scrubbing cycle time, and therefore the memory fault latency, can be upper-bounded at a small value. This technique increases the reliability of the memory system and facilitates validation of its reliability model.

Butler, Bryan↗

UMI - An interactive supervisory and shared control system for telerobotics

An interactive user interface, User-Macro-Interface (UMI), and its complete task execution system are developed and implemented for utilization by an operator to describe, simulate and execute tasks on a multiarm telerobot. The sequences or primitives can be executed on a graphics simulator or on the JPL Telerobot which incorporates two task execution manipulators, one manipulation used for positioning cameras, and two 6-degree-of-freedom force-reflecting hand controllers employed for shared and teleoperation modes of execution. The UMI interface is to be used as the operator interface at a local command site to prepare and send commands to a remote space telerobot.

Backes, Paul G.↗

Implementation of two projection methods on a shared memory multiprocessor - DEC VAX 6240

The relative performance of two iterative schemes, based on projection techniques, is compared on a shared memory multiprocessor - VAX 6240. The CG accelerated Block-SSOR method and the CG accelerated Symmetric-Kaczmarz method are considered for the solution of large sparse nonsymmetric systems of linear equations. It is shown that the regular structure of many matrices can be exploited by the CG-accelerated Block-SSOR method to provide good speedup in a multiprocessing environment. However, the CG accelerated Symmetric-Kaczmarz method, while being a viable alternative on a scalar machine, is unable to benefit from multiprocessing.

Kamath, C.↗

Explicit time integration of finite element models on a vectorized, concurrent computer with shared memory

The implementation of a nonlinear explicit program on a vectorized, concurrent computer with shared memory is described and studied. The conflict between vectorization and concurrency is described and some guidelines are given for optimal block sizes. Several example problems are summarized to illustrate the types of speed-ups which can be achieved by reprogramming as compared to compiler optimization.

Gilbertsen, Noreen D.↗

A proposal for risk sharing in the development of a lunar oxygen plant

The production of lunar oxygen for use in a NASA lunar outpost program could provide a profitable investment for nongovernment development, savings for government, and an initiation of a new resource of capital financing for space industrialization. A joint endeavor to share development risks between government and nongovernment investment is proposed, based on some early assessments of technical and financial feasibility for the project. Successful initial negotiations between government and nongovernment investors can establish the requirements for financing the project with private funds.

Duke, Michael B.↗

Rapid recovery from transient faults in the fault-tolerant processor with fault-tolerant shared memory

The Draper fault-tolerant processor with fault-tolerant shared memory (FTP/FTSM), which is designed to allow application tasks to continue execution during the memory alignment process, is described. Processor performance is not affected by memory alignment. In addition, the FTP/FTSM incorporates a hardware scrubber device to perform the memory alignment quickly during unused memory access cycles. The FTP/FTSM architecture is described, followed by an estimate of the time required for channel reintegration.

Harper, Richard E.↗

Efficient ICCG on a shared memory multiprocessor

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

Hammond, Steven W.↗

Spectrum sharing between AMSS(R) and MSS

Generic satellite systems will serve aeronautical, land, and maritime users in the US and Canada. One important service, the Aeronautical Mobile Satellite (Route) Service (AMS(R)S), pertains to the safety and regularity of flight. The North American systems are designed to assure that this vital safety service is not impaired in any way as it shares the spectrum and satellites with a large number and great variety of other users in other services. Two of the topics discussed are AMS(R)S requirements and AMS(R)S operation through American Mobile Satellite Corporation (AMSC) Satellites.

Anderson, Roy E.↗

Direct sequence spread spectrum CDMA in shared spectrum applications

Personal Communication Network (PCN) is an entirely wireless communication system with the capability of assessing the wired telephone system to reach anyone processing only a wired telephone. It is expected to compete with the existing mobile cellular system which connects directly to the wired telephone system. While many PCN systems employ TDMA technology, the PCN system described here uses Broadband CDMA (BCDMA(sup SM)) which is capable of sharing the spectrum with other users and which is extremely resistant to fading caused by multipath.

Schilling, Donald L.↗

Force-reflection and shared compliant control in operating telemanipulators with time delay

The performance of an advanced telemanipulation system in the presence of a wide range of time delays between a master control station and a slave robot is quantified. The contemplated applications include multiple satellite links to LEO, geosynchronous operation, spacecraft local area networks, and general-purpose computer-based short-distance designs. The results of high-precision peg-in-hole tasks performed by six test operators indicate that task performance decreased linearly with introduced time delays for both kinesthetic force feedback (KFF) and shared compliant control (SCC). The rate of this decrease was substantially improved with SCC compared to KFF. Task performance at delays above 1 s was not possible using KFF. SCC enabled task performance for such delays, which are realistic values for ground-controlled remote manipulation of telerobots in space.

Kim, Won S.↗

The 1992 town meetings: Toward a shared vision

With the goal of developing a shared vision for the future of NASA, the U.S. civil aeronautics and space agency conducted a series of town meetings across the country in Nov. and Dec. 1992. Specifically, NASA sought comment on the Agency's new vision statement and mission values, which were developed by the Agency's employees in an effort to redefine NASA's priorities and purpose for the 1990's and beyond. In practice, the meetings constituted a sort of nationwide brainstorming session on how to make aeronautics and space research more relevant to people's daily lives. Primary findings, NASA's action plan, town meeting proceedings, and conclusions are described.

Source record↗