Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel computers.”

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 1,189 records · Page 66

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

Computation of Coupled Thermal-Fluid Problems in Distributed Memory Environment

The thermal-fluid coupling problems are very important to aerospace and engineering applications. Instead of analyzing heat transfer and fluid flow separately, this study merged two well-accepted engineering solution methods, SINDA for thermal analysis and FDNS for fluid flow simulation, into a unified multi-disciplinary thermal fluid prediction method. A fully conservative patched grid interface algorithm for arbitrary two-dimensional and three-dimensional geometry has been developed. The state-of-the-art parallel computing concept was used to couple SINDA and FDNS for the communication of boundary conditions through PVM (Parallel Virtual Machine) libraries. Therefore, the thermal analysis performed by SINDA and the fluid flow calculated by FDNS are fully coupled to obtain steady state or transient solutions. The natural convection between two thick-walled eccentric tubes was calculated and the predicted results match the experiment data perfectly. A 3-D rocket engine model and a real 3-D SSME geometry were used to test the current model, and the reasonable temperature field was obtained.

Wei, H.↗

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗

RAPID

Parallel computer code for the simulator for dynamics of power systems which has the capability to initiate the system and create different faults for the dynamic analysis. The code is based on time-parallel method (Parareal) with Adaptive Method Reduction (AMR). The coarse solvers for the Parareal algorithm include several Semi Analytical Solution methods. Also, Integrated simulation of coupled transmission and distribution systems can be studied.

