Search NASA⌕ Search

SEARCH · Search NASA

Results for “data parallel”

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 955 records · Page 53

Dynamics explorer data analysis

The project has shown unambiguously that auroral acceleration is caused by electric fields aligned parallel to the Earth's magnetic field. Evidence was shown of significant ion heating as ions are accelerated upwards in auroral electric fields. This heating is most likely caused by the two-stream instability. The fate of upward ion beams associated with auroral arcs is shown; they appear in the opposite hemisphere as dispersive ion precipitation events. Magnetic merging of the Interplanetary Magnetic Field occurs with both closed dayside magnetospheric field lines and open tail lobe field lines simultaneously nearly 30 percent of the time. The sunward flow in the dawnside plasma sheet is 20 percent smaller, on average, than in the duskside. The convection throat is displaced slightly more toward dawn for B sub y greater than 0 than for B sub y less than 0.

Reiff, Patricia H.↗

Leveraging STARE for Co-aligned Data Locality with netCDF and Python MPI

We have leveraged STARE indexing to package partitioned data chunks from diverse datasets into netCDF files, distributed them on a cluster of 16 lightweight nodes with their placements spatiotemporally co-aligned, and demonstrated a few integrative analyses using netCDF parallel I/O and Python MPI, with single-user performance and scalability comparable to, or even better than, that of a parallel array database management system (ADBMS) such as SciDB. However, records of the node location and STARE index ranges for each data chunk, similar to the chunk maps of SciDB, must be maintained and consulted by the I/O and analysis code for coordinating the analytic operations in parallel, in order to achieve the good performance and scalability.

Kwo-Sen Kuo↗

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗

Design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured-grid Euler solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effects of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of 3 performance improvement. The overall solution efficiency is compared with that obtained on the Cray Y-MP vector supercomputer.

Das, R.↗

Ion resonances and ELF wave production by an electron beam injected into the ionosphere - ECHO 6

Two effects observed with electron antennas ejected from a sounding rocket launched into the ionosphere in March 1983 carrying electron beam guns are discussed. The sensor packages were ejected and travelled parallel to the vehicle trajectory. Electric potentials were measured between the single probes and a plasma diagnostic package while the gun injected electrons into the ionosphere in perpendicular and parallel 1 kHz directions. Signal pulses over the dc-1250 kHz range were detected. A kHz gun frequency caused a signal that decreased by two orders of magnitude between 45-90 m from the beam field line. However, the signal was detectable at 1 mV/m at 120 m, supporting earlier data that indicated that pulsed electron beams can cause ELF waves in space. Beam injection parallel to the magnetic field produced an 840 Hz resonance that could be quenched by activation of a transverse beam.

Winckler, J. R.↗

Tropical Rainfall Measuring Mission (TRMM) project. VI - Spacecraft, scientific instruments, and launching rocket. Part 3 - The electrically Scanning Microwave Radiometer and the Special Sensor Microwave/Imager

The two microwave radiometers for TRMM are designed to measure thermal microwave radiation upwelling from the earth. The Electrically Scanning Microwave Radiometer (ESMR) scans from 50 deg to the left through nadir to 50 deg to the right in 78 steps with no moving mechanical parts in a band centered at 19.35 GHz. The TRMM concept uses the radar to develop a climatology of rain-layer thickness which can be used for the interpretation of the radiometer data over a swath wider than the radar. The ESMR data are useful for estimating rain intensity only over an ocean background. The Special Sensor Microwave/Imager (SSM/I), which scans conically with three dual polarized channels at 19, 37, and 85 GHz and a single polarized channel at 22 GHz, provides a wider range of rainfall intensities. The SSM/I spins about an axis parallel to the local spacecraft vector and 128 uniformly spaced samples of the 85 GHz data are taken on each scan over a 112-deg scan region simultaneously with 64 samples of the other frequencies.

Wilheit, Thomas T.↗

High performance data acquisition, identification, and monitoring for active magnetic bearings

Future active magnetic bearing systems (AMB) must feature easier on-site tuning, higher stiffness and damping, better robustness with respect to undesirable vibrations in housing and foundation, and enhanced monitoring and identification abilities. To get closer to these goals we developed a fast parallel link from the digitally controlled AMB to Matlab, which is used on a host computer for data processing, identification, and controller layout. This enables the magnetic bearing to take its frequency responses without using any additional measurement equipment. These measurements can be used for AMB identification.

