Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONCURRENT”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Factorization Of Positive Definite, Banded Hermitian Matrices

Report discusses application of Cholesky factorization algorithm to positive definite, banded Hermitian matrices. Begins by extending Cholesky factorization algorithm to cover uniformly-partitioned, banded, positive definite matrices of rank n that is real symmetric or Hermitian. Then two stratagems given for use of algorithm in concurrent-processing system in which N less than it has to be to enable factorization of matrix in as few serial steps as possible and where uniformly high efficiency expected from all processing elements. One of major purposes of this and related studies to maximize speedup and efficiency in system of concurrent-data-processing elements.

Salama, Moktar A.↗
NASA NTRS1989

Transputer parallel processing at NASA Lewis Research Center

The transputer parallel processing lab at NASA Lewis Research Center (LeRC) consists of 69 processors (transputers) that can be connected into various networks for use in general purpose concurrent processing applications. The main goal of the lab is to develop concurrent scientific and engineering application programs that will take advantage of the computational speed increases available on a parallel processor over the traditional sequential processor. Current research involves the development of basic programming tools. These tools will help standardize program interfaces to specific hardware by providing a set of common libraries for applications programmers. The thrust of the current effort is in developing a set of tools for graphics rendering/animation. The applications programmer currently has two options for on-screen plotting. One option can be used for static graphics displays and the other can be used for animated motion. The option for static display involves the use of 2-D graphics primitives that can be called from within an application program. These routines perform the standard 2-D geometric graphics operations in real-coordinate space as well as allowing multiple windows on a single screen.

Ellis, Graham K.↗
NASA NTRS1989

Algorithms and software for nonlinear structural dynamics

The objective of this research is to develop efficient methods for explicit time integration in nonlinear structural dynamics for computers which utilize both concurrency and vectorization. As a framework for these studies, the program WHAMS, which is described in Explicit Algorithms for the Nonlinear Dynamics of Shells (T. Belytschko, J. I. Lin, and C.-S. Tsay, Computer Methods in Applied Mechanics and Engineering, Vol. 42, 1984, pp 225 to 251), is used. There are two factors which make the development of efficient concurrent explicit time integration programs a challenge in a structural dynamics program: (1) the need for a variety of element types, which complicates the scheduling-allocation problem; and (2) the need for different time steps in different parts of the mesh, which is here called mixed delta t integration, so that a few stiff elements do not reduce the time steps throughout the mesh.

Belytschko, Ted↗
NASA NTRS1989

The Raid distributed database system

Raid, a robust and adaptable distributed database system for transaction processing (TP), is described. Raid is a message-passing system, with server processes on each site to manage concurrent processing, consistent replicated copies during site failures, and atomic distributed commitment. A high-level layered communications package provides a clean location-independent interface between servers. The latest design of the package delivers messages via shared memory in a configuration with several servers linked into a single process. Raid provides the infrastructure to investigate various methods for supporting reliable distributed TP. Measurements on TP and server CPU time are presented, along with data from experiments on communications software, consistent replicated copy control during site failures, and concurrent distributed checkpointing. A software tool for evaluating the implementation of TP algorithms in an operating-system kernel is proposed.

Bhargava, Bharat↗
NASA NTRS1990

Analysis and design of algorithm-based fault-tolerant systems

An important consideration in the design of high performance multiprocessor systems is to ensure the correctness of the results computed in the presence of transient and intermittent failures. Concurrent error detection and correction have been applied to such systems in order to achieve reliability. Algorithm Based Fault Tolerance (ABFT) was suggested as a cost-effective concurrent error detection scheme. The research was motivated by the complexity involved in the analysis and design of ABFT systems. To that end, a matrix-based model was developed and, based on that, algorithms for both the design and analysis of ABFT systems are formulated. These algorithms are less complex than the existing ones. In order to reduce the complexity further, a hierarchical approach is developed for the analysis of large systems.

Nair, V. S. Sukumaran↗
NASA NTRS1990

Low cost management of replicated data in fault-tolerant distributed systems

Many distributed systems replicate data for fault tolerance or availability. In such systems, a logical update on a data item results in a physical update on a number of copies. The synchronization and communication required to keep the copies of replicated data consistent introduce a delay when operations are performed. A technique is described that relaxes the usual degree of synchronization, permitting replicated data items to be updated concurrently with other operations, while at the same time ensuring that correctness is not violated. The additional concurrency thus obtained results in better response time when performing operations on replicated data. How this technique performs in conjunction with a roll-back and a roll-forward failure recovery mechanism is also discussed.

Joseph, Thomas A.↗
NASA NTRS1989

