SEARCH · Search NASA

Results for “Parallel algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 937 records · Page 52

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Radarclinometry

A general theory based on the implicit mathematical determinacy, and a corresponding algorithm, are developed to derive topographic maps from radar images as photometric arrays. Starting from a control profile, the theory produces topography by an area integration of radar brightness, and the control profile is formed under the assumption that the terrain properties are locally cylindrical. The calibration curve for pixel brightness versus incidence-angle is also produced. In the operational algorithm, topography is produced as a set of independent line integrations down each of the parallel range lines of the image using the theory for control-profile formation. An adaptive technique was employed to process SEASAT images of sand dunes, and the present method is demonstrated with a Motorola image of Crazy Jug Point in the Grand Canyon.

Wildey, Robert L.↗

NASA NTRS1988

Single-Mode Projection Filters for Modal Parameter Identification for Flexible Structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. Another numerical simulation of a ten-mode structure is also presented by using a two-dimensional global optimization algorithm to illustrate the feasibility of the new method. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

NASA NTRS1988

Correlation filters for orientation estimation

An important task in many vision applications is that of rapidly estimating the orientation of an object with respect to some frame of reference. Because of their speed and parallel processing capabilities, optical correlators should prove valuable in this application. This paper considers two algorithms for object orientation estimation based on optical correlations and presents some initial simulation results.

Kumar, B. V. K. Vijaya↗

NASA NTRS1990

Analog Delta-Back-Propagation Neural-Network Circuitry

Changes in synapse weights due to circuit drifts suppressed. Proposed fully parallel analog version of electronic neural-network processor based on delta-back-propagation algorithm. Processor able to "learn" when provided with suitable combinations of inputs and enforced outputs. Includes programmable resistive memory elements (corresponding to synapses), conductances (synapse weights) adjusted during learning. Buffer amplifiers, summing circuits, and sample-and-hold circuits arranged in layers of electronic neurons in accordance with delta-back-propagation algorithm.

Eberhart, Silvio↗

NASA NTRS1990

A parallel particle-in-cell model for the massively parallel processor

The availability of the nearest-neighbor communication-incorporating Massively Parallel Processor has prompted the development of a two-dimensional, particle-in-cell algorithm which loads particles in a cell randomly onto a row of processors, filling only half of them with particles. Due to the simplification of communications among processors achieved in a row by the vacant processors and the random-particle sequence, the algorithm efficiently sorts particles and performs gather/scatter procedures for collecting charge density according to their cells. The algorithm calculates electric fields at the cells by FFT.

Lin, C. S.↗

NASA NTRS1989

Computational fluid dynamics on a massively parallel computer

A finite difference code was implemented for the compressible Navier-Stokes equations on the Connection Machine, a massively parallel computer. The code is based on the ARC2D/ARC3D program and uses the implicit factored algorithm of Beam and Warming. The codes uses odd-even elimination to solve linear systems. Timings and computation rates are given for the code, and a comparison is made with a Cray XMP.

Jespersen, Dennis C.↗

NASA NTRS1991

Modeling methods for the design and evaluation of fault-tolerant systems

The authors describe an approach for using directed graph simulation models, behavioral simulation models, and semi-Markov analytic models to implement early- to mid-design analysis activities specified by the SDIO BM/C3 Processor and Algorithm Working Group. The use of the models was demonstrated for a mission scenario requiring parallel, reliable computations with a maximum probability of system failure between 10-4 and 10-2 over a 5-year-preengagement phase and between 10-7 and 10-5 over a half-hour engagement phase.

Scheper, Charlotte O.↗

NASA NTRS1992

Repetitive control in the presence of multiple periodic disturbances

In this paper, the authors introduce several methods for implementing repetitive control of systems subjected to noninteger multiple periodic disturbances. One method uses a single repetitive controller to learn at the common period of the disturbances. The second employs multiple p-integrator based repetitive controllers operating in parallel. The third method introduces the concept of sequenced repetitive controllers. Cross-talk elimination algorithms are proposed to improve the repetitive control performance in the presence of transients. A novel averaging algorithm is introduced for on-line and off-line control strategies.

Solcz, Edward J.↗

NASA NTRS1998

Time-Critical Volume Rendering

For the past twelve months, we have conducted and completed a joint research entitled "Time- Critical Volume Rendering" with NASA Ames. As expected, High performance volume rendering algorithms have been developed by exploring some new faster rendering techniques, including object presence acceleration, parallel processing, and hierarchical level-of-detail representation. Using our new techniques, initial experiments have achieved real-time rendering rates of more than 10 frames per second of various 3D data sets with highest resolution. A couple of joint papers and technique reports as well as an interactive real-time demo have been compiled as the result of this project.

Kaufman, Arie↗

NASA NTRS2003

Performance of Goddard Earth Observing System GCM Column Radiation Models under Heterogeneous Cloud Conditions

