Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed parallelization”

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,477 records · Page 82

Vapor Deposition and Solar Wind Implantation on Lunar Soil-Grain Surfaces as Comparable Processes

Vapor deposited patinas (VDP) on lunar soil grains consist of a thin (less than 1 micron) layer of amorphous silicate (glass) embedded with nanoscale Fe(sup 0) globules as seen in many TEM images. VDPs are also present on larger space-weathered lunar rocks; these larger samples will not be discussed here although the process of vapor deposition is common to exposed grains of all sizes. Whether or not the majority of the Fe(sup 0) globules present in lunar soils reside in vapor deposited patina is a matter of some concern. Some Fe(sup 0) globules are clearly seen to reside within the glass of agglutinates and might represent remobilized Fe(sup 0) in agglutinitic melts. remobilized Fe(sup 0) in agglutinitic melts. We argue that because VDP coatings are present only on the surfaces of lunar soil grains, their distribution as a surface correlated component (SCC) of lunar soils should parallel those of Solar Wind Elements (SWE) implanted in the outermost rinds of lunar soil grains. SWE residing in the interior of soils grains make up the volume correlated component (VCC). Relative to Fe(sup 0) in VDP, the distribution of various SWE have been studied well. The reason is understandable because instrumentation for nanoscale imaging is not ubiquitous. In this study we use the distribution of SWE in lunar soils as a guide to understanding the fate of Fe(sup 0) in VDP.

Basu, A.↗

Enhancement of wave growth for warm plasmas with a high-energy tail distribution

The classical linear theory of electromagnetic wave growth in a warm plasma is considered for waves propagating parallel to a uniform ambient magnetic field. Wave-growth rates are calculated for ion-driven right-hand mode waves for Kappa and Maxwellian particle distribution functions and for various values of the spectral index, the temperature anisotropy, and the ratio of plasma pressure to magnetic pressure appropriate to the solar wind. When the anisotropy is low the wave growth is limited to frequencies below the proton gyrofrequency and the growth rate increases dramatically as the spectral index is reduced. The growth rate for any Kappa distribution greatly exceeds that for a Maxwellian with the same bulk properties. For large thermal anisotropy the growth rate from either distribution is greatly enhanced. The growth rates from a Kappa distribution are generally larger than for a Maxwellian distribution, and significant wave growth occurs over a broader range of frequencies.

Thorne, Richard M.↗

Multidimensional electron beam-plasma instabilities in the relativistic regime

The interest in relativistic beam-plasma instabilities has been greatly rejuvenated over the past two decades by novel concepts in laboratory and space plasmas. Recent advances in this long-standing field are here reviewed from both theoretical and numerical points of view. The primary focus is on the two-dimensional spectrum of unstable electromagnetic waves growing within relativistic, unmagnetized, and uniform electron beam-plasma systems. Although the goal is to provide a unified picture of all instability classes at play, emphasis is put on the potentially dominant waves propagating obliquely to the beam direction, which have received little attention over the years. First, the basic derivation of the general dielectric function of a kinetic relativistic plasma is recalled. Next, an overview of two-dimensional unstable spectra associated with various beam-plasma distribution functions is given. Both cold-fluid and kinetic linear theory results are reported, the latter being based on waterbag and Maxwell-Juettner model distributions. The main properties of the competing modes (developing parallel, transverse, and oblique to the beam) are given, and their respective region of dominance in the system parameter space is explained. Later sections address particle-in-cell numerical simulations and the nonlinear evolution of multidimensional beam-plasma systems. The elementary structures generated by the various instability classes are first discussed in the case of reduced-geometry systems. Validation of linear theory is then illustrated in detail for large-scale systems, as is the multistaged character of the nonlinear phase. Finally, a collection of closely related beam-plasma problems involving additional physical effects is presented, and worthwhile directions of future research are outlined.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ANISOTROPIC THREE-DIMENSIONAL FOCUSED TRANSPORT OF SOLAR ENERGETIC PARTICLES IN THE INNER HELIOSPHERE

