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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

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.↗
NASA NTRS1990

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.↗
NASA NTRS1990

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.↗
NASA NTRS1990

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.↗
NASA NTRS1989

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.↗
NASA NTRS1990

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.↗
NASA NTRS1991

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.↗
NASA NTRS1992

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.↗
NASA NTRS1993

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↗
NASA NTRS1993

Dynamic programming on a shared-memory multiprocessor

Three new algorithms for solving dynamic programming problems on a shared-memory parallel computer are described. All three algorithms attempt to balance work load, while keeping synchronization cost low. In particular, for a multiprocessor having p processors, an analysis of the best algorithm shows that the arithmetic cost is O(n-cubed/6p) and that the synchronization cost is O(absolute value of log sub C n) if p much less than n, where C = (2p-1)/(2p + 1) and n is the size of the problem. The low synchronization cost is important for machines where synchronization is expensive. Analysis and experiments show that the best algorithm is effective in balancing the work load and producing high efficiency.

Edmonds, Phil↗
NASA NTRS1993

Prediction-based dynamic load-sharing heuristics

The authors present dynamic load-sharing heuristics that use predicted resource requirements of processes to manage workloads in a distributed system. A previously developed statistical pattern-recognition method is employed for resource prediction. While nonprediction-based heuristics depend on a rapidly changing system status, the new heuristics depend on slowly changing program resource usage patterns. Furthermore, prediction-based heuristics can be more effective since they use future requirements rather than just the current system state. Four prediction-based heuristics, two centralized and two distributed, are presented. Using trace driven simulations, they are compared against random scheduling and two effective nonprediction based heuristics. Results show that the prediction-based centralized heuristics achieve up to 30 percent better response times than the nonprediction centralized heuristic, and that the prediction-based distributed heuristics achieve up to 50 percent improvements relative to their nonprediction counterpart.

Goswami, Kumar K.↗
NASA NTRS1994

Dual-Arm Generalized Compliant Motion With Shared Control

Dual-Arm Generalized Compliant Motion (DAGCM) primitive computer program implementing improved unified control scheme for two manipulator arms cooperating in task in which both grasp same object. Provides capabilities for autonomous, teleoperation, and shared control of two robot arms. Unifies cooperative dual-arm control with multi-sensor-based task control and makes complete task-control capability available to higher-level task-planning computer system via large set of input parameters used to describe desired force and position trajectories followed by manipulator arms. Some concepts discussed in "A Generalized-Compliant-Motion Primitive" (NPO-18134).

Backes, Paul G.↗
NASA NTRS1987

Resource sharing on CSMA/CD networks in the presence of noise

Resource sharing on carrier sense multiple access with collision detection (CSMA/CD) networks can be accomplished by using window-control algorithms for bus contention. The window-control algorithms are designed to grant permission to transmit to the station with the minimum contention parameter. Proper operation of the window-control algorithm requires that all stations sense the same state of the newtork in each contention slot. Noise causes the state of the network to appear as a collision. False collisions can cause the window-control algorithm to terminate without isolating any stations. A two-phase window-control protocol and approximate recurrence equation with noise as a parameter to improve the performance of the window-control algorithms in the presence of noise are developed. The results are compared through simulation, with the approximate recurrence equation yielding the best overall performance. Noise is even a bigger problem when it is not detected by all stations. In such cases it is possible for the window boundaries of the contending stations to become out of phase. Consequently, it is possible to isolate a station other than the one with the minimum contention parameter. To guarantee proper isolation of the minimum, a broadcast phase must be added after the termination of the algorithm. The protocol required to correct the window-control algorithm when noise is not detected by all stations is discussed.

Dinschel, Duane Edward↗
NASA NTRS1991

Communications infrastructure requirements for telemedicine/telehealth in the context of planning for and responding to natural disasters: Considering the need for shared regional networks

During the course of recent years the frequency and magnitude of major disasters - of natural, technological, or ecological origin - have made the world community dramatically aware of the immense losses of human life and economic resources that are caused regularly by such calamities. Particularly hard hit are developing countries, for whom the magnitude of disasters frequently outstrips the ability of the society to cope with them. In many cases this situation can be prevented, and the recent trend in disaster management has been to emphasize the importance of preparedness and mitigation as a means of prevention. In cases of disaster, a system is needed to respond to relief requirements, particularly the delivery of medical care. There is no generic telecommunications infrastructure appropriate for the variety of applications in medical care and disaster management. The need to integrate telemedicine/telehealth into shared regional disaster management telecommunications networks is discussed. Focus is on the development of infrastructure designed to serve the needs of disaster prone regions of the developing world.

Scott, John Carver↗
NASA NTRS1993

Avoiding and tolerating latency in large-scale next-generation shared-memory multiprocessors

A scalable solution to the memory-latency problem is necessary to prevent the large latencies of synchronization and memory operations inherent in large-scale shared-memory multiprocessors from reducing high performance. We distinguish latency avoidance and latency tolerance. Latency is avoided when data is brought to nearby locales for future reference. Latency is tolerated when references are overlapped with other computation. Latency-avoiding locales include: processor registers, data caches used temporally, and nearby memory modules. Tolerating communication latency requires parallelism, allowing the overlap of communication and computation. Latency-tolerating techniques include: vector pipelining, data caches used spatially, prefetching in various forms, and multithreading in various forms. Relaxing the consistency model permits increased use of avoidance and tolerance techniques. Each model is a mapping from the program text to sets of partial orders on program operations; it is a convention about which temporal precedences among program operations are necessary. Information about temporal locality and parallelism constrains the use of avoidance and tolerance techniques. Suitable architectural primitives and compiler technology are required to exploit the increased freedom to reorder and overlap operations in relaxed models.

Probst, David K.↗
NASA NTRS1994

Shared virtual memory and generalized speedup

Generalized speedup is defined as parallel speed over sequential speed. The generalized speedup and its relation with other existing performance metrics, such as traditional speedup, efficiency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, it was shown that the difference between the generalized speedup and the traditional speedup lies in the definition of the efficiency of uniprocessor processing, which is a very important issue in shared virtual memory machines. A scientific application was implemented on a KSR-1 parallel computer. Experimental and theoretical results show that the generalized speedup is distinct from the traditional speedup and provides a more reasonable measurement. In the study of different speedups, various causes of superlinear speedup are also presented.

Sun, Xian-He↗
NASA NTRS1994

A Space Station robot walker and its shared control software

In this paper, we first briefly overview the update of the self-mobile space manipulator (SMSM) configuration and testbed. The new robot is capable of projecting cameras anywhere interior or exterior of the Space Station Freedom (SSF), and will be an ideal tool for inspecting connectors, structures, and other facilities on SSF. Experiments have been performed under two gravity compensation systems and a full-scale model of a segment of SSF. This paper presents a real-time shared control architecture that enables the robot to coordinate autonomous locomotion and teleoperation input for reliable walking on SSF. Autonomous locomotion can be executed based on a CAD model and off-line trajectory planning, or can be guided by a vision system with neural network identification. Teleoperation control can be specified by a real-time graphical interface and a free-flying hand controller. SMSM will be a valuable assistant for astronauts in inspection and other EVA missions.

Xu, Yangsheng↗