Design Space Exploration for MDO on a Teraflop Computer
The objective of this project was to make efficient use of massively parallel computation for exploration of high-dimensional aircraft-configuration design space.
Grossman, Bernard↗
SEARCH · Engineering Papers
Results for “parallel efficiency”
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.
Design and Implementation of a Parallel Multivariate Ensemble Kalman Filter for the Poseidon Ocean General Circulation Model
A multivariate ensemble Kalman filter (MvEnKF) implemented on a massively parallel computer architecture has been implemented for the Poseidon ocean circulation model and tested with a Pacific Basin model configuration. There are about two million prognostic state-vector variables. Parallelism for the data assimilation step is achieved by regionalization of the background-error covariances that are calculated from the phase-space distribution of the ensemble. Each processing element (PE) collects elements of a matrix measurement functional from nearby PEs. To avoid the introduction of spurious long-range covariances associated with finite ensemble sizes, the background-error covariances are given compact support by means of a Hadamard (element by element) product with a three-dimensional canonical correlation function. The methodology and the MvEnKF configuration are discussed. It is shown that the regionalization of the background covariances; has a negligible impact on the quality of the analyses. The parallel algorithm is very efficient for large numbers of observations but does not scale well beyond 100 PEs at the current model resolution. On a platform with distributed memory, memory rather than speed is the limiting factor.
Keppenne, Christian L.↗
Monolithic Parallel Tandem Organic Photovoltaic Cell with Transparent Carbon Nanotube Interlayer
We demonstrate an organic photovoltaic cell with a monolithic tandem structure in parallel connection. Transparent multiwalled carbon nanotube sheets are used as an interlayer anode electrode for this parallel tandem. The characteristics of front and back cells are measured independently. The short circuit current density of the parallel tandem cell is larger than the currents of each individual cell. The wavelength dependence of photocurrent for the parallel tandem cell shows the superposition spectrum of the two spectral sensitivities of the front and back cells. The monolithic three-electrode photovoltaic cell indeed operates as a parallel tandem with improved efficiency.
Tanaka, S.↗
Mixed Linear/Square-Root Encoded Single-Slope Ramp Provides Low-Noise ADC with High Linearity for Focal Plane Arrays
Single-slope analog-to-digital converters (ADCs) are particularly useful for onchip digitization in focal plane arrays (FPAs) because of their inherent monotonicity, relative simplicity, and efficiency for column-parallel applications, but they are comparatively slow. Squareroot encoding can allow the number of code values to be reduced without loss of signal-to-noise ratio (SNR) by keeping the quantization noise just below the signal shot noise. This encoding can be implemented directly by using a quadratic ramp. The reduction in the number of code values can substantially increase the quantization speed. However, in an FPA, the fixed pattern noise (FPN) limits the use of small quantization steps at low signal levels. If the zero-point is adjusted so that the lowest column is onscale, the other columns, including those at the center of the distribution, will be pushed up the ramp where the quantization noise is higher. Additionally, the finite frequency response of the ramp buffer amplifier and the comparator distort the shape of the ramp, so that the effective ramp value at the time the comparator trips differs from the intended value, resulting in errors. Allowing increased settling time decreases the quantization speed, while increasing the bandwidth increases the noise. The FPN problem is solved by breaking the ramp into two portions, with some fraction of the available code values allocated to a linear ramp and the remainder to a quadratic ramp. To avoid large transients, both the value and the slope of the linear and quadratic portions should be equal where they join. The span of the linear portion must cover the minimum offset, but not necessarily the maximum, since the fraction of the pixels above the upper limit will still be correctly quantized, albeit with increased quantization noise. The required linear span, maximum signal and ratio of quantization noise to shot noise at high signal, along with the continuity requirement, determines the number of code values that must be allocated to each portion. The distortion problem is solved by using a lookup table to convert captured code values back to signal levels. The values in this table will be similar to the intended ramp value, but with a correction for the finite bandwidth effects. Continuous-time comparators are used, and their bandwidth is set below the step rate, which smoothes the ramp and reduces the noise. No settling time is needed, as would be the case for clocked comparators, but the low bandwidth enhances the distortion of the non-linear portion. This is corrected by use of a return lookup table, which differs from the one used to generate the ramp. The return lookup table is obtained by calibrating against a stepped precision DC reference. This results in a residual non-linearity well below the quantization noise. This method can also compensate for differential non-linearity (DNL) in the DAC used to generate the ramp. The use of a ramp with a combination of linear and quadratic portions for a single-slope ADC is novel. The number of steps is minimized by keeping the step size just below the photon shot noise. This in turn maximizes the speed of the conversion. High resolution is maintained by keeping small quantization steps at low signals, and noise is minimized by allowing the lowest analog bandwidth, all without increasing the quantization noise. A calibrated return lookup table allows the system to maintain excellent linearity.
Wrigley, Chris J.↗
The Use of Field Programmable Gate Arrays (FPGA) in Small Satellite Communication Systems
This paper will describe the use of digital Field Programmable Gate Arrays (FPGA) to contribute to advancing the state-of-the-art in software defined radio (SDR) transponder design for the emerging SmallSat and CubeSat industry and to provide advances for NASA as described in the TAO5 Communication and Navigation Roadmap (Ref 4). The use of software defined radios (SDR) has been around for a long time. A typical implementation of the SDR is to use a processor and write software to implement all the functions of filtering, carrier recovery, error correction, framing etc. Even with modern high speed and low power digital signal processors, high speed memories, and efficient coding, the compute intensive nature of digital filters, error correcting and other algorithms is too much for modern processors to get efficient use of the available bandwidth to the ground. By using FPGAs, these compute intensive tasks can be done in parallel, pipelined fashion and more efficiently use every clock cycle to significantly increase throughput while maintaining low power. These methods will implement digital radios with significant data rates in the X and Ka bands. Using these state-of-the-art technologies, unprecedented uplink and downlink capabilities can be achieved in a 1/2 U sized telemetry system. Additionally, modern FPGAs have embedded processing systems, such as ARM cores, integrated inside the FPGA allowing mundane tasks such as parameter commanding to occur easily and flexibly. Potential partners include other NASA centers, industry and the DOD. These assets are associated with small satellite demonstration flights, LEO and deep space applications. MSFC currently has an SDR transponder test-bed using Hardware-in-the-Loop techniques to evaluate and improve SDR technologies.
Varnavas, Kosta↗
Cartesian Mesh Simulations for the Third AIAA Sonic Boom Prediction Workshop
Simulation results are presented for all cases from the Third AIAA Sonic Boom Prediction Workshop. An inviscid, embedded-boundary Cartesian-mesh flow solver is used in conjunction with adjoint-based mesh adaptation to compute nearfield pressure signatures. Specialized techniques are applied to maximize accuracy and minimize cost on Cartesian meshes. The Richardson-based error estimate highlights regions of the signatures most sensitive to mesh refinement. Timing results and coarse, medium, and fine mesh sizes for nearfield cases demonstrate that the parallel decomposition approach is efficient in both computational time and wall-clock. Pressure signals are propagated to the ground using an augmented Burgers’ equation solver to predict boom carpets. Ground signatures and loudness metrics are presented for a standard atmosphere as well as more realistic atmospheric profiles, which affect overall noise levels and can significantly widen the boom carpet. Mesh convergence studies show that high sampling frequencies, around 500 kHz, are required for propagation, and the sampling frequency increases at large off-track angles with longer acoustic ray paths and propagation times. The numerical methods yield accurate results for predicting low sonic boom signatures while being among the least computationally expensive of the workshop.
ARMD↗
Particle Interaction Physics Model Formulation for Plume-Surface Interaction Erosion and Cratering
As part of the Game Changing Development (GCD) Program, funded by NASA’s Space Technology Mission Directorate (STMD), the development of simulation capability for the prediction of extra-terrestrial Plume Surface Interaction (PSI) environments has been undertaken by the Fluid Dynamics Branch at NASA/MSFC. The Predictive Simulation Capability (PSC) Element is focused on creating simulation capability for the reliable and accurate prediction of PSI in Martian (~650 Pa) and Lunar (vacuum) ambient environments. In addition to the predictive simulation capability, the GCD Program also contains a companion Ground Testing Element for development of focused datasets for validation of predictive capability as well as a Flight-focused Instrumentation Element. This paper will present the status of implementing and maturing particle-particle interaction constituent physics models essential in simulating the landing surface granular material flow under PSI effects. This gas-particle multi-phase interaction modeling of plume impingement flow on the extra-terrestrial soil material is performed with the Gas-Granular Flow Solver (GGFS) addressed in a companion paper. The response of regolith particle flow induced by lander PSI requires accurate representation of the regolith granular material fluidic behavior and gas-granular interactions. The lunar regolith, as the extreme example, is poorly sorted with broad particle size distributions and large fines content. It has significant cohesion, due to interlocking particle shapes for the very jagged particles. The combination of particle shape and size distribution has been identified as major drivers in the complex particle flow response and resulting crater shape characteristics of extraterrestrial granular material. Constituent models for spherical particles can be formulated directly from particle kinetics theory. Complex particle shapes can be modeled by gluing together elemental spherical shapes into composite particles, requiring a Discrete Element Model (DEM) particle kinetics modeling approach to extract data and formulate constituent models. Mixture constituent models for poly-disperse mixtures (i.e, containing distribution of particle sizes) have recently been developed. The required non-spherical particle mixture granular material response closure models are then obtained through small-scale unit physics DEM simulations for the range of particle shapes, mixtures and packing densities. The granular material response closure models are then implemented in the Eulerian granular flow formulation. This DEM-based constituent model extraction process and formulation of poly-disperse particle mixtures has been successfully developed by small business and academic partners in the development of the Gas-Granular Flow Solver (GGFS) simulation program simulation framework. The currently implemented capabilities have reached the capability level of modeling bi-disperse, non-spherical particle mixtures is being continuously extended towards computational modeling of full range irregular particle mixtures. Under the GCD project, this technology is being further developed, transferred to NASA analysts, and matured towards application readiness. The predictive simulation capability team under the GCD project has acquired the modeling tools and processes of the DEM based constituent model formulation from the GGFS development team and is developing the capability to replicate the existing process. This is the first important step towards the ability of the NASA team to independently perform such model development in a production setting. Further efforts are underway to migrate the DEM based model simulation process performed with the academic based tools to more capable Open Source, highly parallelized simulation tools for efficient operation on NASA HPC assets. Evaluation of the currently implemented (such as mono-disperse and bi-disperse spherical and irregular shape particle constituent model applications) and continuously evolving full-range particle physics models in the GGFS tool is performed by the NASA team to advance application readiness of the simulations. Application testing for complex PSI erosions and cratering scenarios such as the Apollo LM is performed for axi-symmetric and full 3D simulations to aid the tool developers in achieving practical application readiness for NASA projects. Important validation and application testing will further be performed against experimental data generated under the GCD PSI project experimental component.
Peter A Liever↗
VULCAN-CFD User Manual: Ver. 7.2.0
VULCAN-CFD offers a comprehensive set of capabilities to enable the simulation of continuum flowfields from subsonic to hypersonic conditions. The governing equations that are employed include allowances for both chemical and thermal nonequilibrium processes, coupled with a wide variety of turbulence models for both Reynolds-averaged and large eddy simulations. The software package can simulate two-dimensional, axisymmetric, or three-dimensional problems on structured multiblock meshes or fully unstructured meshes. A parabolic (i.e., space-marching) treatment can also be used for any subset of a structured mesh that can accommodate this solution strategy. The flow solver provides a significant level of geometric flexibility for structured grid simulations by allowing for arbitrary face-to-face C(0) continuous and non-C(0) continuous block interface connectivities. The unstructured grid paradigm allows for mixed element unstructured meshes that contain any combination of tetrahedral, prismatic, pyramidal, and hexahedral cell elements. The flow solver is also fully parallelized using MPI (Message Passing Interface) libraries in a data-parallel fashion, allowing for efficient simulations on modern High Performance Computing (HPC) systems. This document provides information related to the installation and execution of the VULCAN-CFD software package. A detailed description of the physical and numerical models available in the software are provided in the VULCAN-CFD Theory Manual.
VULCAN-CFD User Manual↗
Resonance line transfer calculations by doubling thin layers. I - Comparison with other techniques. II - The use of the R-parallel redistribution function
A versatile and efficient technique for the solution of the resonance line scattering problem with frequency redistribution in planetary atmospheres is introduced. Similar to the doubling approach commonly used in monochromatic scattering problems, the technique has been extended to include the frequency dependence of the radiation field. Methods for solving problems with external or internal sources and coupled spectral lines are presented, along with comparison of some sample calculations with results from Monte Carlo and Feautrier techniques. The doubling technique has also been applied to the solution of resonance line scattering problems where the R-parallel redistribution function is appropriate, both neglecting and including polarization as developed by Yelle and Wallace (1989). With the constraint that the atmosphere is illuminated from the zenith, the only difficulty of consequence is that of performing precise frequency integrations over the line profiles. With that problem solved, it is no longer necessary to use the Monte Carlo method to solve this class of problem.
Yelle, Roger V.↗
Self-consistent Evolution of Cosmic-Ray Shocks
Several key accomplishments were achieved under this grant. In the first year we combined our novel adaptive mesh refinement code for diffusive shock acceleration with the implementation of the Malkov/Volk thermal leakage injection model to produce an extremely powerful new modeling tool. We used it to examine the time evolution of highly modified CR shocks in a systematic way, finding that characteristic proton injection efficiencies for strong quasi-parallel shocks should be a few parts in l0(exp -4). That is sufficient for even moderately strong shocks to become efficient CR accelerators and substantially modified in structure. Those results were published in the Astrophysical Journal.
Jones, Thomas W.↗
An intelligent processing environment for real-time simulation
The development of a highly efficient and thus truly intelligent processing environment for real-time general purpose simulation of continuous systems is described. Such an environment can be created by mapping the simulation process directly onto the University of Alamba's OPERA architecture. To facilitate this effort, the field of continuous simulation is explored, highlighting areas in which efficiency can be improved. Areas in which parallel processing can be applied are also identified, and several general OPERA type hardware configurations that support improved simulation are investigated. Three direct execution parallel processing environments are introduced, each of which greatly improves efficiency by exploiting distinct areas of the simulation process. These suggested environments are candidate architectures around which a highly intelligent real-time simulation configuration can be developed.
Carroll, Chester C.↗
Serial and parallel computation of Kane's equations for multibody dynamics
The analysis of the efficiency of algorithms resulting from Kane's Equation for serial and parallel computation of mass matrix is examined. The algorithms resulting from Kane's equation and Modified Kane's equations are detailed. An analysis was made of two classes of algorithms for computation of mass matrix: the Newton-Euler based algorithms and the Composite rigid body algorithms. An analysis was also made of the efficiency of different algorithms for serial and parallel computations. Conclusions are drawn and presented.
Fijany, Amir↗
Solar power satellite rectenna design study: Directional receiving elements and parallel-series combining analysis
Rectenna conversion efficiencies (RF to dc) approximating 85 percent were demonstrated on a small scale, clearly indicating the feasibility and potential of efficiency of microwave power to dc. The overall cost estimates of the solar power satellite indicate that the baseline rectenna subsystem will be between 25 to 40 percent of the system cost. The directional receiving elements and element extensions were studied, along with power combining evaluation and evaluation extensions.
Gutmann, R. J.↗
Labeled trees and the efficient computation of derivations
The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.
Grossman, Robert↗
A transient FETI methodology for large-scale parallel implicit computations in structural mechanics
Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.
Farhat, Charbel↗
A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2
Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.
Farhat, Charbel↗
Parallel NPARC: Implementation and Performance
Version 3 of the NPARC Navier-Stokes code includes support for large-grain (block level) parallelism using explicit message passing between a heterogeneous collection of computers. This capability has the potential for significant performance gains, depending upon the block data distribution. The parallel implementation uses a master/worker arrangement of processes. The master process assigns blocks to workers, controls worker actions, and provides remote file access for the workers. The processes communicate via explicit message passing using an interface library which provides portability to a number of message passing libraries, such as PVM (Parallel Virtual Machine). A Bourne shell script is used to simplify the task of selecting hosts, starting processes, retrieving remote files, and terminating a computation. This script also provides a simple form of fault tolerance. An analysis of the computational performance of NPARC is presented, using data sets from an F/A-18 inlet study and a Rocket Based Combined Cycle Engine analysis. Parallel speedup and overall computational efficiency were obtained for various NPARC run parameters on a cluster of IBM RS6000 workstations. The data show that although NPARC performance compares favorably with the estimated potential parallelism, typical data sets used with previous versions of NPARC will often need to be reblocked for optimum parallel performance. In one of the cases studied, reblocking increased peak parallel speedup from 3.2 to 11.8.
Townsend, S. E.↗
Case studies in serial and parallel simulation
The design of a ground combat simulation in a time-driven and in an event-driven style is discussed. The differences between time-driven and event-driven simulation are illustrated, and performance results for the two systems executing both serially and in parallel are presented. It is noted that the event-driven style produces a more efficient system both serially and in parallel, primarily because it minimizes the number of messages produced and thereby reduces the amount of computation.
Wieland, Frederick↗