Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Performance Data”

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

Reusable, Extensible High-Level Data-Distribution Concept

A framework for high-level specification of data distributions in data-parallel application programs has been conceived. [As used here, distributions signifies means to express locality (more specifically, locations of specified pieces of data) in a computing system composed of many processor and memory components connected by a network.] Inasmuch as distributions exert a great effect on the performances of application programs, it is important that a distribution strategy be flexible, so that distributions can be adapted to the requirements of those programs. At the same time, for the sake of productivity in programming and execution, it is desirable that users be shielded from such error-prone, tedious details as those of communication and synchronization. As desired, the present framework enables a user to refine a distribution type and adjust it to optimize the performance of an application program and conceals, from the user, the low-level details of communication and synchronization. The framework provides for a reusable, extensible, data-distribution design, denoted the design pattern, that is independent of a concrete implementation. The design pattern abstracts over coding patterns that have been found to be commonly encountered in both manually and automatically generated distributed parallel programs. The following description of the present framework is necessarily oversimplified to fit within the space available for this article. Distributions are among the elements of a conceptual data-distribution machinery, some of the other elements being denoted domains, index sets, and data collections (see figure). Associated with each domain is one index set and one distribution. A distribution class interface (where "class" is used in the object-oriented-programming sense) includes operations that enable specification of the mapping of an index to a unit of locality. Thus, "Map(Index)" specifies a unit, while "LocalLayout(Index)" specifies the local address within that unit. The distribution class can be extended to enable specification of commonly used distributions or novel user-defined distributions. A data collection can be defined over a domain. The term "data collection" in this context signifies, more specifically, an abstraction of mappings from index sets to variables. Since the index set is distributed, the addresses of the variables are also distributed.

James, Mark↗
NASA NTRS1990

On the suitability of the connection machine for direct particle simulation

The algorithmic structure was examined of the vectorizable Stanford particle simulation (SPS) method and the structure is reformulated in data parallel form. Some of the SPS algorithms can be directly translated to data parallel, but several of the vectorizable algorithms have no direct data parallel equivalent. This requires the development of new, strictly data parallel algorithms. In particular, a new sorting algorithm is developed to identify collision candidates in the simulation and a master/slave algorithm is developed to minimize communication cost in large table look up. Validation of the method is undertaken through test calculations for thermal relaxation of a gas, shock wave profiles, and shock reflection from a stationary wall. A qualitative measure is provided of the performance of the Connection Machine for direct particle simulation. The massively parallel architecture of the Connection Machine is found quite suitable for this type of calculation. However, there are difficulties in taking full advantage of this architecture because of lack of a broad based tradition of data parallel programming. An important outcome of this work has been new data parallel algorithms specifically of use for direct particle simulation but which also expand the data parallel diction.

Dagum, Leonard↗
NASA NTRS1994

Visualization of unsteady computational fluid dynamics

