Search NASA⌕ Search

SEARCH · Search NASA

Results for “data flow”

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 37 records · Page 2

Spacelab uplink/downlink data flow and formats

The results of an analysis of the Spacelab (SL) data uplink/downlink structure and those data system elements associated with the support of this data flow are presented. Specific objectives of this report are to present the results of the following analyses: (1) operations of the SL high rate multiplexer, including format structure, data rates, format combinations, format switching, etc.; (2) operations of SL data recorders to include the definition of modes, data rates and forms; (3) operations of the high rate demultiplexer as described above; (4) potential experiment data formats defining formatting parameters to be considered in decommutation analysis; (5) SL computer input/output (I/O) decommutation channels, including the definition of structure, quantity and use of this I/O data; (6) detailed requirements of the data quality monitoring philosophy for this function.

Kandefer, F.↗

Data handling and data flow design and their application in the space telescope guide star selection system

The data formats and data encapsulation techniques used in the Space Telescope Guide Star Selection System (GSSS) are described. Emphasis is given to the use of image field and object list transformation to organize and refine high-levels of data flow from Space Telescope. The application of the Ada programming language to data encapsulation techniques is discussed in detail.

Rosenthal, D. A.↗

Round-Robin approach to data flow optimization

A large data base, circular in structure, was required (for the Voyager Mission to Jupiter/Saturn) with the capability to completely update the data every four hours during high activity periods. The data is stored in key ordered format for retrieval but is not input in key order. Existing access methods for large data bases with rapid data replacement by keys become inefficient as the volume of data being replaced grows. The Round-Robin method was developed to alleviate this problem. The Round-Robin access method allows rapid updating of the data with continuous self cleaning where the oldest data (by key) is deleted and the newest data (by key) is kept regardless of the order of input.

Witt, J.↗

Algorithms For Postprocessing Computed Flow Data

Paper discusses algorithms used to make visible displays from arrays of numerical data representing computed flow fields. Intended to help researchers discern flow structures. Displays include, principally, contours and particle traces on two-dimensional and three-dimensional grids.

Buning, Pieter↗

Application of image processing techniques to fluid flow data analysis

The application of color coding techniques used in processing remote sensing imagery to analyze and display fluid flow data is discussed. A minicomputer based color film recording and color CRT display system is described. High quality, high resolution images of two-dimensional data are produced on the film recorder. Three dimensional data, in large volume, are used to generate color motion pictures in which time is used to represent the third dimension. Several applications and examples are presented. System hardware and software is described.

Giamati, C. C.↗

Performance evaluation of a simulated data-flow computer with low-resolution actors

Basic problems related to the exploitation of parallelism in a program include sequencing of the instructions and communication of the data. It is pointed out that the data-flow approach offers an elegant solution to the sequencing problem, since all data dependencies are automatically handled and only instructions with ready input sets are activated. It is shown that a change in the level of subcomputations (actors) affects communications costs. The concept of variable resolution is discussed, and the testbed environment is examined. Attention is given to the architecture of the processing elements, the communication network, and the simulators. A description of the analytical model is also provided. Simulation and results are discussed, taking into account test programs and allocation, the variation of the number of processing elements, the variation of the resolution in directed acyclic graphs, performance in processing loops, and array handling.

Gaudiot, J. L.↗

Application of data flow concepts to a multigrid solver for the Euler equations

In this study a multigrid solver for Euler equations (FLO52R) was examined to determine its performance potential on a hypothetical computer using a data flow architecture. The proposed computer would require massive parallelism to realize its design performance. On the other hand this parallelism would be more easily realized than with a conventional vector processor such as the Cray-1S. Several changes to the proposed design substantially alleviated most of the remaining bottlenecks to parallel processing. Other changes allowed clearer definition of memory access and disk I/O. Finally, a portion of the algorithm was rewritten to improve parallel performance. With these changes, performance levels approaching that of a Cray-1S may be possible for a computer costing far less. Estimates are given for overall speed, memory, and network bandwidth, and for instruction memory requirements.

Merriam, M. L.↗

Functional language and data flow architectures

This is a tutorial article about language and architecture approaches for highly concurrent computer systems based on the functional style of programming. The discussion concentrates on the basic aspects of functional languages, and sequencing models such as data-flow, demand-driven and reduction which are essential at the machine organization level. Several examples of highly concurrent machines are described.

Ercegovac, M. D.↗

Simulator for concurrent processing data flow architectures

A software simulator capability of simulating execution of an algorithm graph on a given system under the Algorithm to Architecture Mapping Model (ATAMM) rules is presented. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented is capable of determining the performance of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of the ATAMM Simulator. Simulated results are shown to be comparable to the experimental results of the Advanced Development Model System.

Malekpour, Mahyar R.↗

A comparison of multiprocessor scheduling methods for iterative data flow architectures

A comparative study is made between the Algorithm to Architecture Mapping Model (ATAMM) and three other related multiprocessing models from the published literature. The primary focus of all four models is the non-preemptive scheduling of large-grain iterative data flow graphs as required in real-time systems, control applications, signal processing, and pipelined computations. Important characteristics of the models such as injection control, dynamic assignment, multiple node instantiations, static optimum unfolding, range-chart guided scheduling, and mathematical optimization are identified. The models from the literature are compared with the ATAMM for performance, scheduling methods, memory requirements, and complexity of scheduling and design procedures.