Herzog, Raoul↗

Geological mapping in northwestern Saudi Arabia using LANDSAT multispectral techniques

Various computer enhancement and data extraction systems using LANDSAT data were assessed and used to complement a continuing geologic mapping program. Interactive digital classification techniques using both the parallel-piped and maximum-likelihood statistical approaches achieve very limited success in areas of highly dissected terrain. Computer enhanced imagery developed by color compositing stretched MSS ratio data was constructed for a test site in northwestern Saudi Arabia. Initial results indicate that several igneous and sedimentary rock types can be discriminated.

Blodget, H. W.↗

Compile-time estimation of communication costs in multicomputers

An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Any strategy for automatic data partitioning needs a mechanism for estimating the performance of a program under a given partitioning scheme, the most crucial part of which involves determining the communication costs incurred by the program. A methodology is described for estimating the communication costs at compile-time as functions of the numbers of processors over which various arrays are distributed. A strategy is described along with its theoretical basis, for making program transformations that expose opportunities for combining of messages, leading to considerable savings in the communication costs. For certain loops with regular dependences, the compiler can detect the possibility of pipelining, and thus estimate communication costs more accurately than it could otherwise. These results are of great significance to any parallelization system supporting numeric applications on multicomputers. In particular, they lay down a framework for effective synthesis of communication on multicomputers from sequential program references.

Gupta, Manish↗

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

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↗

Beyond the Renderer: Software Architecture for Parallel Graphics and Visualization

As numerous implementations have demonstrated, software-based parallel rendering is an effective way to obtain the needed computational power for a variety of challenging applications in computer graphics and scientific visualization. To fully realize their potential, however, parallel renderers need to be integrated into a complete environment for generating, manipulating, and delivering visual data. We examine the structure and components of such an environment, including the programming and user interfaces, rendering engines, and image delivery systems. We consider some of the constraints imposed by real-world applications and discuss the problems and issues involved in bringing parallel rendering out of the lab and into production.

Crockett, Thomas W.↗

Visualization Co-Processing of a CFD Simulation

OVERFLOW, a widely used CFD simulation code, is combined with a visualization system, pV3, to experiment with an environment for simulation/visualization co-processing on a SGI Origin 2000 computer(O2K) system. The shared memory version of the solver is used with the O2K 'pfa' preprocessor invoked to automatically discover parallelism in the source code. No other explicit parallelism is enabled. In order to study the scaling and performance of the visualization co-processing system, sample runs are made with different processor groups in the range of 1 to 254 processors. The data exchange between the visualization system and the simulation system is rapid enough for user interactivity when the problem size is small. This shared memory version of OVERFLOW, with minimal parallelization, does not scale well to an increasing number of available processors. The visualization task takes about 18 to 30% of the total processing time and does not appear to be a major contributor to the poor scaling. Improper load balancing and inter-processor communication overhead are contributors to this poor performance. Work is in progress which is aimed at obtaining improved parallel performance of the solver and removing the limitations of serial data transfer to pV3 by examining various parallelization/communication strategies, including the use of the explicit message passing.

Vaziri, Arsi↗

Pioneer Venus polarimetry and haze optical thickness

The Pioneer Venus mission provided us with high-resolution measurements at four wavelengths of the linear polarization of sunlight reflected by the Venus atmosphere. These measurements span the complete phase angle range and cover a period of more than a decade. A first analysis of these data by Kawabata et al. confirmed earlier suggestions of a haze layer above and partially mixed with the cloud layer. They found that the haze exhibits large spatial and temporal variations. The haze optical thickness at a wavelength of 365 nm was about 0.06 at low latitudes, but approximately 0.8 at latitudes from 55 deg poleward. Differences between morning and evening terminator have also been reported by the same authors. Using an existing cloud/haze model of Venus, we study the relationship between the haze optical thickness and the degree of linear polarization. Variations over the visible disk and phase angle dependence are investigated. For that purpose, exact multiple scattering computations are compared with Pioneer Venus measurements. To get an impression of the variations over the visible disk, we have first studied scans of the polarization parallel to the intensity equator. After investigating a small subset of the available data we have the following results. Adopting the haze particle characteristics given by Kawabata et al., we find a thickening of the haze at increasing latitudes. Further, we see a difference in haze optical thickness between the northern and southern hemispheres that is of the same order of magnitude as the longitudinal variation of haze thickness along a scan line. These effects are most pronounced at a wavelength of 935 nm. We must emphasize the tentative nature of the results, because there is still an enormous amount of data to be analyzed. We intend to combine further polarimetric research of Venus with constraints on the haze parameters imposed by physical and chemical processes in the atmosphere.

