Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallelism”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism

Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. Here, the authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install.

AMG↗
DOE OSTI2021

HyLiPoD: Parallel Particle Advection via a Hybrid of Lifeline Scheduling and Parallelization-Over-Data

Performance characteristics of parallel particle advection algorithms can vary greatly based on workload.With this short paper, we build a new algorithm based on results from a previous bake-off study which evaluated the performance of four algorithms on a variety of workloads. Our algorithm, called HyLiPoD, is a ''meta-algorithm,'' i.e., it considers the desired workload to choose from existing algorithms to maximize performance. To demonstrate HyliPoD's benefit, we analyze results from 162 tests including concurrencies of up to 8192 cores, meshes as large as 34 billion cells, and particle counts as large as 300 million. Our findings demonstrate that HyLiPoD's adaptive approach allows it to match the best performance of existing algorithms across diverse workloads.

high performance computing↗
DOE OSTI2016

A fully coupled method for massively parallel simulation of hydraulically driven fractures in 3-dimensions: FULLY COUPLED PARALLEL SIMULATION OF HYDRAULIC FRACTURES IN 3-D

This study describes a fully coupled finite element/finite volume approach for simulating field-scale hydraulically driven fractures in three dimensions, using massively parallel computing platforms. The proposed method is capable of capturing realistic representations of local heterogeneities, layering and natural fracture networks in a reservoir. A detailed description of the numerical implementation is provided, along with numerical studies comparing the model with both analytical solutions and experimental results. The results demonstrate the effectiveness of the proposed method for modeling large-scale problems involving hydraulically driven fractures in three dimensions.

03 NATURAL GAS↗
DOE OSTI2019

Simulation of thermal hydraulic performance of multiple parallel micropin arrays for concentrating solar thermal applications with supercritical carbon dioxide

Concentrated solar power (CSP) plants have the potential to provide 24 h, renewable electricity. Current CSP systems have high capital and operational costs which makes the levelized cost of electricity uncompetitive with conventional techniques. Recent experimental research has shown the potential of small unit cells (up to 2 × 2 cm) containing micropin arrays (D H < 1 mm) to operate efficiently at high incident flux (>140 W cm -2 ) using supercritical carbon dioxide as the working fluid. Applying this technology to CSP systems would result in a smaller central receiver, which would reduce thermal losses, increase receiver efficiency and reduce the capital cost of the receiver component. This study investigates and addresses the practical thermal and hydraulic issues in numbering up these small unit cells into numerous parallel cells within an integrated module design. A thermal hydraulic network model is developed to quantify the distribution and the overall receiver efficiency of an integrated module. This model is used to specify maximum allowable unit cell size and header dimensions to maintain acceptable thermal performance and pressure loss. Once a module design was finalized, parametric studies were performed to study the effects of varying incident flux on flow distribution and thermal performance of the module. Finally, the results show that an integrated module design can be achieved with less than 5% flow maldistribution and a pressure drop acceptable to the remainder of the system.

14 SOLAR ENERGY↗
DOE OSTI2020

Medium amplitude parallel superposition (MAPS) rheology. Part 2: Experimental protocols and data analysis

An experimental protocol is developed to directly measure the new material functions revealed by medium amplitude parallel superposition (MAPS) rheology. This protocol measures the medium amplitude response of a material to a simple shear deformation composed of three sine waves at different frequencies, revealing a rich dataset consisting of up to 19 measurements of the third-order complex modulus at distinct three-frequency coordinates. We discuss how the choice of input frequencies influences the features of the MAPS domain studied by the experiment. A polynomial interpolation method for reducing the bias of measured values from spectral leakage and reducing variance due to noise is discussed, including a derivation of the optimal range of amplitudes for the input signal. This leads to the conclusion that conducting the experiment in a stress-controlled fashion possesses a distinct advantage to the strain-controlled mode. The experimental protocol is demonstrated through measurements of the MAPS response of a model complex fluid: a surfactant solution of wormlike micelles. The resulting dataset is indeed large and feature-rich, while still acquired in a time comparable to similar medium amplitude oscillatory shear (MAOS) experiments. We demonstrate that the data represent measurements of an intrinsic material function by studying its internal consistency, compatibility with low-frequency predictions for Coleman–Noll simple fluids, and agreement with data obtained via MAOS amplitude sweeps. Finally, the data are compared to predictions from the corotational Maxwell model to demonstrate the power of MAPS rheology in determining whether a constitutive model is consistent with a material’s time-dependent response.