We test the performance of the shortwave (SW) and longwave (LW) Column Radiation Models (CORAMs) of Chou and collaborators with heterogeneous cloud fields from a global single-day dataset produced by NCAR's Community Atmospheric Model with a 2-D CRM installed in each gridbox. The original SW version of the CORAM performs quite well compared to reference Independent Column Approximation (ICA) calculations for boundary fluxes, largely due to the success of a combined overlap and cloud scaling parameterization scheme. The absolute magnitude of errors relative to ICA are even smaller for the LW CORAM which applies similar overlap. The vertical distribution of heating and cooling within the atmosphere is also simulated quite well with daily-averaged zonal errors always below 0.3 K/d for SW heating rates and 0.6 K/d for LW cooling rates. The SW CORAM's performance improves by introducing a scheme that accounts for cloud inhomogeneity. These results suggest that previous studies demonstrating the inaccuracy of plane-parallel models may have unfairly focused on worst scenario cases, and that current radiative transfer algorithms of General Circulation Models (GCMs) may be more capable than previously thought in estimating realistic spatial and temporal averages of radiative fluxes, as long as they are provided with correct mean cloud profiles. However, even if the errors of the particular CORAMs are small, they seem to be systematic, and the impact of the biases can be fully assessed only with GCM climate simulations.

Oreopoulos, L.↗

NASA NTRS2003

Multifunction Sensor Algorithm Development

A multifunction sensor has been developed in the Sensors and Electronics Technology Branch. It is capable of measuring heat flux, surface temperature, and, in principle, strain magnitude & direction, while compensating for the apparent strain due to changes in operating temperature. In order to achieve this strain measuring capability, Mr. Zeller will work on improving the signal processing algorithm to include several special cases, such as when the principal strain axis lies either parallel to or perpendicular to one of the arms of the sensor. In addition, he will implement a GUI to make the sensor more user friendly.

Zeller, Donald F.↗

NASA NTRS2001

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗

NASA NTRS2010

Data Acquisition System for Multi-Frequency Radar Flight Operations Preparation

A three-channel data acquisition system was developed for the NASA Multi-Frequency Radar (MFR) system. The system is based on a commercial-off-the-shelf (COTS) industrial PC (personal computer) and two dual-channel 14-bit digital receiver cards. The decimated complex envelope representations of the three radar signals are passed to the host PC via the PCI bus, and then processed in parallel by multiple cores of the PC CPU (central processing unit). The innovation is this parallelization of the radar data processing using multiple cores of a standard COTS multi-core CPU. The data processing portion of the data acquisition software was built using autonomous program modules or threads, which can run simultaneously on different cores. A master program module calculates the optimal number of processing threads, launches them, and continually supplies each with data. The benefit of this new parallel software architecture is that COTS PCs can be used to implement increasingly complex processing algorithms on an increasing number of radar range gates and data rates. As new PCs become available with higher numbers of CPU cores, the software will automatically utilize the additional computational capacity.

Leachman, Jonathan↗

NASA NTRS2011

Energy Usage in an Embedded Space Vision Application on a Tiled Architecture

The need for greater autonomy in platforms such as planetary rovers is driving rapidly to codes that far overwhelm the capabilities of conventional space-qualified single core processors to run them in real-time. However, a new generation of potentially space-qualified 2D "tiled" multi-core microprocessor chips is emerging with significant performance potential. Leveraging such inherently parallel hardware for space platforms requires consideration of both time and power limitations - the latter of which is not normally done in conventional parallel computing. This paper takes one such application, Rockster, and analyzes it for energy usage when ported to a multi-core tiled chip such as may come from the Maestro program. The results demonstrate not only the criticality of memory and interconnect in the energy of real-time parallel codes, but also the effects of possible "energy-aware" changes in partitioning and algorithm design.

multi-core processors↗

NASA NTRS2016

Implementing Connected Component Labeling as a User Defined Operator for SciDB

We have implemented a flexible User Defined Operator (UDO) for labeling connected components of a binary mask expressed as an array in SciDB, a parallel distributed database management system based on the array data model. This UDO is able to process very large multidimensional arrays by exploiting SciDB's memory management mechanism that efficiently manipulates arrays whose memory requirements far exceed available physical memory. The UDO takes as primary inputs a binary mask array and a binary stencil array that specifies the connectivity of a given cell to its neighbors. The UDO returns an array of the same shape as the input mask array with each foreground cell containing the label of the component it belongs to. By default, dimensions are treated as non-periodic, but the UDO also accepts optional input parameters to specify periodicity in any of the array dimensions. The UDO requires four stages to completely label connected components. In the first stage, labels are computed for each subarray or chunk of the mask array in parallel across SciDB instances using the weighted quick union (WQU) with half-path compression algorithm. In the second stage, labels around chunk boundaries from the first stage are stored in a temporary SciDB array that is then replicated across all SciDB instances. Equivalences are resolved by again applying the WQU algorithm to these boundary labels. In the third stage, relabeling is done for each chunk using the resolved equivalences. In the fourth stage, the resolved labels, which so far are "flattened" coordinates of the original binary mask array, are renamed with sequential integers for legibility. The UDO is demonstrated on a 3-D mask of O(1011) elements, with O(108) foreground cells and O(106) connected components. The operator completes in 19 minutes using 84 SciDB instances.

