Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel machines”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

A Latency-Tolerant Partitioner for Distributed Computing on the Information Power Grid

NASA's Information Power Grid (IPG) is an infrastructure designed to harness the power of graphically distributed computers, databases, and human expertise, in order to solve large-scale realistic computational problems. This type of a meta-computing environment is necessary to present a unified virtual machine to application developers that hides the intricacies of a highly heterogeneous environment and yet maintains adequate security. In this paper, we present a novel partitioning scheme. called MinEX, that dynamically balances processor workloads while minimizing data movement and runtime communication, for applications that are executed in a parallel distributed fashion on the IPG. We also analyze the conditions that are required for the IPG to be an effective tool for such distributed computations. Our results show that MinEX is a viable load balancer provided the nodes of the IPG are connected by a high-speed asynchronous interconnection network.

Das, Sajal K.↗
NASA NTRS1991

A parallel vectorized implementation of triple excitations in CCSD(T) - Application to the binding energies of the AlH3, AlH2F, AlHF2 and AlF3 dimers

An efficient method for various noniterative estimates of connected triple excitations in coupled-cluster theory is outlined and related to a similar expression occurring in Moller-Plesset perturbation theory. The method is highly vectorized and capable of utilizing multiple processors on a shared-memory machine, leading to computational rates in excess of one billion floating-point operations per second on four processors of a CRAY Y-MP. Using the new procedure, the binding energies of the D(2h) diborane-type dimers of AlH3, AlH2F, AlHF2, and AlF3 have been determined to be 32, 40, 20, and 47 kcal/mol, respectively. For Al2F6, the correlation procedure includes 232 molecular orbitals and over 1.5 x 10 to the 6th single and double coupled-cluster amplitudes, effectively accounting for over 2 x 10 to the 9th connected triple excitations.

Rendell, Alistair P.↗
NASA NTRS1991

From biological neural networks to thinking machines: Transitioning biological organizational principles to computer technology

The three-dimensional organization of the vestibular macula is under study by computer assisted reconstruction and simulation methods as a model for more complex neural systems. One goal of this research is to transition knowledge of biological neural network architecture and functioning to computer technology, to contribute to the development of thinking computers. Maculas are organized as weighted neural networks for parallel distributed processing of information. The network is characterized by non-linearity of its terminal/receptive fields. Wiring appears to develop through constrained randomness. A further property is the presence of two main circuits, highly channeled and distributed modifying, that are connected through feedforward-feedback collaterals and biasing subcircuit. Computer simulations demonstrate that differences in geometry of the feedback (afferent) collaterals affects the timing and the magnitude of voltage changes delivered to the spike initiation zone. Feedforward (efferent) collaterals act as voltage followers and likely inhibit neurons of the distributed modifying circuit. These results illustrate the importance of feedforward-feedback loops, of timing, and of inhibition in refining neural network output. They also suggest that it is the distributed modifying network that is most involved in adaptation, memory, and learning. Tests of macular adaptation, through hyper- and microgravitational studies, support this hypothesis since synapses in the distributed modifying circuit, but not the channeled circuit, are altered. Transitioning knowledge of biological systems to computer technology, however, remains problematical.

Ross, Muriel D.↗
NASA NTRS2012

Extending Validated Human Performance Models to Explore NextGen Concepts

To meet the expected increases in air traffic demands, NASA and FAA are researching and developing Next Generation Air Transportation System (NextGen) concepts. NextGen will require substantial increases in the data available to pilots on the flight deck (e.g., weather,wake, traffic trajectory predictions, etc.) to support more precise and closely coordinated operations (e.g., self-separation, RNAV/RNP, and closely spaced parallel operations, CSPOs). These NextGen procedures and operations, along with the pilot's roles and responsibilities, must be designed with consideration of the pilot's capabilities and limitations. Failure to do so will leave the pilots, and thus the entire aviation system, vulnerable to error. A validated Man-machine Integration and design Analysis System (MIDAS) v5 model was extended to evaluate anticipated changes to flight deck and controller roles and responsibilities in NextGen approach and Land operations. Compared to conditions when the controllers are responsible for separation on decent to land phase of flight, the output from these model predictions suggest that the flight deck response time to detect the lead aircraft blunder will decrease, pilot scans to the navigation display will increase, and workload will increase.

Gore, Brian Francis↗
NASA NTRS1978

Total system issues