Airborne discrimination between ice and water - Application to the laser measurement of chlorophyll-in-water in a marginal ice zone

The concurrent active-passive measurement capabilities of the NASA Airborne Oceanographic Lidar have been used to (1) discriminate between ice and water in a large ice field within the Greenland Sea and (2) achieve the detection and measurement of chlorophyll-in-water by laser-induced and water-Raman-normalized pigment fluorescence. Passive upwelled radiances from sea ice are significantly stronger than those from the neighboring water, even when the optical receiver field-of-view is only partially filled with ice. Thus, weaker passive upwelled radiances, together with concurrently acquired laser-induced spectra, can rather confidently be assigned to the intervening water column. The laser-induced spectrum can then be processed using previously established methods to measure the chlorophyll-in-water concentration. Significant phytoplankton patchiness and elevated chlorophyll concentrations were found within the waters of the melting ice compared to ice-free regions just outside the ice field.

Hoge, Frank E.↗
NASA NTRS1989

Linking consistency with object/thread semantics - An approach to robust computation

This paper presents an object/thread based paradigm that links data consistency with object/thread semantics. The paradigm can be used to achieve a wide range of consistency semantics from strict atomic transactions to standard process semantics. The paradigm supports three types of data consistency. Object programmers indicate the type of consistency desired on a per-operation basis and the system performs automatic concurrency control and recovery management to ensure that those consistency requirements are met. This allows programmers to customize consistency and recovery on a per-application basis without having to supply complicated, custom recovery management schemes. The paradigm allows robust and nonrobust computation to operate concurrently on the same data in a well defined manner. The operating system needs to support only one vehicle of computation - the thread.

Chen, Raymond C.↗
NASA NTRS1990

Continuation of research into software for space operations support: Conversion of the display manager to X Windows/Motif, volume 2

NASA is currently using a set of applications called the Display Builder and Display Manager. They run on Concurrent systems and heavily depend on the Graphic Kernel System (GKS). At this time however, these two applications would more appropriately be developed in X Windows, in which a low X is used for all actual text and graphics display and a standard widget set (such as Motif) is used for the user interface. Use of the X Windows will increase performance, improve the user interface, enhance portability, and improve reliability. Prototype of X Window/Motif based Display Manager provides the following advantages over a GKS based application: improved performance by using a low level X Windows, display of graphic and text will be more efficient; improved user interface by using Motif; Improved portability by operating on both Concurrent and Sun workstations; and Improved reliability.

Collier, Mark D.↗
NASA NTRS1991