We investigate the combined effects of solar energetic particle propagation, parallel and perpendicular to the large-scale magnetic field in the solar wind. Numerical methods employing stochastic differential equations are used incorporating pitch-angle diffusion, focusing, and pitch-angle-dependent diffusion perpendicular to the magnetic field. We compute spatial distributions of approx100 keV electrons and 4 MeV protons in the inner heliosphere, assuming impulsive injection near the Sun over a limited range of solar longitude and latitude. In addition, spatial distributions and intensity-time profiles for various combinations of the parallel and perpendicular mean free path, with different assumptions for the dependence of lambda{sub perpendicular} on the radial distance and pitch angle, are investigated. We find that realistic results can be obtained when we assume that the perpendicular mean free path scales in the inner heliosphere with the gyroradius of the particles. Step-like decreases of particle intensities as frequently observed in impulsive events at 1 AU can be reproduced for a ratio of lambda{sub perpendicular}/lambda{sub ||} a few times 10{sup -5}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Production of electron conics by stochastic acceleration parallel to the magnetic field

Electron conics are enhancements in the electron flux at the edges of the electron loss cone. Such enhancements are a common feature in the electron distribution in the auroral zone. In analogy with ion conics, it has been suggested that electron conics are produced by waves which accelerate electrons perpendicular to the magnetic field. However, using a test particle simulation of the electron distribution it is shown that electron conics can be produced purely by stochastic acceleration of the electrons parallel to a dipole magnetic field. A possible wave mode that can produce parallel acceleration is the Alfven-ion cyclotron mode that has recently been shown to modulate the high energy part of the inverted-V electron distribution.

Temerin, Michael A.↗

A Semi-Implicit Lattice Method for Simulating Flow

We propose a new semi-implicit lattice numerical method for modeling fluid flow that depends only on local primitive variable information (density, pressure, velocity) and not on relaxed upstream distribution function values. This method has the potential for reducing parallel communication and permitting larger time steps compared to the lattice Boltzmann method. The lid-driven cavity is modeled to demonstrate the accuracy of the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transport of radial heat flux and second sound in fusion plasmas

Simple flux-gradient relations that involve time delay and radial coupling are discussed. Such a formulation leads to a rather simple description of avalanches and may explain breaking of gyroBohm transport scaling. The generalization of the flux-gradient relation (i.e., constitutive relation), which involve both time delay and spatial coupling, is derived from drift-kinetic equation, leading to kinetic definitions of constitutive elements such as the flux of radial heat flux. This allows numerical simulations to compute these cubic quantities directly. The formulation introduced here can be viewed as an extension of turbulence spreading to include the effect of spreading of cross-phase as well as turbulence intensity, combined in such a way to give the flux. The link between turbulence spreading and entropy production is highlighted. An extension of this formulation to general quasi-linear theory for the distribution function in the phase space of radial position and parallel velocity is also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An MPI + $X$ implementation of contact global search using Kokkos

This paper describes an approach that seeks to parallelize the spatial search associated with computational contact mechanics. In contact mechanics, the purpose of the spatial search is to find “nearest neighbors,” which is the prelude to an imprinting search that resolves the interactions between the external surfaces of contacting bodies. In particular, we are interested in the contact global search portion of the spatial search associated with this operation on domain-decomposition-based meshes. Specifically, we describe an implementation that combines standard domain-decomposition-based MPI-parallel spatial search with thread-level parallelism (MPI-X) available on advanced computer architectures (those with GPU coprocessors). Our goal is to demonstrate the efficacy of the MPI-X paradigm in the overall contact search. Standard MPI-parallel implementations typically use a domain decomposition of the external surfaces of bodies within the domain in an attempt to efficiently distribute computational work. This decomposition may or may not be the same as the volume decomposition associated with the host physics. The parallel contact global search phase is then employed to find and distribute surface entities (nodes and faces) that are needed to compute contact constraints between entities owned by different MPI ranks without further inter-rank communication. Key steps of the contact global search include computing bounding boxes, building surface entity (node and face) search trees and finding and distributing entities required to complete on-rank (local) spatial searches. To enable source-code portability and performance across a variety of different computer architectures, we implemented the algorithm using the Kokkos hardware abstraction library. While we targeted development towards machines with a GPU accelerator per MPI rank, we also report performance results for OpenMP with a conventional multi-core compute node per rank. Results here demonstrate a 47 % decrease in the time spent within the global search algorithm, comparing the reference ACME algorithm with the GPU implementation, on an 18M face problem using four MPI ranks. As a result, while further work remains to maximize performance on the GPU, this result illustrates the potential of the proposed implementation.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of Three Distributed Computing Environments for Scientific Applications