Lennon, Kyle R. (ORCID:0000000212515461)↗
NASA NTRS1985

Oblique, parallel, and quasi-parallel morphology of collisionless shocks

The question as to whether nonperpendicular, oblique shocks are disguised in the bow shock system by its infinite radius-of-curvature is addressed in light of the most recent data, which indicate that the quasi-perpendicular/quasi-parallel division is not merely real, but intrinsic. An attempt is presently made to summarize observational results on nonperpendicular shocks with the express intention of understanding the shock as an interactive structure that is dependent on the geometry of shock propagation. A foundation for the reconciliation of some rather complex or apparently contradictory quasi-parallel features is suggested.

Greenstadt, Eugene W.↗
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 NTRS1997

Communication Improvement for the LU NAS Parallel Benchmark: A Model for Efficient Parallel Relaxation Schemes

The first release of the MPI version of the LU NAS Parallel Benchmark (NPB2.0) performed poorly compared to its companion NPB2.0 codes. The later LU release (NPB2.1 & 2.2) runs up to two and a half times faster, thanks to a revised point access scheme and related communications scheme. The new scheme sends substantially fewer messages. is cache "friendly", and has a better load balance. We detail the, observations and modifications that resulted in this efficiency improvement, and show that the poor behavior of the original code resulted from deriving a message passing scheme from an algorithm originally devised for a vector architecture.

Yarrow, Maurice↗
NASA NTRS1995

A Parallel Incompressible Navier-Stokes Solver With a Parallel Multigrid Elliptic Kernal

The paper describes numerical algorithms and parallel implementations of a time-dependent, incompressible Navier-Stokes flow solver and a multigrid elliptic solver, which is also used as a computation kernal in the flow solver. The implemented solvers are numerically stable and computationally efficient, and they scale well to a large number of processors for problems with moderate granularity.

solver Navier-Stokes solver multigrid elliptic sol↗
NASA NTRS2001

Highly parallel structured adaptive mesh refinement using parallel language-based approaches

Adaptive mesh refinement (AMR) calculations carried out on structured meshes play an exceedingly important role in several areas of science and engineering. A strategy for using Fortran 90 in an object-oriented fashion is presented. This permits AMR applications to be expressed in terms of familiar abstractions that are natural to the process of solving AMR hierarchies. The OpenMP features that are useful for parallel processing of AMR hierarchies in a load balanced fashion on multiprocessors is described.

computational↗
DOE OSTI2016

Global‐view coefficients: a data management solution for parallel quantum Monte Carlo applications

Summary Quantum Monte Carlo (QMC) applications perform simulation with respect to an initial state of the quantum mechanical system, which is often captured by using a cubic B‐spline basis. This representation is stored as a read‐only table of coefficients and accesses to the table are generated at random as part of the Monte Carlo simulation. Current QMC applications, such as QWalk and QMCPACK, replicate this table at every process or node, which limits scalability because increasing the number of processors does not enable larger systems to be run. We present a partitioned global address space approach to transparently managing this data using Global Arrays in a manner that allows the memory of multiple nodes to be aggregated. We develop an automated data management system that significantly reduces communication overheads, enabling new capabilities for QMC codes. Experimental results with QWalk and QMCPACK demonstrate the effectiveness of the data management system. Copyright © 2016 John Wiley & Sons, Ltd.

Niu, Qingpeng↗