QUEST/Ada (query utility environment for software testing of Ada: The development of a program analysis environment for Ada, task 1, phase 3

The results of research and development efforts of the first six months of Task 1, Phase 3 of the project are presented. The goals of Phase 3 are: (1) to further refine the rule base and complete the comparative rule base evaluation; (2) to implement and evaluate a concurrency testing prototype; (3) to convert the complete (unit-level and concurrency) testing prototype to a workstation environment; and (4) to provide a prototype development document to facilitate the transfer of research technology to a working environment. These goals were partially met and the results are summarized.

Brown, David B.↗
NASA NTRS1991

Cockpit task management: A preliminary, normative theory

Cockpit task management (CTM) involves the initiation, monitoring, prioritizing, and allocation of resources to concurrent tasks as well as termination of multiple concurrent tasks. As aircrews have more tasks to attend to due to reduced crew sizes and the increased complexity of aircraft and the air transportation system, CTM will become a more critical factor in aviation safety. It is clear that many aviation accidents and incidents can be satisfactorily explained in terms of CTM errors, and it is likely that more accidents induced by poor CTM practice will occur in the future unless the issue is properly addressed. The first step in understanding and facilitating CTM behavior was the development of a preliminary, normative theory of CTM which identifies several important CTM functions. From this theory, some requirements for pilot-vehicle interfaces were developed which are believed to facilitate CTM. A prototype PVI was developed which improves CTM performance and currently, a research program is under way that is aimed at developing a better understanding of CTM and facilitating CTM performance through better equipment and procedures.

Funk, Ken↗
NASA NTRS1990

Time concurrency/phase-time synchronization in digital communications networks

Digital communications networks have the intrinsic capability of time synchronization which makes it possible for networks to supply time signals to some applications and services. A practical estimation method for the time concurrency on terrestrial networks is presented. By using this method, time concurrency capability of the Nippon Telegraph and Telephone Corporation (NTT) digital communications network is estimated to be better than 300 ns rms at an advanced level, and 20 ns rms at final level.

Kihara, Masami↗
NASA NTRS1991

Evolution of the Martian hydrosphere

The concept of the hydrological cycle is one of the greatest achievements in the understanding of nature. Leonardo da Vinci seems to have held two concurrent views of the cycle: an external process in which evaporation from ponded areas leads to precipitation and runoff from the land; and an internal process in which subsurface pressures from within the Earth force water upward. Endogenetic hypotheses for valley genesis on Mars maintain the necessary prolonged ground water flows by hydrothermal circulation associated with impact cratering or with volcanism. Ocean formation on Mars was episodic, mostly evidenced by the latest episodes. Coincident cataclysmic flood discharges to the northern plains, probably triggered by Tharsis volcanism, would lead to immense consequences. Potential volumes of ponded water are summarized. The outflow channels have a complex history of flooding events over a prolonged period of planetary history. It is hypothesized that episodic outbursts of concurrent discharge was triggered by planetary scale volcanism. The consequences of such episodes are summarized.

Baker, V.↗
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 NTRS1991

Maintaining consistency in distributed systems

In systems designed as assemblies of independently developed components, concurrent access to data or data structures normally arises within individual programs, and is controlled using mutual exclusion constructs, such as semaphores and monitors. Where data is persistent and/or sets of operation are related to one another, transactions or linearizability may be more appropriate. Systems that incorporate cooperative styles of distributed execution often replicate or distribute data within groups of components. In these cases, group oriented consistency properties must be maintained, and tools based on the virtual synchrony execution model greatly simplify the task confronting an application developer. All three styles of distributed computing are likely to be seen in future systems - often, within the same application. This leads us to propose an integrated approach that permits applications that use virtual synchrony with concurrent objects that respect a linearizability constraint, and vice versa. Transactional subsystems are treated as a special case of linearizability.

Birman, Kenneth P.↗
NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes communicating via shared objects, such as shared variables, queues, etc. The concept of wait-freedom was introduced to cope with process failures: each process that accesses a wait-free object is guaranteed to get a response even if all the other processes crash. However, if a wait-free object 'crashes,' all the processes that access that object are prevented from making progress. In this paper, we introduce the concept of fault-tolerant wait-free objects, and study the problem of implementing them. We give a universal method to construct fault-tolerant wait-free objects, for all types of 'responsive' failures (including one in which faulty objects may 'lie'). In sharp contrast, we prove that many common and interesting types (such as queues, sets, and test&set) have no fault-tolerant wait-free implementations even under the most benign of the 'non-responsive' types of failure. We also introduce several concepts and techniques that are central to the design of fault-tolerant concurrent systems: the concepts of self-implementation and graceful degradation, and techniques to automatically increase the fault-tolerance of implementations. We prove matching lower bounds on the resource complexity of most of our algorithms.

Jayanti, Prasad↗
NASA NTRS1992

Real-time processing of radar return on a parallel computer

NASA is working with the FAA to demonstrate the feasibility of pulse Doppler radar as a candidate airborne sensor to detect low altitude windshears. The need to provide the pilot with timely information about possible hazards has motivated a demand for real-time processing of a radar return. Investigated here is parallel processing as a means of accommodating the high data rates required. A PC based parallel computer, called the transputer, is used to investigate issues in real time concurrent processing of radar signals. A transputer network is made up of an array of single instruction stream processors that can be networked in a variety of ways. They are easily reconfigured and software development is largely independent of the particular network topology. The performance of the transputer is evaluated in light of the computational requirements. A number of algorithms have been implemented on the transputers in OCCAM, a language specially designed for parallel processing. These include signal processing algorithms such as the Fast Fourier Transform (FFT), pulse-pair, and autoregressive modelling, as well as routing software to support concurrency. The most computationally intensive task is estimating the spectrum. Two approaches have been taken on this problem, the first and most conventional of which is to use the FFT. By using table look-ups for the basis function and other optimizing techniques, an algorithm has been developed that is sufficient for real time. The other approach is to model the signal as an autoregressive process and estimate the spectrum based on the model coefficients. This technique is attractive because it does not suffer from the spectral leakage problem inherent in the FFT. Benchmark tests indicate that autoregressive modeling is feasible in real time.

Aalfs, David D.↗
NASA NTRS1991

The effects of task difficulty and resource requirements on attention strategies

The patterns of attention strategies for task difficulty/resource tasks for which experimental results are presented and analyzed support the hypothesis that subjects may adopt an alternating (rather than concurrent one) when compelled to do so by either the size or the complexity of a visual display. According to the multiple resource model, if subjects had been performing the two tasks concurrently, the cost of this strategy would have been shown by a decrement in the spatial format, rather than the verbal format, due to competition for the same resource. Subjects may apply different strategies as a function of task difficulty and/or resource demand.

King, Teresa↗