We present performance results for three distributed computing environments using the three simulated CFD applications in the NAS Parallel Benchmark suite. These environments are the DCF cluster, the LACE cluster, and an Intel iPSC/860 machine. The DCF is a prototypic cluster of loosely coupled SGI R3000 machines connected by Ethernet. The LACE cluster is a tightly coupled cluster of 32 IBM RS6000/560 machines connected by Ethernet as well as by either FDDI or an IBM Allnode switch. Results of several parallel algorithms for the three simulated applications are presented and analyzed based on the interplay between the communication requirements of an algorithm and the characteristics of the communication network of a distributed system.

Fatoohi, Rod↗

Algorithms and programming tools for image processing on the MPP, part 2

A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

Reeves, Anthony P.↗

Determination of statistics for any rotation of axes of a bivariate normal elliptical distribution

Transformation of statistics from a dimensional set to another dimensional set involves linear functions of the original set of statistics. Similarly, linear functions will transform statistics within a dimensional set such that the new statistics are relevant to a new set of coordinate axes. A restricted case of the latter is the rotation of axes in a coordinate system involving any two correlated random variables. A special case is the transformation for horizontal wind distributions. Wind statistics are usually provided in terms of wind speed and direction (measured clockwise from north) or in east-west and north-south components. A direct application of this technique allows the determination of appropriate wind statistics parallel and normal to any preselected flight path of a space vehicle. Among the constraints for launching space vehicles are critical values selected from the distribution of the expected winds parallel to and normal to the flight path. These procedures are applied to space vehicle launches at Cape Kennedy, Florida.

Falls, L. W.↗

Ion Velocity Distributions Within LLBL and Their Possible Implication to Multiple Reconnections

We analyze two LLBL crossings made by Interball Tail satellite under southward or variable magnetosheath magnetic field: one crossing on the flank of the magnetosphere, and another one closer to the subsolar point. Three different types of ion velocity distributions within LLBL are observed: (a) D-shaped distributions, (b) ion velocity distributions consisting of two counter-streaming components of magnetosheath-ty and (c) distributions with three components one of which has nearly zero parallel velocity and two counter-streaming components. Only the (a) type fits to the single magnetic flux tube formed by reconnection between magnetospheric and magnetosheath magnetic fields. We argue that two counter-streaming magnetosheath-like ion components observed by Interball within LLBL cannot be explained by the reflection of the ions from the magnetic mirror deeper within magnetosphere. Types (b) and (c) ion velocity distributions would form within spiral magnetic flux tube consisting of a mixture of alternating segments originating from the magnetosheath and from magnetospheric plasma. The shapes of ion velocity distributions and their evolution with decreasing number density in LLBL indicate that a significant part of LLBL is located on magnetic field lines of long spiral flux tube islands at the magnetopause, as has been proposed and found to occur in magnetopause simulations. We consider these observations as evidence for multiple reconnection X-ray lines between magnetosheath and magnetospheric flux tubes.

Vaisberg, O. L.↗

Distributed merge trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges. Copyright © 2013 ACM 978-1-4503-1922-5/13/ 02...$15.00.

Morozov, D↗

Distributed Merge Trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

97 MATHEMATICS AND COMPUTING↗

In Situ X-Ray Observations of Dendritic Fragmentation During Directional Solidification of a Sn-Bi Alloy

Dendrite fragmentation is an important phenomenon in microstructural development during solidification. For instance, it plays a key role in initiating the columnar-to-equiaxed transition (CET). Here, we use x-ray radiography to study dendrite fragmentation rate in a Sn-39.5 wt.% Bi alloy during directional solidification. Experiments were performed in which solidification was parallel and anti-parallel to gravity, leading to significantly different fragmentation rates. We quantify the distribution of fragmentation rate as a function of distance from the solidification front, time in the mushy zone, and volume fraction of solid. While the observed fragmentation rate can be high, there is no evidence of a CET, illustrating that it requires more than just fragmentation to occur.

Gibbs, John W.↗

Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication

We investigate outer-product--parallel, inner-product--parallel, and row-by-row-product--parallel formulations of sparse matrix-matrix multiplication (SpGEMM) on distributed memory architectures. For each of these three formulations, we propose a hypergraph model and a bipartite graph model for distributing SpGEMM computations based on one-dimensional (1D) partitioning of input matrices. Here, we also propose a communication hypergraph model for each formulation for distributing communication operations. The computational graph and hypergraph models adopted in the first phase aim at minimizing the total message volume and balancing the computational loads of processors, whereas the communication hypergraph models adopted in the second phase aim at minimizing the total message count and balancing the message volume loads of processors. That is, the computational partitioning models reduce the bandwidth cost and the communication hypergraph models reduce the latency cost. Our extensive parallel experiments on up to 2048 processors for a wide range of realistic SpGEMM instances show that although the outer-product--parallel formulation scales better, the row-by-row-product--parallel formulation is more viable due to its significantly lower partitioning overhead and competitive scalability. For computational partitioning models, our experimental findings indicate that the proposed bipartite graph models are attractive alternatives to their hypergraph counterparts because of their lower partitioning overhead. Finally, we show that by reducing the latency cost besides the bandwidth cost through using the communication hypergraph models, the parallel SpGEMM time can be further improved up to 32%.

