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 199 records · Page 11

Fracture control method for composite tanks with load sharing liners

The experimental program was based on the premise that the plastic sizing cycle, which each pressure vessel is subjected to prior to operation, acts as an effective proof test of the liner, screening out all flaws or cracks larger than a critical size. In doing so, flaw growth potential is available for cyclic operation at pressures less than the sizing pressure. Static fracture and cyclic life tests, involving laboratory type specimens and filament overwrapped tanks, were conducted on three liner materials: (1) 2219-T62 aluminum, (2) Inconel X750 STA, and (3) cryoformed 301 stainless steel. Variables included material condition, thickness, flaw size, flaw shape, temperature, sizing stress level, operating stress level and minimum-to-maximum operating stress ratio. From the empirical data base obtained, a procedure was established by which the service life of composite tanks with load sharing liners could be guaranteed with a high degree of confidence.

Bixler, W. D.↗

CTS digital video college curriculum-sharing experiment

NASA-Ames Research Center, Stanford University, and Carleton University, Ottawa, Canada, are participating in a joint experiment to evaluate the feasibility and effectiveness of college curriculum sharing using compressed digital television and the Communications Technology Satellite (CTS). Each university will offer televised courses to the other during the 1976-1977 academic year via CTS, a joint program by NASA and the Canadian Department of Communications. The video compression techniques to be demonstrated will enable economical interconnection of educational institutions using existing and planned domestic satellites.

Lumb, D. R.↗

College curriculum-sharing via CTS

Domestic communication satellites and video compression techniques will increase communication channel capacity and reduce cost of video transmission. NASA Ames Research Center, Stanford University and Carleton University are participants in an experiment to develop, demonstrate, and evaluate college course sharing techniques via satellite using video compression. The universities will exchange televised seminar and lecture courses via CTS. The experiment features real-time video compression with channel coding and quadra-phase modulation for reducing transmission bandwidth and power requirements. Evaluation plans and preliminary results of Carleton surveys on student attitudes to televised teaching are presented. Policy implications for the U.S. and Canada are outlined.

Hudson, H. E.↗

Lack of agreement over the use and ownership of the internationally shared resources (such as air space, outer space and the oceans) leading to international conflict

The lack of adequate institutional mechanisms to regulate, monitor and govern the use of commonly owned world resources appears to be politically destabilizing and subject to socioeconomic pressures of overpopulation, food shortages, cartelism, terrorism, and wealth distribution to developing countries. The capacity and propensity to wage war and its potential consequences are elaborated. It is shown that technology is one of the dominant factors affecting the exploration and management of commonly shared resources.

Source record↗

Power supply sharing in the Apollo telescope mount electrical power system

A modular dc power supply power sharing technique was developed for the Apollo telescope mount electrical power sytem on Skylab. The advantages and disadvantages of various techniques used are reviewed and compared. The new technique design is discussed, and results of its implementation in the power system are reviewed.

Lanier, R., Jr.↗

Circuit for automatic load sharing in parallel converter modules

A nondissipative circuit for automatic load sharing in parallel converter modules having push-pull power transistors is presented. Each transistor has a separate current-sensing transformer and an impedance-adjusting transformer in series with its collector. The impedance-adjusting transformer functions as a current-controlled variable impedance that is responsive to the difference between the peak collector current of the transistor and the average peak current of all collector currents of power transistors in all modules, thereby to control the collector currents of all power transistors with reference to the average peak collector current.

Nagano, S.↗

Carrier - Interference ratios for frequency sharing between satellite systems transmitting frequency modulated and digital television signals

As the data rates required for digitally encoded television are reduced, satellite systems employing the transmission of digitally encoded television will become attractive. It is likely that television transmitted in this format will be adjacent to or in the same frequency band as television transmissions in other modulation formats, so a knowledge of carrier to interference power ratios as a function of assessed picture quality will be required for frequency sharing between these different modulation formats. This paper presents the results of subjective and quantitative tests describing the results of interference to a particular digital television system from a frequency modulated (FM) television system, and for interference to an FM television system from a digital television system.

Barnes, S. P.↗

The economics of time shared computing: Congestion, user costs and capacity

