Search NASA⌕ Search

SEARCH · Search NASA

Results for “Time parallelization”

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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Parallelization of the Coupled Earthquake Model

This Web-based tsunami simulation system allows users to remotely run a model on JPL s supercomputers for a given undersea earthquake. At the time of this reporting, predicting tsunamis on the Internet has never happened before. This new code directly couples the earthquake model and the ocean model on parallel computers and improves simulation speed. Seismometers can only detect information from earthquakes; they cannot detect whether or not a tsunami may occur as a result of the earthquake. When earthquake-tsunami models are coupled with the improved computational speed of modern, high-performance computers and constrained by remotely sensed data, they are able to provide early warnings for those coastal regions at risk. The software is capable of testing NASA s satellite observations of tsunamis. It has been successfully tested for several historical tsunamis, has passed all alpha and beta testing, and is well documented for users.

Block, Gary↗
NASA NTRS1993

The Automated Instrumentation and Monitoring System (AIMS) reference manual

Whether a researcher is designing the 'next parallel programming paradigm,' another 'scalable multiprocessor' or investigating resource allocation algorithms for multiprocessors, a facility that enables parallel program execution to be captured and displayed is invaluable. Careful analysis of execution traces can help computer designers and software architects to uncover system behavior and to take advantage of specific application characteristics and hardware features. A software tool kit that facilitates performance evaluation of parallel applications on multiprocessors is described. The Automated Instrumentation and Monitoring System (AIMS) has four major software components: a source code instrumentor which automatically inserts active event recorders into the program's source code before compilation; a run time performance-monitoring library, which collects performance data; a trace file animation and analysis tool kit which reconstructs program execution from the trace file; and a trace post-processor which compensate for data collection overhead. Besides being used as prototype for developing new techniques for instrumenting, monitoring, and visualizing parallel program execution, AIMS is also being incorporated into the run-time environments of various hardware test beds to evaluate their impact on user productivity. Currently, AIMS instrumentors accept FORTRAN and C parallel programs written for Intel's NX operating system on the iPSC family of multi computers. A run-time performance-monitoring library for the iPSC/860 is included in this release. We plan to release monitors for other platforms (such as PVM and TMC's CM-5) in the near future. Performance data collected can be graphically displayed on workstations (e.g. Sun Sparc and SGI) supporting X-Windows (in particular, Xl IR5, Motif 1.1.3).

Yan, Jerry↗
NASA NTRS1995

Implementation and Characterization of Three-Dimensional Particle-in-Cell Codes on Multiple-Instruction-Multiple-Data Massively Parallel Supercomputers

A three-dimensional electrostatic particle-in-cell (PIC) plasma simulation code has been developed on coarse-grain distributed-memory massively parallel computers with message passing communications. Our implementation is the generalization to three-dimensions of the general concurrent particle-in-cell (GCPIC) algorithm. In the GCPIC algorithm, the particle computation is divided among the processors using a domain decomposition of the simulation domain. In a three-dimensional simulation, the domain can be partitioned into one-, two-, or three-dimensional subdomains ("slabs," "rods," or "cubes") and we investigate the efficiency of the parallel implementation of the push for all three choices. The present implementation runs on the Intel Touchstone Delta machine at Caltech; a multiple-instruction-multiple-data (MIMD) parallel computer with 512 nodes. We find that the parallel efficiency of the push is very high, with the ratio of communication to computation time in the range 0.3%-10.0%. The highest efficiency (> 99%) occurs for a large, scaled problem with 64(sup 3) particles per processing node (approximately 134 million particles of 512 nodes) which has a push time of about 250 ns per particle per time step. We have also developed expressions for the timing of the code which are a function of both code parameters (number of grid points, particles, etc.) and machine-dependent parameters (effective FLOP rate, and the effective interprocessor bandwidths for the communication of particles and grid points). These expressions can be used to estimate the performance of scaled problems--including those with inhomogeneous plasmas--to other parallel machines once the machine-dependent parameters are known.

Lyster, P. M.↗
NASA NTRS1998

Integrating Cache Performance Modeling and Tuning Support in Parallelization Tools

With the resurgence of distributed shared memory (DSM) systems based on cache-coherent Non Uniform Memory Access (ccNUMA) architectures and increasing disparity between memory and processors speeds, data locality overheads are becoming the greatest bottlenecks in the way of realizing potential high performance of these systems. While parallelization tools and compilers facilitate the users in porting their sequential applications to a DSM system, a lot of time and effort is needed to tune the memory performance of these applications to achieve reasonable speedup. In this paper, we show that integrating cache performance modeling and tuning support within a parallelization environment can alleviate this problem. The Cache Performance Modeling and Prediction Tool (CPMP), employs trace-driven simulation techniques without the overhead of generating and managing detailed address traces. CPMP predicts the cache performance impact of source code level "what-if" modifications in a program to assist a user in the tuning process. CPMP is built on top of a customized version of the Computer Aided Parallelization Tools (CAPTools) environment. Finally, we demonstrate how CPMP can be applied to tune a real Computational Fluid Dynamics (CFD) application.

Waheed, Abdul↗
NASA NTRS1965

Gapped toroid provides infinite resolution of delay-line pickup

Gapped toroid magnetically coupled to a delay line provides continuous adjustment of the time delay line signal retrieval. A rotating screw moves the toroid pickup parallel to the delay line. This device can be used in signal detection devices and instrumentation equipment.

Robinson, G. B.↗
NASA NTRS1977

Computer control of a far infrared interferometer

A simple interface has been designed for the automatic control and data collection from a Grubb Parsons Mark III cube interferometer. A computer is used to automatically step the movable mirror on the interferometer. Data may be directly input into the computer for immediate transformation or stored for later analysis via a fast Fourier transformation. The interface is based on a commercial analog-to-digital converter having a parallel-to-serial data converter. The device can also display ASCII characters sent from the computer in parallel binary code. The system is applicable to recording interferograms having long time durations and to measuring multiple interferograms for statistical averaging.

Breecher, J.↗
NASA NTRS1979

An efficient user-oriented method for calculating compressible flow about three-dimensional inlets

This method uses a so-called panel method to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained very cheaply. A number of graphical output features are provided to aid the user, including streamline tracing and automatic generation of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. This paper describes the method in some detail and presents calculated results.

Hess, J. L.↗
NASA NTRS1979

An efficient user-oriented method for calculating compressible flow in an about three-dimensional inlets

A panel method is used to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained rather cheaply. Geometric input is aided by an automatic generating program. A number of graphical output features are provided to aid the user, including surface streamline tracing and automatic generation of curves of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. The inlet method and use of the program are described. Illustrative results are presented.

Hess, J. L.↗
NASA NTRS1985

The science of computing - The evolution of parallel processing

The present paper is concerned with the approaches to be employed to overcome the set of limitations in software technology which impedes currently an effective use of parallel hardware technology. The process required to solve the arising problems is found to involve four different stages. At the present time, Stage One is nearly finished, while Stage Two is under way. Tentative explorations are beginning on Stage Three, and Stage Four is more distant. In Stage One, parallelism is introduced into the hardware of a single computer, which consists of one or more processors, a main storage system, a secondary storage system, and various peripheral devices. In Stage Two, parallel execution of cooperating programs on different machines becomes explicit, while in Stage Three, new languages will make parallelism implicit. In Stage Four, there will be very high level user interfaces capable of interacting with scientists at the same level of abstraction as scientists do with each other.

Denning, P. J.↗
NASA NTRS1986

Archaean megacrystic plagioclase units and the tectonic setting of greenstones

Large (up to 20 cm), equidimensional, commonly euhedral, plagioclase megacrysts of highly calcic composition (An sub 80-90) occur commonly in all Archean cratons in one or more of three distinct associations: (1) as cumulate crystal segregations of anorthosite or as megacrysts in basaltic dikes, sills, and flows in greenstone belts that vary in metamorphic grade from greenschist to granulite. Throughout 100's of thousands of square kilometers of northwestern Ontario and Manitoba the plagioclase megacrysts occur in pillowed and massive flows, sills, dikes, large inclusions in dikes, and intrusive anorthositic complexes with areas of up to a few 100 sq km and spanning a period of at least 100 m.y. in the 2.7 to 2.8 b.y. time frame; (2) as basaltic dike swarms in stable cratonic areas forming parallel to subparallel patterns over hundreds of thousands of square kilometers intruding both granitic gneisses and supracrustal belts including greenstones. These swams include the Ameralik-Saglek system at 3.1 to 3.4 b.y., the Matachewan system at 2.5 to 2.6 b.y., and the Beartooth-Bighorn system at 2.2 to 2.3 b.y.; and, (3) as anorthositic complexes associated with marbles and quartzites (Sittampundi, India and Messina, South Africa) in granulite grade terrains. Initial attempts to correlate tectonic settings of similar modern crystbearing units with their Archean counterparts were only partially successful.

Phinney, W. C.↗
NASA NTRS1987

The field-aligned flow approximation for electrons within layers possessing a normal mass flux - A corollary to the deHoffmann-Teller theorem

In this paper, an approximate extension of the deHoffmann-Teller (1950) theorem for electrons within layers possessing a normal mass flux is derived. It is shown that the deHoffmann-Teller frame electron bulk velocity is nearly parallel to the magnetic field everywhere through those one-dimensional time-stationary layers which possess a normal mass flux, even though electric field perpendicular to the magnetic field exists throughout such layers. Examples of layers of this class are the fast and slow shocks as well as rotational discontinuities.

Scudder, J. D.↗
NASA NTRS1987

Parallel processing for digital picture comparison

In picture processing an important problem is to identify two digital pictures of the same scene taken under different lighting conditions. This kind of problem can be found in remote sensing, satellite signal processing and the related areas. The identification can be done by transforming the gray levels so that the gray level histograms of the two pictures are closely matched. The transformation problem can be solved by using the packing method. Researchers propose a VLSI architecture consisting of m x n processing elements with extensive parallel and pipelining computation capabilities to speed up the transformation with the time complexity 0(max(m,n)), where m and n are the numbers of the gray levels of the input picture and the reference picture respectively. If using uniprocessor and a dynamic programming algorithm, the time complexity will be 0(m(3)xn). The algorithm partition problem, as an important issue in VLSI design, is discussed. Verification of the proposed architecture is also given.

Cheng, H. D.↗
NASA NTRS1988

ISEE studies of the quasi-parallel bow shock

ISEE-1 and-2 plasma and magnetic field observations are used to examine several encounters with brief magnetic pulsations in the quasi-parallel region of the earth's bow shock. The two-spacecraft timing of the magnetic field signature is examined to see if the pulsation encounters are nested (as for back and forth motion of the shock over the spacecraft) or simply time-shifted (as for a structure convected anti-sunward across the spacecraft). Examples of both types of signatures are found, some within minutes of each other, suggesting that at least some pulsations probably originate from the growth and steepening of upstream waves but may eventually be able to stand in the upstream flow, perhaps becoming part of the shock surface itself. The possibility that some of the pulsations may simply be brief encounters with the moving shock is also not ruled out.

Thomsen, M. F.↗
NASA NTRS1991

Digital optical computers at the optoelectronic computing systems center

The Digital Optical Computing Program within the National Science Foundation Engineering Research Center for Opto-electronic Computing Systems has as its specific goal research on optical computing architectures suitable for use at the highest possible speeds. The program can be targeted toward exploiting the time domain because other programs in the Center are pursuing research on parallel optical systems, exploiting optical interconnection and optical devices and materials. Using a general purpose computing architecture as the focus, we are developing design techniques, tools and architecture for operation at the speed of light limit. Experimental work is being done with the somewhat low speed components currently available but with architectures which will scale up in speed as faster devices are developed. The design algorithms and tools developed for a general purpose, stored program computer are being applied to other systems such as optimally controlled optical communication networks.

Jordan, Harry F.↗
NASA NTRS1991

Note on unit tangent vector computation for homotopy curve tracking on a hypercube

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and subsequent tracking of some smooth curve in the zero set of the homotopy map. Tracking a homotopy curve involves finding the unit tangent vector at different points along the zero curve, which amounts to calculating the kernel of the n x (n + 1) Jacobian matrix. While computing the tangent vector is just one part of the curve tracking algorithm, it can require a significant percentage of the total tracking time. This note presents computational results showing the performance of several different parallel orthogonal factorization/triangular system solving algorithms for the tangent vector computation on a hypercube.

Chakraborty, A.↗
NASA NTRS1993

Driving a car with custom-designed fuzzy inferencing VLSI chips and boards

Vehicle control in a-priori unknown, unpredictable, and dynamic environments requires many calculational and reasoning schemes to operate on the basis of very imprecise, incomplete, or unreliable data. For such systems, in which all the uncertainties can not be engineered away, approximate reasoning may provide an alternative to the complexity and computational requirements of conventional uncertainty analysis and propagation techniques. Two types of computer boards including custom-designed VLSI chips were developed to add a fuzzy inferencing capability to real-time control systems. All inferencing rules on a chip are processed in parallel, allowing execution of the entire rule base in about 30 microseconds, and therefore, making control of 'reflex-type' of motions envisionable. The use of these boards and the approach using superposition of elemental sensor-based behaviors for the development of qualitative reasoning schemes emulating human-like navigation in a-priori unknown environments are first discussed. Then how the human-like navigation scheme implemented on one of the qualitative inferencing boards was installed on a test-bed platform to investigate two control modes for driving a car in a-priori unknown environments on the basis of sparse and imprecise sensor data is described. In the first mode, the car navigates fully autonomously, while in the second mode, the system acts as a driver's aid providing the driver with linguistic (fuzzy) commands to turn left or right and speed up or slow down depending on the obstacles perceived by the sensors. Experiments with both modes of control are described in which the system uses only three acoustic range (sonar) sensor channels to perceive the environment. Simulation results as well as indoors and outdoors experiments are presented and discussed to illustrate the feasibility and robustness of autonomous navigation and/or safety enhancing driver's aid using the new fuzzy inferencing hardware system and some human-like reasoning schemes which may include as little as six elemental behaviors embodied in fourteen qualitative rules.

Pin, Francois G.↗
NASA NTRS1994

Electronically Variable Resistive Load

Electronically variable linear resistive load circuit synthesized by use of analog components to control conductance of power metal oxide/semiconductor field-effect transistors, MOSFET's. Circuit has modular configuration, in which single controller drives parallel load units. A 3-kW load module that exhibits submicrosecond response time with respect to control signal demonstrated.

Niedra, Janis M.↗
NASA NTRS1995

Studies with Cluster upstream and downstream of the bow shock: An experimenter's perspective

Some open questions in the physics of bow shock formation, the evolution of the particle distributions from solar wind into the magnetosheath, and the acceleration of ions at the moment of the shock are summarized. A layout of the current situation is presented in view of recent theoretical developments and the new diagnostic tools provided by the Cluster mission. The transition of ions across the quasi-perpendicular bow shock and their downstream thermalization are discussed. The processes and spatial scales are found to be species dependent and are discussed for H(+), He(2+), and He(+). The theory of particle acceleration at quasi-parallel shocks are reviewed. It is shown how Cluster can study the time variable structures of the shock as predicted by hybrid simulation. It is emphasized that high time resolution measurement with simultaneous species separation is necessary for the study of the ion acceleration. Suggestions for the spacecraft separations at the bow shock are suggested.

Moebius, E.↗