97 MATHEMATICS AND COMPUTING↗

An experimental comparison of triggered and random pulse train uncertainties

In this paper we present an experimental comparison of signal-triggered and randomly triggered based analysis algorithms of neutron multiplicity data. Traditional shift register type signal-triggered multiplicity analysis of singles, doubles and triples rates is compared with analysis using randomly triggered gates. Two methods of random gate generation are explored - non-overlapping gates (Feyrunan approach) and periodic overlapping gates (fast accidentals). Using californium sources with low, medium and high rate in combination with AmLi sources (as a surrogate for plutonium) we investigate relative standard deviation (RSD) of data in order to determine if there are parameter spaces in which one of the measurement methods should be preferred. Neutron correlation analysis is a commonly used NDA technique to assay plutonium mass. The data can be collected in two distinct ways: using signal-triggered or randomly triggered counting gates. Analysis algorithms were developed for both approaches to determine singles (S), doubles (D) and triples (7) rates from the measured sample. Currently the most commonly implemented technique to collect neutron coincidence data utilizes shift register based electronics. Shift register uses signal-triggered counting gates to generate foreground multiplicity distribution of correlated+accidental events and a random gate (opened after a predefined long delay following the signal trigger) to generate background multiplicity distribution of accidental events. Modern shift registers include fast accidental option to sample data with a fixed clock frequency. This way a set of overlapping gates is used to generate background multiplicity distributions in order to improve the measurement precision. In parallel to shift register approach the Feynman variance technique is frequently used, which utilizes set of consecutive non-overlapping gates. In general, different user communities (e.g. safeguards, nuclear material accountancy, emergency response) have used only one of the two analysis methods for the nuclear material assay. The aim of this study is to provide a systematic comparison of the precision of the measured S, D, T rates and {sup 240}Pu effective mass obtained using the above mentioned pulse train sampling techniques. In order to perform this task, a LANL developed list mode based data acquisition system is used, where the entire pulse train is recorded and subsequently analyzed. The list mode acquisition brings an essential advantage for this type of comparison, since the very same pulse train can be analyzed using signal-triggered as well as randomly triggered counting gates. The aim of this study is not only to compare the precision of signal-triggered versus random triggered sampling techniques, but also to investigate the influence of fast accidental sampling on the precision of signal-triggered results. In addition the different random sampling techniques used in safeguards are investigated. For this purpose we implement two types of random sampling - non-overlapping gates (Feynrnan approach) and periodic overlapping gates (fast accidentals). In the following sections the equations utilized in the pulse train analysis are described, experimental setup and measurement techniques are discussed and finally the results are summarized and discussed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Massively scalable workflows for quantum chemistry: BigChem and ChemCloud

Electronic structure theory, i.e., quantum chemistry, is the fundamental building block for many problems in computational chemistry. Here we present a new distributed computing framework (BigChem), which allows for an efficient solution of many quantum chemistry problems in parallel. BigChem is designed to be easily composable and leverages industry-standard middleware (e.g., Celery, RabbitMQ, and Redis) for distributed approaches to large scale problems. BigChem can harness any collection of worker nodes, including ones on cloud providers (such as AWS or Azure), local clusters, or supercomputer centers (and any mixture of these). BigChem builds upon MolSSI packages, such as QCEngine to standardize the operation of numerous computational chemistry programs, demonstrated here with Psi4, xtb, geomeTRIC, and TeraChem. BigChem delivers full utilization of compute resources at scale, offers a programable canvas for designing sophisticated quantum chemistry workflows, and is fault tolerant to node failures and network disruptions. We demonstrate linear scalability of BigChem running computational chemistry workloads on up to 125 GPUs. Finally, we present ChemCloud, a web API to BigChem and successor to TeraChem Cloud. ChemCloud delivers scalable and secure access to BigChem over the Internet.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