Time shared systems permit the fixed costs of computing resources to be spread over large numbers of users. However, bottleneck results in the theory of closed queueing networks can be used to show that this economy of scale will be offset by the increased congestion that results as more users are added to the system. If one considers the total costs, including the congestion cost, there is an optimal number of users for a system which equals the saturation value usually used to define system capacity.

Agnew, C. E.↗

MPF: A portable message passing facility for shared memory multiprocessors

The design, implementation, and performance evaluation of a message passing facility (MPF) for shared memory multiprocessors are presented. The MPF is based on a message passing model conceptually similar to conversations. Participants (parallel processors) can enter or leave a conversation at any time. The message passing primitives for this model are implemented as a portable library of C function calls. The MPF is currently operational on a Sequent Balance 21000, and several parallel applications were developed and tested. Several simple benchmark programs are presented to establish interprocess communication performance for common patterns of interprocess communication. Finally, performance figures are presented for two parallel applications, linear systems solution, and iterative solution of partial differential equations.

Malony, Allen D.↗

Parallel discrete event simulation: A shared memory approach

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Reed, Daniel A.↗

Remote sensing frequency sharing studies, tasks 1, 2, 5, and 6

The following tasks are discussed: adjacent and harmonic band analysis; analysis of impact of sensor resolution on interference; development of performance criteria, interference criteria, sharing criteria, and coordination criteria; and spectrum engineering for NASA microwave sensor projects.

Boyd, Douglas↗

The impact of domain partitioning on the performance of a shared memory multiprocessor

The impact of the choice of domain partition/stencil pairs in solving elliptic partial differential equations on a multiprocessor system with both global shared memory and local memory is considered. A parallel execution time model is given for square and hexagonal partitions using both five-point and nine-point star discretizations. Results from the model for a particular multiprocessor system show that keeping copies of partition boundaries in local memory significantly improves performance.

Patrick, Merrell L.↗

Time-sharing visual and auditory tracking tasks

An experiment is described which examined the benefits of distributing the input demands of two tracking tasks as a function of task integrality. Visual and auditory compensatory tracking tasks were utilized. Results indicate that presenting the two tracking signals in two input modalities did not improve time-sharing efficiency. This was attributed to the difficulty insensitivity phenomenon.

Tsang, Pamela S.↗

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗

Shared resource control between human and computer

The advantages of an AI system of actively monitoring human control of a shared resource (such as a telerobotic manipulator) are presented. A system is described in which a simple AI planning program gains efficiency by monitoring human actions and recognizing when the actions cause a change in the system's assumed state of the world. This enables the planner to recognize when an interaction occurs between human actions and system goals, and allows maintenance of an up-to-date knowledge of the state of the world and thus informs the operator when human action would undo a goal achieved by the system, when an action would render a system goal unachievable, and efficiently replans the establishment of goals after human intervention.

Hendler, James↗

The sharing of rights and information in a capability-based protection system

The question of sharing of rights and information in the Take-Grant Protection Model is examined by concentrating on the similarities between the two; in order to do this, new theorems are stated and proven for each that specifically show the similarities. The proof for one of the original theorems is also provided. These statements of necessary and sufficient conditions are contrasted to illustrate the proposition that transferring rights and transferring information are fundamentally the same, as one would expect in a capability-based system. Directions are then discussed for future research in light of these results.

Bishop, Matt↗

Load sharing in distributed real-time systems with state-change broadcasts

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Shin, Kang G.↗

A robot arm simulation with a shared memory multiprocessor machine

A parallel processing scheme for a single chain robot arm is presented for high speed computation on a shared memory multiprocessor. A recursive formulation that is derived from a virtual work form of the d'Alembert equations of motion is utilized for robot arm dynamics. A joint drive system that consists of a motor rotor and gears is included in the arm dynamics model, in order to take into account gyroscopic effects due to the spinning of the rotor. The fine grain parallelism of mechanical and control subsystem models is exploited, based on independent computation associated with bodies, joint drive systems, and controllers. Efficiency and effectiveness of the parallel scheme are demonstrated through simulations of a telerobotic manipulator arm. Two different mechanical subsystem models, i.e., with and without gyroscopic effects, are compared, to show the trade-off between efficiency and accuracy.

Kim, Sung-Soo↗