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

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation

Modeling and optimum time performance for concurrent processing

The development of a new graph theoretic model for describing the relation between a decomposed algorithm and its execution in a data flow environment is presented. Called ATAMM, the model consists of a set of Petri net marked graphs useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance time measures which determine computing speed and throughput capacity are defined, and the ATAMM model is used to develop lower bounds for these times. A concurrent processing operating strategy for achieving optimum time performance is presented and illustrated by example

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

Method for concurrent execution of primitive operations by dynamically assigning operations based upon computational marked graph and availability of data

Computationally complex primitive operations of an algorithm are executed concurrently in a plurality of functional units under the control of an assignment manager. The algorithm is preferably defined as a computationally marked graph contianing data status edges (paths) corresponding to each of the data flow edges. The assignment manager assigns primitive operations to the functional units and monitors completion of the primitive operations to determine data availability using the computational marked graph of the algorithm. All data accessing of the primitive operations is performed by the functional units independently of the assignment manager

A rigorous derivation and energetics of a wave equation with fractional damping

We consider a linear system that consists of a linear wave equation on a horizontal hypersurface and a parabolic equation in the half space below. The model describes longitudinal elastic waves in organic monolayers at the water-air interface, which is an experimental setup that is relevant for understanding wave propagation in biological membranes. We study the scaling regime where the relevant horizontal length scale is much larger than the vertical length scale and provide a rigorous limit leading to a fractionally-damped wave equation for the membrane. We provide the associated existence results via linear semigroup theory and show convergence of the solutions in the scaling limit. Moreover, based on the energy-dissipation structure for the full model, we derive a natural energy and a natural dissipation function for the fractionally-damped wave equation with a time derivative of order 3/2

A rigorous derivation and energetics of a wave equation with fractional damping

We consider a linear system that consists of a linear wave equation on a horizontal hypersurface and a parabolic equation in the half space below. The model describes longitudinal elastic waves in organic monolayers at the water–air interface, which is an experimental setup that is relevant for understanding wave propagation in biological membranes. We study the scaling regime where the relevant horizontal length scale is much larger than the vertical length scale and provide a rigorous limit leading to a fractionally damped wave equation for the membrane. We provide the associated existence results via linear semigroup theory and show convergence of the solutions in the scaling limit. Moreover, based on the energy–dissipation structure for the full model, we derive a natural energy and a natural dissipation function for the fractionally damped wave equation with a time derivative of order 3/2

Support of the eight-foot high temperature tunnel modification project

In order to meet the need for propulsion testing in the high supersonic range from Mach 4 to Mach 7, NASA has undertaken the modification of the Langley Eight Foot High Temperature Tunnel to add alternate Mach number capability and oxygen enrichment to allow the testing of operating engines at these Mach numbers and at true temperature tunnel. The transfer of liquid oxygen (LOX) from a storage vessel to a rocket engine generally requires the use of a pressurizing gas at high pressures. Although nitrogen is preferred, unfortunately, when gaseous nitrogen (GN2) is used as the pressurant to transfer liquid oxygen from a storage tank to the tunnel combustor, it contaminates the liquid oxygen and effects a loss of performance in the engine. The contamination of the LOX by the pressurizing GN2 is described, which may prove to be an important operational constraint. It is desirable to have reliable data concerning the penetration of GN2 into LOX during pressurization and the subsequent of self cleaning after blowdown

A new method for recognizing quadric surfaces from range data and its application to telerobotics and automation, final phase

In the final phase of the proposed research a complete top to down three dimensional object recognition scheme has been proposed. The various three dimensional objects included spheres, cones, cylinders, ellipsoids, paraboloids, and hyperboloids. Utilizing a newly developed blob determination technique, a given range scene with several non-cluttered quadric surfaces is segmented. Next, using the earlier (phase 1) developed alignment scheme, each of the segmented objects are then aligned in a desired coordinate system. For each of the quadric surfaces based upon their intersections with certain pre-determined planes, a set of distinct features (curves) are obtained. A database with entities such as the equations of the planes and angular bounds of these planes has been created for each of the quadric surfaces. Real range data of spheres, cones, cylinders, and parallelpipeds have been utilized for the recognition process. The developed algorithm gave excellent results for the real data as well as for several sets of simulated range data