A raw computer resource capable of one billion floating point operations per second will have multiple parallel and/or segmented functional units to obtain such a speed. The system programmers, software writers and users are faced with the task of writing operating systems, compilers and application programs to utilize such a capability efficiently. The software problem of giving the user access to the available power of the machine is discussed.

Levesque, J. M.↗
NASA NTRS1992

Unsteady turbomachinery flow simulations on massively parallel architectures

The accurate numerical simulation of unsteady, three-dimensional viscous flow in turbomachines is computationally very intensive, requiring prohibitively large amounts of computer time on current vector supercomputers. In recent years, computer systems based on massively parallel architectures have been developed that offer the promise of meeting the computational power requirements of such large-scale simulations. However, a rethinking of existing algorithms and methodology is required in order to fully harness the computational power of such architectures. In this paper the capabilities of the Connection Machine (CM-2) in predicting unsteady flows in turbomachines are evaluated. The implementation on the CM-2 of an implicit, time-accurate, zonal algorithm for the Navier-Stokes equations in two dimensions is described. Programming issues and modifications made to the original algorithm (developed for vector, pipelined supercomputers) in order to improve performance on the CM-2 are outlined. Algorithm performance is evaluated and compared with a functionally equivalent code for the CRAY-YMP.

Madavan, N. K.↗
NASA NTRS1994

Applications Performance Under MPL and MPI on NAS IBM SP2

On July 5, 1994, an IBM Scalable POWER parallel System (IBM SP2) with 64 nodes, was installed at the Numerical Aerodynamic Simulation (NAS) Facility Each node of NAS IBM SP2 is a "wide node" consisting of a RISC 6000/590 workstation module with a clock of 66.5 MHz which can perform four floating point operations per clock with a peak performance of 266 Mflop/s. By the end of 1994, 64 nodes of IBM SP2 will be upgraded to 160 nodes with a peak performance of 42.5 Gflop/s. An overview of the IBM SP2 hardware is presented. The basic understanding of architectural details of RS 6000/590 will help application scientists the porting, optimizing, and tuning of codes from other machines such as the CRAY C90 and the Paragon to the NAS SP2. Optimization techniques such as quad-word loading, effective utilization of two floating point units, and data cache optimization of RS 6000/590 is illustrated, with examples giving performance gains at each optimization step. The conversion of codes using Intel's message passing library NX to codes using native Message Passing Library (MPL) and the Message Passing Interface (NMI) library available on the IBM SP2 is illustrated. In particular, we will present the performance of Fast Fourier Transform (FFT) kernel from NAS Parallel Benchmarks (NPB) under MPL and MPI. We have also optimized some of Fortran BLAS 2 and BLAS 3 routines, e.g., the optimized Fortran DAXPY runs at 175 Mflop/s and optimized Fortran DGEMM runs at 230 Mflop/s per node. The performance of the NPB (Class B) on the IBM SP2 is compared with the CRAY C90, Intel Paragon, TMC CM-5E, and the CRAY T3D.

Saini, Subhash↗
NASA NTRS2013

Miga Aero Actuator and 2D Machined Mechanical Binary Latch

Shape memory alloy (SMA) actuators provide the highest force-to-weight ratio of any known actuator. They can be designed for a wide variety of form factors from flat, thin packages, to form-matching packages for existing actuators. SMA actuators can be operated many thousands of times, so that ground testing is possible. Actuation speed can be accurately controlled from milliseconds to position and hold, and even electronic velocity-profile control is possible. SMA actuators provide a high degree of operational flexibility, and are truly smart actuators capable of being accurately controlled by onboard microprocessors across a wide range of voltages. The Miga Aero actuator is a SMA actuator designed specifically for spaceflight applications. Providing 13 mm of stroke with either 20- or 40-N output force in two different models, the Aero actuator is made from low-outgassing PEEK (polyether ether ketone) plastic, stainless steel, and nickel-titanium SMA wires. The modular actuator weighs less than 28 grams. The dorsal output attachment allows the Aero to be used in either PUSH or PULL modes by inverting the mounting orientation. The SPA1 actuator utilizes commercially available SMA actuator wire to provide 3/8-in. (approx. =.1 cm) of stroke at a force of over 28 lb (approx. = .125 N). The force is provided by a unique packaging of the single SMA wire that provides the output force of four SMA wires mechanically in parallel. The output load is shared by allowing the SMA wire to slip around the output attachment end to adjust or balance the load, preventing any individual wire segment from experiencing high loads during actuation. A built-in end limit switch prevents overheating of the SMA element following actuation when used in conjunction with the Miga Analog Driver [a simple MOSFET (metal oxide semiconductor field-effect transistor) switching circuit]. A simple 2D machined mechanical binary latch has been developed to complement the capabilities of SMA wire actuators. SMA actuators typically perform ideally as latch-release devices, wherein a spring-loaded device is released when the SMA actuator actuates in one direction. But many applications require cycling between two latched states open and closed.