UDO↗

NASA NTRSDate not supplied

Path Planning: Differential Dynamic Programming and Model Predictive Path Integral Control on VTOL Aircraft

This paper explores two optimal control approaches, widely used in robotics, to establish their viability as real-time trajectory planners for vehicle configurations envisioned for the emerging aviation sector of Urban Air Mobility (UAM). Differential Dynamic Programming (DDP) enables planning over highly nonlinear dynamics using second-order approximations along a nominal trajectory, and displays quadratic convergence to a local solution. Model Predictive Path Integral (MPPI) is a stochastic sampling-based algorithm that can optimize for general cost criteria, including potentially highly nonlinear formulations, and supports parallel computation through the use of modern GPU hardware. In this work, DDP and MPPI were implemented using model predictive control (MPC), and the results indicate they are able to successfully transition the aircraft over different flight envelopes and generate trajectories unique to UAM vehicles.

Differential Dynamic Programming↗

NASA NTRSDate not supplied

Development and Airborne Demonstration of the Concurrent Artificially-Intelligent Spectrometry and Adaptive Lidar System: Advancing Lidar Capabilities for the STV Observing System

We report on the design, build and planned airborne demonstration of a spaceflight-prototype Concurrent Artificially-intelligent Spectrometry and Adaptive Lidar System (CASALS). The CASALS lidar is an Adaptive Wavelength Scanning Lidar (AWSL) operating in push broom mode. The demonstration has three major goals: advance the Technical Readiness Level of the AWSL hardware, validate its measurement performance and mature algorithms and methods needed for the Surface Topography and Vegetation (STV) observing system. AWSL acquires parallel tracks of surface heights by rapidly steering a laser beam across a swath. A 1040nm-centered laser is tuned across 30nm and carved into 2-ns pulses, the pulse energy is fiber amplified and the pulses are dispersed cross-track using a non-mechanical wavelength-to-angle grating. For the spaceflight system the beam will be pointable to 1200 10m footprints across a 7km swath. For the airborne demonstration there will be 256 0.7m footprints across a 110m swath. In both cases the footprints overlap across- and along-track for uniform target illumination. For the airborne demonstration a steering mirror will increase the accessible swath width to 4km. At the receiver, solar radiation is filtered with a narrow-slit grating-spectrometer and the footprints are imaged onto a linear-mode, photon-sensitive HgCdTe APD-array. The received pulses are time-division-multiplexed to a few high-speed analog-to-digital converters to record waveforms. Spaceflight and airborne CASALS are designed to nominally detect 20 photons per pulse and, by averaging 27 overlapping footprints, achieve 2cm flat target range precision and high-quality vegetation structure waveforms The AWSL will be flown in the summer of 2024, along with a Headwall VNIR-SWIR hyperspectral sensor imaging a 4km wide swath, at NEON eddy covariance flux towers in the U.S. mid-Atlantic where high resolution hyperspectral and lidar data, acquired annually, are available for validation.

Guangning Yang↗

NASA NTRS2023

A computationally efficient statistically downscaled 100 m resolution Greenland product from the regional climate model MAR

The Greenland Ice Sheet (GrIS) has been contributing directly to sea level rise, and this contribution is projected to accelerate over the next decades. A crucial tool for studying the evolution of surface mass loss (e.g., surface mass balance, SMB) consists of regional climate models (RCMs), which can provide current estimates and future projections of sea level rise associated with such losses. However, one of the main limitations of RCMs is the relatively coarse horizontal spatial resolution at which outputs are currently generated. Here, we report results concerning the statistical downscaling of the SMB modeled by the Modèle Atmosphérique Régional (MAR) RCM from the original spatial resolution of 6 km to 100 m building on the relationship between elevation and mass losses in Greenland. To this goal, we developed a geospatial framework that allows the parallelization of the downscaling process, a crucial aspect to increase the computational efficiency of the algorithm. Using the results obtained in the case of the SMB, surface and air temperature are assessed through the comparison of the modeled outputs with in situ and satellite measurement. The downscaled products show a considerable improvement in the case of the downscaled product with respect to the original coarse output, with the coefficient of determination (R 2 ) increasing from 0.868 for the original MAR output to 0.935 for the SMB downscaled product. Moreover, the value of the slope and intercept of the linear regression fitting modeled and measured SMB values shifts from 0.865 for the original MAR to 1.015 for the downscaled product in the case of the slope and from the value −235 mm w.e. yr -1 (original) to −57 mm w.e. yr -1 (downscaled) in the case of the intercept, considerably improving upon results previously published in the literature.

Greenland Ice Sheet↗