Knibbe, W. J. J.↗

Adaptive parallel logic networks

Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.

Martinez, Tony R.↗

Highly parallel computer architecture for robotic computation

In a computer having a large number of single instruction multiple data (SIMD) processors, each of the SIMD processors has two sets of three individual processor elements controlled by a master control unit and interconnected among a plurality of register file units where data is stored. The register files input and output data in synchronism with a minor cycle clock under control of two slave control units controlling the register file units connected to respective ones of the two sets of processor elements. Depending upon which ones of the register file units are enabled to store or transmit data during a particular minor clock cycle, the processor elements within an SIMD processor are connected in rings or in pipeline arrays, and may exchange data with the internal bus or with neighboring SIMD processors through interface units controlled by respective ones of the two slave control units.

Fijany, Amir↗

An analysis of the role of drift waves in equatorial spread F

An account is given of results of rocket measurements of the wave number spectrum of equatorial spread F irregularities, with emphasis on wavelengths less than 100 m. The measurements were made from two sounding rockets launched from Peru as part of Project Condor. The Condor density fluctuation spectra display a break at a wavelength near 100 m, identical to that found in the PLUMEX experiment (Kelley et al., 1982). The Condor data also confirm a subrange in which the density and the wave potential obey the Boltzmann relation - a strong indication of the presence of low-frequency electrostatic waves with finite wavelength parallel to the magnetic field, perhaps low-frequency drift waves as proposed by Kelley et al. The Condor data are also consistent with the previous conjecture that drift waves only exist above 300 km altitude. To investigate the difference in spectra observed over two altitude ranges, the data must be fitted to a form for the power spectrum taken from Keskinen and Ossakow (1981). The fitted spectrum, along with empirically determined growth and dissipation rates, is used to calculate the energy pumped into the spectrum at long wavelengths as well as the energy dissipated at shorter wavelengths. It is found that the energy is balanced by classical collisional effects in the low-altitude case, but energy balance in the high-altitude case requires an enhanced dissipation of about 500 times that due to classical diffusion. The model is consistent with, but does not uniquely imply, an inverse cascade of drift wave turbulence in equatorial spread F.

Labelle, J.↗

Extending the Licklider Transmission Protocol to Multi-Band Links

Most deep space missions return data to Earth using links operating at a single frequency band. Indeed, their data requirements are low enough that bandwidth regulations do not constrain the system. In contrast, spacecraft such as Kepler or Europa Clipper are transitioning to a new operational paradigm where engineering and science data are transmitted through simultaneous links operating at different frequency bands (henceforth termed multi-band links). This ensures, for instance, that critical data is correctly received using a well characterized X-band link, while science data at a much larger data rate can be returned efficiently (both in terms of bandwidth and energy) through a Ka-band link.Having a spacecraft establish two simultaneous links with a ground station opens a large span of potential improvements for space communications and mission operations. In this paper, we consider the problem of running a Licklider Transmission Protocol (LTP) session over a multi-band link. LTP is an implementation of a selective Automatic Repeat reQuest (ARQ) protocol, i.e. it ensures correct delivery of data over an error prone link with potentially long propagation delays. To maximize its efficiency in deep space environments, LTP operates in deferred-ACK mode and is typically included as one of the core protocols in the Delay Tolerant Networking (DTN) suite.The contributions of this paper are as follows: First, we propose an extension to LTP for multi-band links (denoted MBLTP) and sketch how it can be implemented without modifying the current definition of LTP data units. Next, we develop bounds on the performance of MBLTP when transmitting a single data file over a multi-band link. Three metrics are considered, file expected delivery time, total energy spent and bundle jitter. The results of the analytic model are first benchmarked against simulations to ensure validity, and then compared against the performance of both traditional LTP and Parallel LTP (PLTP).We demonstrate that MBLTP can significantly reduce the latency and jitter with which data products are delivered to destination over a deep space link compared to LTP at moderate energy cost. Similarly, we also demonstrate that MBLTP outperforms PLTP in all considered metrics.

Sanchez Net, Marc↗