Storch, Matthew↗

Acoustically excited heated jets. 3: Mean flow data

This is Part 3 of a report on the excitability of heated jets under the influence of acoustic excitation. The effects of upstream internal acoustic excitation on jet mixing were described in Part 1. Part 2 described the effects of external excitation on flow mixing. Part 3 contains quantitative results from the measurements of mean Mach number and temperature and consists of radial profiles and centerline distributions measured at selected jet operating conditions for internally excited and unexcited jets. The mean flow data are presented in both graphical and tabulated forms. For the sake of completeness, this part contains temperature probe calibration curves also.

Lepicovsky, J.↗

Data flow methods for dynamic system simulation - A CSSL-IV microcomputer network interface

A major problem in employing networks of microcomputers for the real-time simulation of complex systems is to allocate computational tasks to the various microcomputers in such a way that idle time and time lost in interprocess communication is minimized. The research reported in this paper is directed to the development of a software interface between a higher-level simulation language and a network of microcomputers. A CSSL-IV source program is translated to a data flow graph. This graph is then analyzed automatically so as to allocate computing tasks to the various processors.

Makoui, A.↗

Advances in Modeling Solar System Internet Structures and their Data Flows

With an ever-increasing presence in space, there is also an increasing burden on existing communications infrastructure. We are heading towards an inflection point where the traditional approach of scheduled, single-path communications for space will no longer be viable. One answer is Delay Tolerant Networking (DTN), which takes the once disparate system of point-to-point links and unifies them in a networked architecture, thereby making communications more scalable. However, much work remains for discovering and harnessing the underlying theory of DTN. For example, in the terrestrial setting the interplay between routing domains is well-understood, however this is not the case in DTNs. In this paper, we build up the fundamental foundations of DTN, with an emphasis on modeling time varying networks and data flows across them, with examples of cross-domain routing in a DTN. A lofty goal of DTN is to enable the so-called Solar System Internet (SSI), which implies a standardized and robust suite of protocols. These protocols include routing across disconnected networks using store, carry, and forward mechanisms, which is necessary due to the disconnections, delays, and mobility intrinsic to space networks. Due to these factors, each of which generalize traditional networking, there is a deep and rich theory of DTNs. Here we build off of past successes to broaden this theory while striving to keep actionable results a goal for future implementations and operations. The approach includes modeling the unicast, broadcast, and multicast communications using the language of hypergraphs, which capture the geometric properties of such networked communications algebraically. Also inherent to these networks is their time-varying nature, particularly given mobility, and hence we also cultivate modeling techniques that respect this time dependence. This leads us to develop models using tools from category theory and algebraic geometry, which provide a language well-suited to describing synchronization and optimization over such networks. We also introduce and study a novel generalization of curvature applicable to time-evolving networks, which provides quantitative controls on diffusion processes on the network. Because an interplanetary network would feature links with propagation delays the preclude discovery (feedback) mechanisms, they will always feature a scheduled component. However, it is beneficial to support discovery where possible. While DTNs do not yet have strong definitions for their analogues of autonomous systems or network areas, we show how to join dynamic and schedule-based routing domains, using the language of sheaves, which marks progress towards such definitions. We conclude with a discussion of the progress made, as well as suggestions for future work.

Delay Tolerant Networking↗

Correlation and analysis of oil flow data for an air-breathing missile model

This paper will present the results of an oil flow investigation on an airbreathing missile model. This oil flow study examined the flow around the model, which can be configured with both axisymmetric and two-dimensional inlets. Flow visualization analyses were conducted for both types of geometries by examining the surface flow patterns made visible by the oil flows for Mach numbers of 2.5 and 3.95. The analysis has shown the extent of flow spillage around the inlet which has helped explain the force and moment data collected during previous testing of the model. The oil flow data has also been used to develop guidelines for modeling the location of the crossflow separation line along inlet fairings. Finally, the oil flow analysis has been used to identify unique features of the boattail flow. These boattail flow characteristics have been correlated with previous oil flow analysis of noncircular body models. This paper demonstrates the use of this type of oil flow analysis in developing missile flow field analysis and aerodynamic predictions ranging from impact angle methods through Navier-Stokes methods.

Stoy, S. L.↗

Constraints on lithospheric thermal structure for the Indian Ocean from depth and heat flow data

Models for the thermal evolution of oceanic lithosphere are primarily constrained by variations in seafloor depth and heat flow with age. These models have been largely based on data from the Pacific and Atlantic Ocean basins. We construct seafloor age relations for the Indian Ocean which we combine with bathymetric, sediment isopach and heat flow data to derive curves for depth and heat flow versus age. Comparison of these curves with predictions from three thermal models shows that they are better fit by the shallower depths and higher heat flow for the GDH1 model, which is characterized by a thinner and hotter lithosphere than previous models.

Shoberg, Tom↗