Gummin, Mark A.↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution, and a computation involving the regular section A, the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1993

The universal robot

Our artifacts are getting smarter, and a loose parallel with the evolution of animal intelligence suggests one future course for them. Computerless industrial machinery exhibits the behavioral flexibility of single-celled organisms. Today's best computer-controlled robots are like the simpler invertebrates. A thousand-fold increase in computer power in the next decade should make possible machines with reptile-like sensory and motor competence. Properly configured, such robots could do in the physical world what personal computers now do in the world of data - act on our behalf as literal-minded slaves. Growing computer power over the next half-century will allow this reptile stage to be surpassed, in stages producing robots that learn like mammals, model their world like primates, and eventually reason like humans. Depending on your point of view, humanity will then have produced a worthy successor, or transcended some of its inherited limitations and so transformed itself into something quite new.

Moravec, Hans↗
NASA NTRS2000

On the Computational Capabilities of Physical Systems: The Impossibility of Infallible Computation - Part 1

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical universe. Next it is proven that no physical computer C can correctly carry out any computational task in the subset of such tasks that can be posed to C. This result holds whether the computational tasks concern a system that is physically isolated from C, or instead concern a system that is coupled to C. As a particular example, this result means that there cannot be a physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly 'processing information faster than the universe does'. The results also mean that there cannot exist an infallible, general-purpose observation apparatus, and that there cannot be an infallible, general-purpose control apparatus. These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - a definition of 'physical computation' - is needed to address the issues considered in these papers. While this definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. The second in this pair of papers presents a preliminary exploration of some of this mathematical structure, including in particular that of prediction complexity, which is a 'physical computation analogue' of algorithmic information complexity. It is proven in that second paper that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.

Wolpert, David H.↗
NASA NTRS2001

NAS Grid Benchmarks: A Tool for Grid Space Exploration

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

Frumkin, Michael↗
NASA NTRS1998

High Performance Parallel Architectures

Traditional remote sensing instruments are multispectral, where observations are collected at a few different spectral bands. Recently, many hyperspectral instruments, that can collect observations at hundreds of bands, have been operational. Furthermore, there have been ongoing research efforts on ultraspectral instruments that can produce observations at thousands of spectral bands. While these remote sensing technology developments hold great promise for new findings in the area of Earth and space science, they present many challenges. These include the need for faster processing of such increased data volumes, and methods for data reduction. Dimension Reduction is a spectral transformation, aimed at concentrating the vital information and discarding redundant data. One such transformation, which is widely used in remote sensing, is the Principal Components Analysis (PCA). This report summarizes our progress on the development of a parallel PCA and its implementation on two Beowulf cluster configuration; one with fast Ethernet switch and the other with a Myrinet interconnection. Details of the implementation and performance results, for typical sets of multispectral and hyperspectral NASA remote sensing data, are presented and analyzed based on the algorithm requirements and the underlying machine configuration. It will be shown that the PCA application is quite challenging and hard to scale on Ethernet-based clusters. However, the measurements also show that a high- performance interconnection network, such as Myrinet, better matches the high communication demand of PCA and can lead to a more efficient PCA execution.

El-Ghazawi, Tarek↗
NASA NTRS2014

Coupled CFD-Thermal Analysis of Erosion Patterns Resulting from Nozzle Wedgeouts on the SRTMV-N2