A brief summary of the computer environment used for calculating three dimensional unsteady Computational Fluid Dynamic (CFD) results is presented. This environment requires a super computer as well as massively parallel processors (MPP's) and clusters of workstations acting as a single MPP (by concurrently working on the same task) provide the required computational bandwidth for CFD calculations of transient problems. The cluster of reduced instruction set computers (RISC) is a recent advent based on the low cost and high performance that workstation vendors provide. The cluster, with the proper software can act as a multiple instruction/multiple data (MIMD) machine. A new set of software tools is being designed specifically to address visualizing 3D unsteady CFD results in these environments. Three user's manuals for the parallel version of Visual3, pV3, revision 1.00 make up the bulk of this report.

Haimes, Robert↗
NASA NTRS1997

Geopotential Error Analysis from Satellite Gradiometer and Global Positioning System Observables on Parallel Architecture

The recovery of a high resolution geopotential from satellite gradiometer observations motivates the examination of high performance computational techniques. The primary subject matter addresses specifically the use of satellite gradiometer and GPS observations to form and invert the normal matrix associated with a large degree and order geopotential solution. Memory resident and out-of-core parallel linear algebra techniques along with data parallel batch algorithms form the foundation of the least squares application structure. A secondary topic includes the adoption of object oriented programming techniques to enhance modularity and reusability of code. Applications implementing the parallel and object oriented methods successfully calculate the degree variance for a degree and order 110 geopotential solution on 32 processors of the Cray T3E. The memory resident gradiometer application exhibits an overall application performance of 5.4 Gflops, and the out-of-core linear solver exhibits an overall performance of 2.4 Gflops. The combination solution derived from a sun synchronous gradiometer orbit produce average geoid height variances of 17 millimeters.

Schutz, Bob E.↗
NASA NTRS1990

Optimal dynamic remapping of data parallel computations

A large class of data parallel computations is characterized by a sequence of phases, with phase changes occurring unpredictably. Dynamic remapping of the workload to processors may be required to maintain good performance. The problem considered, for which the utility of remapping and the future behavior of the workload are uncertain, arises when phases exhibit stable execution requirements during a given phase, but requirements change radically between phases. For these situations, a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The authors address the fundamental problem of balancing the expected remapping performance gain against the delay cost, and they derive the optimal remapping decision policy. The promise of the approach is shown by application to multiprocessor implementations of an adaptive gridding fluid dynamics program and to a battlefield simulation program.

Nicol, David M.↗
NASA NTRS1992

An open, parallel I/O computer as the platform for high-performance, high-capacity mass storage systems

APTEC Computer Systems is a Portland, Oregon based manufacturer of I/O computers. APTEC's work in the context of high density storage media is on programs requiring real-time data capture with low latency processing and storage requirements. An example of APTEC's work in this area is the Loral/Space Telescope-Data Archival and Distribution System. This is an existing Loral AeroSys designed system, which utilizes an APTEC I/O computer. The key attributes of a system architecture that is suitable for this environment are as follows: (1) data acquisition alternatives; (2) a wide range of supported mass storage devices; (3) data processing options; (4) data availability through standard network connections; and (5) an overall system architecture (hardware and software designed for high bandwidth and low latency). APTEC's approach is outlined in this document.

Abineri, Adrian↗
NASA NTRS1996

The " Swarm of Ants vs. Herd of Elephants" Debated Revisited: Performance Measurements of PVM-Overflow Across a Wide Spectrum of Architectures

The Gorden Bell Prizes given out at Supercomputing every year includes at least two catergories: performance (highest GFLOP count) and price-performance (GFLOP/million $$) for real applications. In the past five years, the winners of the price-performance categories all came from networks of work-stations. This reflects three important facts: 1. supercomputers are still too expensive for the masses; 2. achieving high performance for real applications takes real work; and, most importantly; 3. it is possible to obtain acceptable performance for certain real applications on network of work stations. With the continued advance of network technology as well as increased performance of "desktop" workstation, the "Swarm of Ants vs. Herd of Elephants" debate, which began with vector multiprocessors (VPPs) against SIMD type multiprocessors (e.g. CM2), is now recast as VPPs against Symetric Multiprocessors (SMPs, e.g. SGI PowerChallenge). This paper reports on performance studies we performed solving a large scale (2-million grid pt.s) CFD problem involving a Boeing 747 based on a parallel version of OVERFLOW that utilizes message passing on PVM. A performance monitoring tool developed under NASA HPCC, called AIMS, was used to instrument and analyze the the performance data thus obtained. We plan to compare its performance data obtained across a wide spectrum of architectures including: the Cray C90, IBM/SP2, SGI/Power Challenge Cluster, to a group of workstations connected over a simple network. The metrics of comparison includes speed-up, price-performance, throughput, and turn-around time. We also plan to present a plan of attack for various issues that will make the execution of Grand Challenge Applications across the Global Information Infrastructure a reality.

Yan, Jerry C.↗
NASA NTRS2014

Assimilation of SMOS Soil Moisture Retrievals in the Land Information System

Soil moisture is a crucial variable for weather prediction because of its influence on evaporation. It is of critical importance for drought and flood monitoring and prediction and for public health applications. The NASA Short-term Prediction Research and Transition Center (SPoRT) has implemented a new module in the NASA Land Information System (LIS) to assimilate observations from the ESA's Soil Moisture and Ocean Salinity (SMOS) satellite. SMOS Level 2 retrievals from the Microwave Imaging Radiometer using Aperture Synthesis (MIRAS) instrument are assimilated into the Noah LSM within LIS via an Ensemble Kalman Filter. The retrievals have a target volumetric accuracy of 4% at a resolution of 35-50 km. Parallel runs with and without SMOS assimilation are performed with precipitation forcing from intentionally degraded observations, and then validated against a model run using the best available precipitation data, as well as against selected station observations. The goal is to demonstrate how SMOS data assimilation can improve modeled soil states in the absence of dense rain gauge and radar networks.

Blankenship, Clay↗
NASA NTRS2014

Assimilation of SMOS Soil Moisture Retrievals in the Land Information System

Soil moisture is a crucial variable for weather prediction because of its influence on evaporation. It is of critical importance for drought and flood monitoring and prediction and for public health applications. The NASA Short-term Prediction Research and Transition Center (SPoRT) has implemented a new module in the NASA Land Information System (LIS) to assimilate observations from the ESA's Soil Moisture and Ocean Salinity (SMOS) satellite. SMOS Level 2 retrievals from the Microwave Imaging Radiometer using Aperture Synthesis (MIRAS) instrument are assimilated into the Noah LSM within LIS via an Ensemble Kalman Filter. The retrievals have a target volumetric accuracy of 4% at a resolution of 35-50 km. Parallel runs with and without SMOS assimilation are performed with precipitation forcing from intentionally degraded observations, and then validated against a model run using the best available precipitation data, as well as against selected station observations. The goal is to demonstrate how SMOS data assimilation can improve modeled soil states in the absence of dense rain gauge and radar networks.

Blakenship, Clay↗
NASA NTRS2017

Data Reduction Pipeline for the CHARIS Integral-Field Spectrograph I: Detector Readout Calibration and Data Cube Extraction

We present the data reduction pipeline for CHARIS, a high-contrast integral-field spectrograph for the Subaru Telescope. The pipeline constructs a ramp from the raw reads using the measured nonlinear pixel response and reconstructs the data cube using one of three extraction algorithms: aperture photometry, optimal extraction, or chi-squared fitting. We measure and apply both a detector flatfield and a lenslet flatfield and reconstruct the wavelength- and position-dependent lenslet point-spread function (PSF) from images taken with a tunable laser. We use these measured PSFs to implement a chi-squared-based extraction of the data cube, with typical residuals of approximately 5 percent due to imperfect models of the under-sampled lenslet PSFs. The full two-dimensional residual of the chi-squared extraction allows us to model and remove correlated read noise, dramatically improving CHARIS's performance. The chi-squared extraction produces a data cube that has been deconvolved with the line-spread function and never performs any interpolations of either the data or the individual lenslet spectra. The extracted data cube also includes uncertainties for each spatial and spectral measurement. CHARIS's software is parallelized, written in Python and Cython, and freely available on github with a separate documentation page. Astrometric and spectrophotometric calibrations of the data cubes and PSF subtraction will be treated in a forthcoming paper.

Brandt, Timothy D.↗
NASA NTRS2023

Turbulence Model Validation Through Joint Experimental /Computational Studies of Separated Flow Over A Three-Dimensional Tapered Bump: Part I - Experimental Investigation

The results of a three-year experimental campaign aimed at comprehensively documenting the separated flow over a three-dimensional bump are presented with the purpose of generating a benchmark experimental database useful in validating computational fluid dynamics (CFD) flow simulations. The bump model geometry was designed to provide well-defined and repeatable smooth-body flow separation conditions that were suitable for both experiments and simulations. The bump had a Gaussian streamwise profile with a constant height equal to 8.5% of its width over the central 60% of the test section width. The remaining 40% were outboard spanwise portions that gradually taper to zero using an error function profile to minimize side-wall boundary layer effects. The model was immersed in a turbulent boundary layer that was developed on a suspended flat plate in the Notre Dame Mach 0.6 Wind Tunnel. In order to document the effect of the incoming boundary layer thickness on the flow separation, the bump model could be located at two streamwise positions. The mean velocity and turbulence intensity of the wind tunnel freestream flow field and approaching turbulent boundary layer were fully documented. The measurements of the flow separation region included surface visualization, wall shear stress using oil-film interferometry, mean and dynamic surface pressure, and planar and stereoscopic particle image velocimetry. The experiments were conducted over a range of Mach numbers from 0.05 to 0.2 corresponding to a range of Reynolds numbers based on the test section spanwise dimension (0.914m) of 1.0 × 10 6 ≤ Re L = U ∞ L/ν ≤ 4.0 × 10 6 . The bulk of the results are presented for the higher Mach number conditions of 0.1 and 0.2 with Re L = 2.0 × 10 6 and 4.0 × 10 6 , respectively. Extensive uncertainty analysis of the data was performed. The data is archived in the NASA Langley Turbulence Modeling Resource website at https://turbmodels.larc.nasa.gov/Other_exp_Data/speedbump_sep_exp.html. In addition to the experiments, a computational effort was made in parallel by the CFD group at Boeing Research & Technology highlighting the usefulness of the data set, which is outlined in the accompanying CFD report.

Flow separation↗
NASA NTRS2005

A Parallel Processing Algorithm for Remote Sensing Classification

A current thread in parallel computation is the use of cluster computers created by networking a few to thousands of commodity general-purpose workstation-level commuters using the Linux operating system. For example on the Medusa cluster at NASA/GSFC, this provides for super computing performance, 130 G(sub flops) (Linpack Benchmark) at moderate cost, $370K. However, to be useful for scientific computing in the area of Earth science, issues of ease of programming, access to existing scientific libraries, and portability of existing code need to be considered. In this paper, I address these issues in the context of tools for rendering earth science remote sensing data into useful products. In particular, I focus on a problem that can be decomposed into a set of independent tasks, which on a serial computer would be performed sequentially, but with a cluster computer can be performed in parallel, giving an obvious speedup. To make the ideas concrete, I consider the problem of classifying hyperspectral imagery where some ground truth is available to train the classifier. In particular I will use the Support Vector Machine (SVM) approach as applied to hyperspectral imagery. The approach will be to introduce notions about parallel computation and then to restrict the development to the SVM problem. Pseudocode (an outline of the computation) will be described and then details specific to the implementation will be given. Then timing results will be reported to show what speedups are possible using parallel computation. The paper will close with a discussion of the results.

Gualtieri, J. Anthony↗
NASA NTRS1994

Analysis of EDP performance

The objective of this contract was the investigation of the potential performance gains that would result from an upgrade of the Space Station Freedom (SSF) Data Management System (DMS) Embedded Data Processor (EDP) '386' design with the Intel Pentium (registered trade-mark of Intel Corp.) '586' microprocessor. The Pentium ('586') is the latest member of the industry standard Intel X86 family of CISC (Complex Instruction Set Computer) microprocessors. This contract was scheduled to run in parallel with an internal IBM Federal Systems Company (FSC) Internal Research and Development (IR&D) task that had the goal to generate a baseline flight design for an upgraded EDP using the Pentium. This final report summarizes the activities performed in support of Contract NAS2-13758. Our plan was to baseline performance analyses and measurements on the latest state-of-the-art commercially available Pentium processor, representative of the proposed space station design, and then phase to an IBM capital funded breadboard version of the flight design (if available from IR&D and Space Station work) for additional evaluation of results. Unfortunately, the phase-over to the flight design breadboard did not take place, since the IBM Data Management System (DMS) for the Space Station Freedom was terminated by NASA before the referenced capital funded EDP breadboard could be completed. The baseline performance analyses and measurements, however, were successfully completed, as planned, on the commercial Pentium hardware. The results of those analyses, evaluations, and measurements are presented in this final report.

Source record↗
NASA NTRS1994

VLSI neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques. The concurrent processing architectures developed are derived from a variety of advanced computing paradigms including neural network models, fuzzy logic, and cellular automata. Hardware implementation technologies range from state-of-the-art digital/analog custom-VLSI to advanced optoelectronic devices such as computer-generated holograms and e-beam fabricated Dammann gratings. JPL's concurrent processing devices group has developed a broad technology base in hardware implementable parallel algorithms, low-power and high-speed VLSI designs and building block VLSI chips, leading to application-specific high-performance embeddable processors. Application areas include high throughput map-data classification using feedforward neural networks, terrain based tactical movement planner using cellular automata, resource optimization (weapon-target assignment) using a multidimensional feedback network with lateral inhibition, and classification of rocks using an inner-product scheme on thematic mapper data. In addition to addressing specific functional needs of DOD and NASA, the JPL-developed concurrent processing device technology is also being customized for a variety of commercial applications (in collaboration with industrial partners), and is being transferred to U.S. industries. This viewgraph p resentation focuses on two application-specific processors which solve the computation intensive tasks of resource allocation (weapon-target assignment) and terrain based tactical movement planning using two extremely different topologies. Resource allocation is implemented as an asynchronous analog competitive assignment architecture inspired by the Hopfield network. Hardware realization leads to a two to four order of magnitude speed-up over conventional techniques and enables multiple assignments, (many to many), not achievable with standard statistical approaches. Tactical movement planning (finding the best path from A to B) is accomplished with a digital two-dimensional concurrent processor array. By exploiting the natural parallel decomposition of the problem in silicon, a four order of magnitude speed-up over optimized software approaches has been demonstrated.

Kemeny, Sabrina E.↗
NASA NTRS1992

Efficient use of high performance computers for integrated controls and structures design

Simply transporting design codes from sequential-scalar computers to parallel-vector computers does not fully utilize the computational benefits offered by high performance computers. By performing integrated controls and structures design on an experimental truss platform with both sequential-scalar and parallel-vector design codes, conclusive results are presented to substantiate this claim. The efficiency of a Cholesky factorization scheme in conjunction with a variable-band row data structure is presented. In addition, the Lanczos eigensolution algorithm has been incorporated in the design code for both parallel and vector computations. Comparisons of computational efficiency between the initial design code and the parallel-vector design code are presented. It is shown that the Lanczos algorithm with the Cholesky factorization scheme is far superior to the sub-space iteration method of eigensolution when substantial numbers of eigenvectors are required for control design and/or performance optimization. Integrated design results show the need for continued efficiency studies in the area of element computations and matrix assembly.

Belvin, W. K.↗
NASA NTRS2015

Conflict Alerts for Aircraft Conducting Visual Approaches

It is common for aircraft to conduct visual and instrument final approaches to a single runway or multiple parallel runways. Useful, nonexcessive safety alerts on aircraft conducting visual approaches are helpful to air traffic controllers, though pilots are responsible for separation with the preceding aircraft. A variety of visual approaches to various runway configurations are studied, and a set of safety alert thresholds is proposed. Fast-time simulations with recorded real-world air traffic data of mostly visual approach flights are performed on a prototype tactical separation assurance system for terminal airspace. Alerts are generated -- with both the standard separation thresholds and the proposed safety alert thresholds -- and compared with those from the Conflict Alert (CA) functionality in the Standard Terminal Automation Replacement System (STARS). The results show that the number of Mode-C Intruder alerts generated was reduced 76% as compared to STARS CA. The nuisance alerts generated by assuming visual to be instrument approaches was reduced by 92% when the proposed safety alert thresholds were used and visual approaches were assumed.A set of safety alert thresholds, which allow safety alerts to be provided to the controllers for aircraft conductingvisual approaches to a single runway or multiple parallel runways, has been proposed based on input from SubjectMatter Experts as well as visual approach procedures and common practices. The goal is to maximize the thresholdswithin the guidance of the procedures and common practices and to minimize the number of nuisance alerts and totalnumber of alerts with the support of flight intent information. Tests have been performed using a recently developedprototype tactical separation assurance system for terminal airspace, called Terminal Tactical Separation-AssuredFlight Environment (T-TSAFE). The input was a full day of air traffic data from Dallas/Fort Worth (DFW) TRACONwith most arriving flights conducting visual approaches. The results compare favorably with those of the ConflictAlert (CA) functionality of the Standard Terminal Automation Replacement System (STARS).When fast-time simulation experiment was performed using T-TSAFE with all arriving flights assumed to conductinstrument approaches, the expected large number of separation alerts were observed. When compared with STARSCA, the conflict pairs common to both T-TSAFE and STARS CA was only 21% of the total STARS CA alerts. As aresult, the nuisance-alert rate for STARS CA was estimated to be about 70%, which is comparable to a similar previously estimation of 80% nuisance-alert rate for CARTS (Common Automated Radar Terminal System) CA. The Mode-CIntruder (MCI) alerts were also reduced by 76% as compared to STARS CA.Examination of the common conflict pairs between T-TSAFE and STARS CA shows that they are valid separationconflicts with good alert lead times for T-TSAFE. However, many of them would still be considered nuisance alertsif the aircraft were conducting visual approaches. This was confirmed by another visual approach fast-time simulationT-TSAFE experiment, in which all DFW arriving flights were assumed to be on visual approaches and our proposedsafety alert thresholds were used and tested. The result of the experiment showed that the number of non-MCI alertswas less by 92% as compared to the number when all DFW arrivals were assumed to be conducting instrumentapproaches. The common conflict pairs involving aircraft conducting visual approaches to parallel runways werereduced by 93% as well. Thus, the flight intent information and the safety alert thresholds are effective in reducingnuisance alerts.T-TSAFE can thus provide separation and safety conflict alerts seamlessly in the real-world environment of mixedterminal operations with arriving flights of both visual and instrument approaches. Compared with STARS CA, TTSAFEhas fewer false alerts, larger alert lead time, and larger alert thresholds. While the nuisance alerts are reducedsignificantly with the safety alert thresholds, further work is needed to study if the alert lead time for safety alerts issufficient.

Tang, Huabin↗
NASA NTRS1982

Beyond the supercomputer

A NASA-directed development of massively parallel processor (MPP) computers is outlined, noting intended applications for data processing for near term earth resource and environment mapping, radar, and television transmissions. The MPP is designed to perform 100 billion operations/sec to obtain satisfactory image processing, while separate processing units correct distortions, register images, calculate correlation functions, and classify multispectral characteristics. Arrays of 1s and 0s will be manipulated in analog-to-digital conversions generating separate planes corresponding to powers of binaries. Data wires are replaced by fiber-optic tubes or thousands of wires, and single logic gates are replaced by thousands of logic gates and every memory element by thousands of memory elements. Features of the interconnections and the images control processor units are detailed, along with implementation of sliders for program flexibility.

Schaefer, D. H.↗
NASA NTRS1987

A parallel algorithm for channel routing on a hypercube

A new parallel simulated annealing algorithm for channel routing on a P processor hypercube is presented. The basic idea used is to partition a set of tracks equally among processors in the hypercube. In parallel, P/2 pairs of processors perform displacements and exchanges of nets between tracks, compute the changes in cost functions, and accept moves using a parallel annealing criteria. Through the use of a unique distributed data structure, it is possible to minimize message traffic and add versatility and efficiency in a parallel routing tool. The algorithm has been implemented and is being tested on some of the popular channel problems from the literature.

Brouwer, Randall↗