Simunovic, Srdjan [Oak Ridge National Lab. (ORNL),↗

The Secret Life of Quarks, Final Report for the University of North Carolina at Chapel Hill

This final report summarizes activities and results at the University of North Carolina as part of the the SciDAC-2 Project The Secret Life of Quarks: National Computational Infrastructure for Lattice Quantum Chromodynamics. The overall objective of the project is to construct the software needed to study quantum chromo- dynamics (QCD), the theory of the strong interactions of subatomic physics, and similar strongly coupled gauge theories anticipated to be of importance in the LHC era. It built upon the successful efforts of the SciDAC-1 project National Computational Infrastructure for Lattice Gauge Theory, in which a QCD Applications Programming Interface (QCD API) was developed that enables lat- tice gauge theorists to make effective use of a wide variety of massively parallel computers. In the SciDAC-2 project, optimized versions of the QCD API were being created for the IBM Blue- Gene/L (BG/L) and BlueGene/P (BG/P), the Cray XT3/XT4 and its successors, and clusters based on multi-core processors and Infiniband communications networks. The QCD API is being used to enhance the performance of the major QCD community codes and to create new applications. Software libraries of physics tools have been expanded to contain sharable building blocks for inclusion in application codes, performance analysis and visualization tools, and software for au- tomation of physics work flow. New software tools were designed for managing the large data sets generated in lattice QCD simulations, and for sharing them through the International Lattice Data Grid consortium. As part of the overall project, researchers at UNC were funded through ASCR to work in three general areas. The main thrust has been performance instrumentation and analysis in support of the SciDAC QCD code base as it evolved and as it moved to new computation platforms. In support of the performance activities, performance data was to be collected in a database for the purpose of broader analysis. Third, the UNC work was done at RENCI (Renaissance Computing Institute), which has extensive expertise and facilities for scientific data visualization, so we acted in an ongoing consulting and support role in that area.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of the hypercube parallel processor to a large-scale moment method code

The applicability of a parallel computing architecture to the solution of a large-scale moment-method code is investigated. Specifically, the NEC (Numerical Electromagnetics Code) method-of-moments scattering program is implemented on a hypercube parallel processor. The accuracy and the increase in the speed of execution on this parallel architecture are demonstrated. The results show a very large reduction in execution time for large problems. The great potential of this parallel processor is shown for interactive solution of large NEC problems as well as other moment-method techniques such as the finite-element method.

Manshadi, Farzin↗

Recognizing Patterns In Log-Polar Coordinates

Log-Hough transform is basis of improved method for recognition of patterns - particularly, straight lines - in noisy images. Takes advantage of rotational and scale invariance of mapping from Cartesian to log-polar coordinates, and offers economy of representation and computation. Unification of iconic and Hough domains simplifies computations in recognition and eliminates erroneous quantization of slopes attributable to finite spacing of Cartesian coordinate grid of classical Hough transform. Equally efficient recognizing curves. Log-Hough transform more amenable to massively parallel computing architectures than traditional Cartesian Hough transform. "In-place" nature makes it possible to apply local pixel-neighborhood processing.

Weiman, Carl F. R.↗

Optical computing at NASA Ames Research Center

Optical computing research at NASA Ames Research Center seeks to utilize the capability of analog optical processing, involving free-space propagation between components, to produce natural implementations of algorithms requiring large degrees of parallel computation. Potential applications being investigated include robotic vision, planetary lander guidance, aircraft engine exhaust analysis, analysis of remote sensing satellite multispectral images, control of space structures, and autonomous aircraft inspection.

Reid, Max B.↗

Spaceborne Processor Array

A Spaceborne Processor Array in Multifunctional Structure (SPAMS) can lower the total mass of the electronic and structural overhead of spacecraft, resulting in reduced launch costs, while increasing the science return through dynamic onboard computing. SPAMS integrates the multifunctional structure (MFS) and the Gilgamesh Memory, Intelligence, and Network Device (MIND) multi-core in-memory computer architecture into a single-system super-architecture. This transforms every inch of a spacecraft into a sharable, interconnected, smart computing element to increase computing performance while simultaneously reducing mass. The MIND in-memory architecture provides a foundation for high-performance, low-power, and fault-tolerant computing. The MIND chip has an internal structure that includes memory, processing, and communication functionality. The Gilgamesh is a scalable system comprising multiple MIND chips interconnected to operate as a single, tightly coupled, parallel computer. The array of MIND components shares a global, virtual name space for program variables and tasks that are allocated at run time to the distributed physical memory and processing resources. Individual processor- memory nodes can be activated or powered down at run time to provide active power management and to configure around faults. A SPAMS system is comprised of a distributed Gilgamesh array built into MFS, interfaces into instrument and communication subsystems, a mass storage interface, and a radiation-hardened flight computer.

Chow, Edward T.↗

NASA Tech Briefs, January 2006

Topics covered include: Semiautonomous Avionics-and-Sensors System for a UAV; Biomimetic/Optical Sensors for Detecting Bacterial Species; System Would Detect Foreign-Object Damage in Turbofan Engine; Detection of Water Hazards for Autonomous Robotic Vehicles; Fuel Cells Utilizing Oxygen From Air at Low Pressures; Hybrid Ion-Detector/Data-Acquisition System for a TOF-MS; Spontaneous-Desorption Ionizer for a TOF-MS; Equipment for On-Wafer Testing From 220 to 325 GHz; Computing Isentropic Flow Properties of Air/R-134a Mixtures; Java Mission Evaluation Workstation System; Using a Quadtree Algorithm To Assess Line of Sight; Software for Automated Generation of Cartesian Meshes; Optics Program Modified for Multithreaded Parallel Computing; Programs for Testing Processor-in-Memory Computing Systems; PVM Enhancement for Beowulf Multiple-Processor Nodes; Ion-Exclusion Chromatography for Analyzing Organics in Water; Selective Plasma Deposition of Fluorocarbon Films on SAMs; Water-Based Pressure-Sensitive Paints; System Finds Horizontal Location of Center of Gravity; Predicting Tail Buffet Loads of a Fighter Airplane; Water Containment Systems for Testing High-Speed Flywheels; Vapor-Compression Heat Pumps for Operation Aboard Spacecraft; Multistage Electrophoretic Separators; Recovering Residual Xenon Propellant for an Ion Propulsion System; Automated Solvent Seaming of Large Polyimide Membranes; Manufacturing Precise, Lightweight Paraboloidal Mirrors; Analysis of Membrane Lipids of Airborne Micro-Organisms; Noninvasive Diagnosis of Coronary Artery Disease Using 12-Lead High-Frequency Electrocardiograms; Dual-Laser-Pulse Ignition; Enhanced-Contrast Viewing of White-Hot Objects in Furnaces; Electrically Tunable Terahertz Quantum-Cascade Lasers; Few-Mode Whispering-Gallery-Mode Resonators; Conflict-Aware Scheduling Algorithm; and Real-Time Diagnosis of Faults Using a Bank of Kalman Filters.

Source record↗

Flow Control Under Low-Pressure Turbine Conditions Using Pulsed Jets

This publication is the final report of research performed under an NRA/Cooperative Interagency Agreement, and includes a supplemental CD-ROM with detailed data. It is complemented by NASA/CR-2012-217416 and NASA/CR-2012-217417 which include a Ph.D. Dissertation and an M.S. thesis respectively, performed under this contract. In this study the effects of unsteady wakes and flow control using vortex generator jets (VGJs) were studied experimentally and computationally on the flow over the L1A low pressure turbine (LPT) airfoil. The experimental facility was a six passage linear cascade in a low speed wind tunnel at the U.S. Naval Academy. In parallel, computational work using the commercial code FLUENT (ANSYS, Inc.) was performed at Cleveland State University, using Unsteady Reynolds Averaged Navier Stokes (URANS) and Large Eddy Simulations (LES) methods. In the first phase of the work, the baseline flow was documented under steady inflow conditions without flow control. URANS calculations were done using a variety of turbulence models. In the second phase of the work, flow control was added using steady and pulsed vortex generator jets. The VGJs successfully suppressed separation and reduced aerodynamic losses. Pulsed operation was more effective and mass flow requirements are very low. Numerical simulations of the VGJs cases showed that URANS failed to capture the effect of the jets. LES results were generally better. In the third phase, effects of unsteady wakes were studied. Computations with URANS and LES captured the wake effect and generally predicted separation and reattachment to match the experiments. Quantitatively the results were mixed. In the final phase of the study, wakes and VGJs were combined and synchronized using various timing schemes. The timing of the jets with respect to the wakes had some effect, but in general once the disturbance frequency was high enough to control separation, the timing was not very important.

Volino, Ralph J.↗

Flow Control Under Low-Pressure Turbine Conditions Using Pulsed Jets: Experimental Data Archive

This publication is the final report of research performed under an NRA/Cooperative Interagency Agreement, and includes a supplemental CD-ROM with detailed data. It is complemented by NASA/CR-2012-217416 and NASA/CR-2012-217417 which include a Ph.D. Dissertation and an M.S. thesis respectively, performed under this contract. In this study the effects of unsteady wakes and flow control using vortex generator jets (VGJs) were studied experimentally and computationally on the flow over the L1A low pressure turbine (LPT) airfoil. The experimental facility was a six passage linear cascade in a low speed wind tunnel at the U.S. Naval Academy. In parallel, computational work using the commercial code FLUENT (ANSYS, Inc.) was performed at Cleveland State University, using Unsteady Reynolds Averaged Navier Stokes (URANS) and Large Eddy Simulations (LES) methods. In the first phase of the work, the baseline flow was documented under steady inflow conditions without flow control. URANS calculations were done using a variety of turbulence models. In the second phase of the work, flow control was added using steady and pulsed vortex generator jets. The VGJs successfully suppressed separation and reduced aerodynamic losses. Pulsed operation was more effective and mass flow requirements are very low. Numerical simulations of the VGJs cases showed that URANS failed to capture the effect of the jets. LES results were generally better. In the third phase, effects of unsteady wakes were studied. Computations with URANS and LES captured the wake effect and generally predicted separation and reattachment to match the experiments. Quantitatively the results were mixed. In the final phase of the study, wakes and VGJs were combined and synchronized using various timing schemes. The timing of the jets with respect to the wakes had some effect, but in general once the disturbance frequency was high enough to control separation, the timing was not very important. This is the supplemental CD-ROM

Volino, Ralph J.↗

Dynamic Smagorinsky Modeled Large-Eddy Simulations of Turbulence Using Tetrahedral Meshes

Eddy-resolving numerical computations of turbulent flows are emerging as viable alternatives to Reynolds Averaged Navier-Stokes (RANS) calculations for flows with an intrinsically steady mean state due to the advances in large-scale parallel computing. In these computations, medium to large turbulent eddies are resolved by the numerics while the smaller or subgrid scales are either modeled or taken care of by the inherent numerical dissipation. To advance the state of the art of unstructured-mesh turbulence simulation capabilities, large eddy simulations (LES) using the dynamic Smagorinsky model (DSM) on tetrahedral meshes are carried out with the space-time conservation element, solution element (CESE) method. In contrast to what has been reported in the literature, the present implementation of dynamic models allows for active backscattering without any ad-hoc limiting of the eddy viscosity calculated from the subgrid-scale model. For the benchmark problems involving compressible isotropic turbulence decay as well as the shock/turbulent boundary layer interaction benchmark problems, no numerical instability associated with kinetic energy growth is observed and the volume percentage of the backscattering portion accounts for about 38-40% of the simulation domain. A slip-wall model in conjunction with the implemented DSM is used to simulate a relatively high Reynolds number Mach 2.85 turbulent boundary layer over a 30° ramp with several tetrahedral meshes and a wall-normal spacing of either Δγ& = 10 or Δγ& = 20. The computed mean wall pressure distribution, separation region size, mean velocity profiles, and Reynolds stress agree reasonably well with experimental data.

CESE method↗

USRA/RIACS

The Research Institute for Advanced Computer Science (RIACS) was established by the Universities Space Research Association (USRA) at the NASA Ames Research Center (ARC) on June 6, 1983. RIACS is privately operated by USRA, a consortium of universities with research programs in the aerospace sciences, under a cooperative agreement with NASA. The primary mission of RIACS is to provide research and expertise in computer science and scientific computing to support the scientific missions of NASA ARC. The research carried out at RIACS must change its emphasis from year to year in response to NASA ARC's changing needs and technological opportunities. A flexible scientific staff is provided through a university faculty visitor program, a post doctoral program, and a student visitor program. Not only does this provide appropriate expertise but it also introduces scientists outside of NASA to NASA problems. A small group of core RIACS staff provides continuity and interacts with an ARC technical monitor and scientific advisory group to determine the RIACS mission. RIACS activities are reviewed and monitored by a USRA advisory council and ARC technical monitor. Research at RIACS is currently being done in the following areas: (1) parallel computing; (2) advanced methods for scientific computing; (3) learning systems; (4) high performance networks and technology; and (5) graphics, visualization, and virtual environments. In the past year, parallel compiler techniques and adaptive numerical methods for flows in complicated geometries were identified as important problems to investigate for ARC's involvement in the Computational Grand Challenges of the next decade. We concluded a summer student visitors program during this six months. We had six visiting graduate students that worked on projects over the summer and presented seminars on their work at the conclusion of their visits. RIACS technical reports are usually preprints of manuscripts that have been submitted to research journals or conference proceedings. A list of these reports for the period July 1, 1992 through December 31, 1992 is provided.

Oliger, Joseph↗

Quantum transport modelling of silicon nanobeams using heterogeneous computing scheme

We report the development of a powerful method for quantum transport calculations of nanowire/nanobeam structures with large cross sectional area. Our approach to quantum transport is based on Green's functions and tight-binding potentials. A linear algebraic formulation allows us to harness the massively parallel nature of Graphics Processing Units (GPUs) and our implementation is based on a heterogeneous parallel computing scheme with traditional processors and GPUs working together. Using our software tool, the electronic and quantum transport properties of silicon nanobeams with a realistic cross sectional area of ∼22.7 nm{sup 2} and a length of ∼81.5 nm—comprising 105 000 Si atoms and 24 000 passivating H atoms in the scattering region—are investigated. The method also allows us to perform significant averaging over impurity configurations—all possible configurations were considered in the case of single impurities. Finally, the effect of the position and number of vacancy defects on the transport properties was considered. It is found that the configurations with the vacancies lying closer to the local density of states (LDOS) maxima have lower transmission functions than the configurations with the vacancies located at LDOS minima or far away from LDOS maxima, suggesting both a qualitative method to tune or estimate optimal impurity configurations as well as a physical picture that accounts for device variability. Finally, we provide performance benchmarks for structures as large as ∼42.5 nm{sup 2} cross section and ∼81.5 nm length.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Evaluating Ground Motion Predictions of USGS 3D Seismic Model of the San Francisco Bay Area with Broadband Seismograms

The USGS (Menlo Park) developed a three-dimensional (3D) geologic and seismic model of the greater San Francisco Bay Area for the purposes of computing earthquake ground motions. This model was used to compute scenario ground motions for the 1906 San Francisco, 1989 Loma Prieta and a suite of Hayward Fault earthquakes. While scenario ground motion calculations are important for investigating the amplitude, duration and variability of motions from large damaging earthquakes, the accuracy of such predictions depends on the accuracy of the 3D model. We evaluated the USGS 3D model of the Bay Area by computing predictions of broadband waveforms for 12 moderate (Mw 4-5) earthquakes and comparing them to the observed waveforms. Calculations were performed using WPP (an elastic finite difference code developed at LLNL) on massively parallel computers. Data were obtained from IRIS for Berkeley Digital Seismic Network (BDSN) and USArray broadband stations. The figure below shows a snapshot of the vertical component displacements for an earthquake near Glen Ellen (Sonoma County). Also shown is the comparison of the observed (blue) and computed (red) three-component seismograms at two stations: BKS (Berkeley) and JRSC (Stanford). Note that the motions at BKS are more complex and longer duration due to basin propagation effects from the San Pablo Bay, however the 3D model predicts this energy quite well. The motions at JRSC are simpler and the 3D model predicts the weaker late arriving energy on the transverse (T) component. This analysis found that the USGS 3D model could predict the amplitude, duration and waveform shapes of moderate earthquake ground motions quite well however we did find that phase delays reveal that shear velocities in the model were too fast. This information was used to revise the model for subsequent ground motion modeling.

58 GEOSCIENCES↗

Multiphase complete exchange on Paragon, SP2 and CS-2

The overhead of interprocessor communication is a major factor in limiting the performance of parallel computer systems. The complete exchange is the severest communication pattern in that it requires each processor to send a distinct message to every other processor. This pattern is at the heart of many important parallel applications. On hypercubes, multiphase complete exchange has been developed and shown to provide optimal performance over varying message sizes. Most commercial multicomputer systems do not have a hypercube interconnect. However, they use special purpose hardware and dedicated communication processors to achieve very high performance communication and can be made to emulate the hypercube quite well. Multiphase complete exchange has been implemented on three contemporary parallel architectures: the Intel Paragon, IBM SP2 and Meiko CS-2. The essential features of these machines are described and their basic interprocessor communication overheads are discussed. The performance of multiphase complete exchange is evaluated on each machine. It is shown that the theoretical ideas developed for hypercubes are also applicable in practice to these machines and that multiphase complete exchange can lead to major savings in execution time over traditional solutions.

Bokhari, Shahid H.↗