The objective of this analysis was to study the effects of the erosion patterns from the introduction of nozzle flaws machined into the nozzle of the SRTMV-N2 (Solid Rocket Test Motor V Nozzle 2). The SRTMV-N2 motor was a single segment static subscale solid rocket motor used to further develop the RSRMV (Redesigned Solid Rocket Motor V Segment). Two flaws or "wedgeouts" were placed in the nozzle inlet parallel to the ply angles of that section to study erosion effects. One wedgeout was placed in the nose cap region and the other placed in the inlet ring on the opposite side of the bondline, separated 180 degrees circumferentially. A coupled CFD (Computational Fluid Analysis)-thermal iterative analytical approach was utilized at the wedgeouts to analyze the erosion profile during the burn time. The iterative CFD thermal approach was applied at five second intervals throughout the motor burn. The coupled fluid thermal boundary conditions were derived from a steady state CFD solution at the beginning of the interval. The derived heat fluxes were then applied along the surface and a transient thermal solution was developed to characterize the material response over the specified interval. Eroded profiles of each of the nozzle's wedgeouts and the original contour were created at each of the specified intervals. The final iteration of the erosion profile showed that both wedgeouts were "washedout," indicating that the erosion profile of the wedgeout had rejoined the original eroded contour, leaving no trace of the wedgeouts post fire. This analytical assessment agreed with post-fire observations made of the SRTMV-N2 wedgeouts, which noted a smooth eroded contour.

Ables, Catherine↗
NASA NTRS1990

Concurrent Finite-Element Analysis On Hypercube Computers

Improved approach to execution of finite-element codes on hypercube and similar concurrent data processors increases efficiency of computation for many different types of problems. Based on flexible general model of computation on, and communication among, large-node parallel processors. Hybrid combining direct methods within subdomains and preconditioned-conjugate-gradient (PCG) iteration on remaining boundary system to obtain method of solution both robust and efficient. Preserves general structure and function of conventional sequential finite-element-method software. Generalized to both distributed- and shared-memory multicomputers, eliminating degree of machine specificity restricting general usefulness.

Lyzenga, G. A.↗
NASA NTRS1988

Dynamically allocating sets of fine-grained processors to running computations

Researchers explore an approach to using general purpose parallel computers which involves mapping hardware resources onto computations instead of mapping computations onto hardware. Problems such as processor allocation, task scheduling and load balancing, which have traditionally proven to be challenging, change significantly under this approach and may become amenable to new attacks. Researchers describe the implementation of this approach used by the FFP Machine whose computation and communication resources are repeatedly partitioned into disjoint groups that match the needs of available tasks from moment to moment. Several consequences of this system are examined.

Middleton, David↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance FORTRAN. We show that, for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution and a computation involving the regular section A(l:h:s), the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little run-time overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1998

Rapid Prototyping of Composite Structures

This progress report for the project Rapid Production of Composite Structures covers the period from July 14, 1997 to June 30, 1998. It will present a short overview of the project, followed by the results to date and plans for the future. The goal of this research is to provide a minimum 100x reduction in the time required to produce arbitrary, laminated products without the need for a separate mold or an autoclave. It will accomplish this by developing the science underlying the rapid production of composite structures, specifically those of carbon fiber-epoxy materials. This scientific understanding will be reduced to practice in a demonstration device that will produce a part on the order of 12" by 12" by 6". Work in the past year has focussed on developing an understanding of the materials issues and of the machine design issues. Our initial goal was to use UV cureable resins to accomplish full cure on the machine. Therefore, we have centered our materials work around whether or not UV cureable resins will work. Currently, the answer seems to be that they will not work, because UV light cannot penetrate the carbon fibers, and because no "shadow" curing seems to occur. As a result, non-UV cureable resins are being investigated. This has resulted in a change in the machine design focus. We are now looking into a "dip and place" machine design, whereby a prepreg layer would have one side coated with a curing agent, and then would be placed onto the previous layer. This would lead to cure at the interface, but not to the top of the layer. The formulation of the resins to accomplish this task at room or slightly elevated temperatures is being investigated, as is the machine design needed to apply the curing agent and then cure or partially cure the part. A final, out-of-autoclave, post-cure may be needed with this strategy, as final cure on the machine may not be possible, as it was for the initial UV cure strategy. The remainder of this report details the progress in the materials and machine design areas. Materials Development The material system must be designed to fulfill the following requirements: to reduce the time and labor requirements of typical cure cycles; to reduce the thermal stresses developed during conventional heat curing; and to develop a structure that the build sequence requires. In order to accomplish these goals, there have been parallel tracks of investigation. One area has tested photopolymerizable (ultraviolet (UV) curable) materials and combinations of these materials with standard heat curing resins. The second area has investigated resins that cure rapidly at room or low heat temperatures. The main goal of these investigations has been to identify a system that will rapidly set or cure at room temperature during a tape lay-up process and hold its structure during a post-cure cycle.

Colton, Jonathan S.↗