Phase and group refractive indices from the collisionless magnetoionic theory
Graphs of phase and group refractive indices computed from collisionless magnetoionic theory electron concentration and magnetic field intensity
Chan, K.-L.↗
SEARCH · Engineering Papers
Results for “Computational graph”
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.
Computer analysis of nonlinear networks by recursive decomposition
Nonlinear networks computer analysis by recursive decomposition, discussing network graphs construction rules
Dertouzos, M. L.↗
New thermodynamic functions for the C3 molecule.
When graphite is used as ablation material in heat shields, very often a prominent carbon species vaporized into the stream is C3. The thermodynamic properties of the C3 molecule are, therefore, important in calculating transport phenomena in the ablation flow field. The nature of the C3 thermodynamic functions has been in doubt because of the uncertain contribution of the bending mode vibrations to the total internal energy of the molecule. An approach for overcoming these difficulties is considered. The results of the computations are presented in the form of graphs and approximating functions.
Pearson, W. E.↗
On the generation and evolution of internal gravity waves
The tidal generation and evolution of internal gravity waves is investigated experimentally and theoretically using a two-dimensional two-layer model. Time-dependent flow is created by moving a profile of maximum submerged depth 7.7 cm through a total stroke of 29 cm in water above a freon-kerosene mixture in an 8.6-m-long 30-cm-deep 20-cm-wide transparent channel, and the deformation of the fluid interface is recorded photographically. A theoretical model of the interface as a set of discrete vortices is constructed numerically; the rigid structures are represented by a source distribution; governing equations in Lagrangian form are obtained; and two integrodifferential equations relating baroclinic vorticity generation and source-density generation are derived. The experimental and computed results are shown in photographs and graphs, respectively, and found to be in good agreement at small Froude numbers. The reasons for small discrepancies in the position of the maximum interface displacement at large Froude numbers are examined.
Lansing, F. S.↗
Shock associated noise of inverted-profile coannular jets. II - Condition for minimum noise. III - Shock structure and noise characteristic
The generation of noise by the shock-turbulence interaction with shock cells in an inverted-profile coannular jet with nozzle exit velocity aligned with the jet axis is investigated analytically, interpreting the optical measurements of Tanna et al. (1985). The noise-intensity minimum at slightly supersonic primary-flow velocities is related to the weakness of the primary-stream shock-cell structure and the lack of such a pattern in the outer fan stream. The discrepancies between this finding and those of Dosanjh et al. (1977 and 1978) are attributed to nozzle design, the definition of minimum noise, and different interpretative approaches. A first-order shock-cell model is then developed to derive formulas for the peak frequencies and the scaling of noise intensity. The results of computations using these formulas are presented in graphs and found to be in good agreement with the experimental data.
Tam, C. K. W.↗
Global surface-water-induced seasonal variations in the earth's rotation and gravitational field
The effects of seasonal changes in continental surface-water storage on the low-degree gravitational-field coefficients (J), the annual wobble excitation (Psi), and the seasonal length-of-day (LOD) variations are investigated by means of numerical simulations based on compiled meteorological data (Willmott et al., 1985) and satellite snow-load estimates (Chao et al., 1987). The formulation of the model equations and the overall characteristics of the data sets are discussed in detail, and the computation results are presented in tables and graphs. The effect on Psi is found to be relatively small due to longitudinal cancellation, but those on LOD and J are considered significant.
Chao, B. F.↗
Optical processing of imaging spectrometer data
The data-processing problems associated with imaging spectrometer data are reviewed; new algorithms and optical processing solutions are advanced for this computationally intensive application. Optical decision net, directed graph, and neural net solutions are considered. Decision nets and mineral element determination of nonmixture data are emphasized here. A new Fisher/minimum-variance clustering algorithm is advanced, initialization using minimum-variance clustering is found to be preferred and fast. Tests on a 500-class problem show the excellent performance of this algorithm.
Liu, Shiaw-Dong↗
Small diameter symmetric networks from linear groups
In this note is reported a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation.
Campbell, Lowell↗
Array distribution in data-parallel programs
We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.
Chatterjee, Siddhartha↗
Performance analysis of a large-grain dataflow scheduling paradigm
A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.
Young, Steven D.↗
Decomposition Algorithm for Global Reachability Analysis on a Time-Varying Graph with an Application to Planetary Exploration
Hot air (Montgolfiere) balloons represent a promising vehicle system for possible future exploration of planets and moons with thick atmospheres such as Venus and Titan. To go to a desired location, this vehicle can primarily use the horizontal wind that varies with altitude, with a small help of its own actuation. A main challenge is how to plan such trajectory in a highly nonlinear and time-varying wind field. This paper poses this trajectory planning as a graph search on the space-time grid and addresses its computational aspects. When capturing various time scales involved in the wind field over the duration of long exploration mission, the size of the graph becomes excessively large. We show that the adjacency matrix of the graph is block-triangular, and by exploiting this structure, we decompose the large planning problem into several smaller subproblems, whose memory requirement stays almost constant as the problem size grows. The approach is demonstrated on a global reachability analysis of a possible Titan mission scenario.
Dijkstra's algorithm↗
Scheduling Operations for Massive Heterogeneous Clusters
High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.
Humphrey, John↗
HARP: A Dynamic Inertial Spectral Partitioner
Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (RSB), have proven effecfive in generating high-quality partitions of realistically-sized meshes. The major problem which hindered their wide-spread use was their long execution times. This paper presents a new inertial spectral partitioner, called HARP. The main objective of the proposed approach is to quickly partition the meshes at runtime in a manner that works efficiently for real applications in the context of distributed-memory machines. The underlying principle of HARP is to find the eigenvectors of the unpartitioned vertices and then project them onto the eigerivectors of the original mesh. Results for various meshes ranging in size from 1000 to 100,000 vertices indicate that HARP can indeed partition meshes rapidly at runtime. Experimental results show that our largest mesh can be partitioned sequentially in only a few seconds on an SP2 which is several times faster than other spectral partitioners while maintaining the solution quality of the proven RSB method. A parallel WI version of HARP has also been implemented on IBM SP2 and Cray T3E. Parallel HARP, running on 64 processors SP2 and T3E, can partition a mesh containing more than 100,000 vertices into 64 subgrids in about half a second. These results indicate that graph partitioning can now be truly embedded in dynamically-changing real-world applications.
Simon, Horst D.↗
Study of cryogenic propellant systems for loading the space shuttle. Part 2: Hydrogen systems
Computer simulation studies of liquid hydrogen fill and vent systems for the space shuttle are studied. The computer programs calculate maximum and minimum permissible flow rates during cooldown as limited by thermal stress considerations, fill line cooldown time, pressure drop, flow rates, vapor content, vent line pressure drop and vent line discharge temperature. The input data for these programs are selected through graphic displays which schematically depict the part of the system being analyzed. The computed output is also displayed in the form of printed messages and graphs. Digital readouts of graph coordinates may also be obtained. Procedures are given for operation of the graphic display unit and the associated minicomputer and timesharing computer.
Steward, W. G.↗
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.↗
A system for routing arbitrary directed graphs on SIMD architectures
There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.
Tomboulian, Sherryl↗
The role of reliability graph models in assuring dependable operation of complex hardware/software systems
The complexity of computer systems currently being designed for critical applications in the scientific, commercial, and military arenas requires the development of new techniques for utilizing models of system behavior in order to assure 'ultra-dependability'. The complexity of these systems, such as Space Station Freedom and the Air Traffic Control System, stems from their highly integrated designs containing both hardware and software as critical components. Reliability graph models, such as fault trees and digraphs, are used frequently to model hardware systems. Their applicability for software systems has also been demonstrated for software safety analysis and the analysis of software fault tolerance. This paper discusses further uses of graph models in the design and implementation of fault management systems for safety critical applications.
Patterson-Hine, F. A.↗
Light polarization measurements - A method to determine the specular and diffuse light-scattering properties of both leaves and plant canopies
The contributions of diffuse and specular reflection to the total canopy reflection of sunlight are determined experimentally for wheat at two stages of development using spectroradiometer measurements obtained at 13 wavelengths in the 480-720-nm range with a polarizing film in maximum and minimum signal-amplitude positions. The data and computation techniques are presented in tables, diagrams, and graphs, and the need to take specular reflection into account in constructing models of light/canopy interaction is stressed.
Vanderbilt, V. C.↗