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 811 records · Page 45

Methods and apparatus for capture and storage of semantic information with sub-files in a parallel computing system

Techniques are provided for storing files in a parallel computing system using sub-files with semantically meaningful boundaries. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a plurality of sub-files. The method comprises the steps of obtaining a user specification of semantic information related to the file; providing the semantic information as a data structure description to a data formatting library write function; and storing the semantic information related to the file with one or more of the sub-files in one or more storage nodes of the parallel computing system. The semantic information provides a description of data in the file. The sub-files can be replicated based on semantically meaningful boundaries.

97 MATHEMATICS AND COMPUTING↗

Ordinary mode instability associated with thermal ring distribution

The purely growing ordinary (O) mode instability driven by excessive parallel temperature anisotropy has recently received renewed attention owing to its potential applicability to the solar wind plasma. Previous studies of O mode instability have assumed either bi-Maxwellian or counter-streaming velocity distributions. For solar wind plasma trapped in magnetic mirror-like geometry such as magnetic clouds or in the vicinity of the Earth's collisionless bow shock environment, however, the velocity distribution function may possess a loss-cone feature. The O-mode instability in such a case may be excited for cyclotron harmonics as well as the purely growing branch. The present paper investigates the O-mode instability for plasmas characterized by the parallel Maxwellian distribution and perpendicular thermal ring velocity distribution in order to understand the general stability characteristics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Iterative Importance Sampling Algorithms for Parameter Estimation

In parameter estimation problems one computes a posterior distribution over uncertain parameters defined jointly by a prior distribution, a model, and noisy data. Markov chain Monte Carlo (MCMC) is often used for the numerical solution of such problems. An alternative to MCMC is importance sampling, which can exhibit near perfect scaling with the number of cores on high performance computing systems because samples are drawn independently. However, finding a suitable proposal distribution is a challenging task. Several sampling algorithms have been proposed over the past years that take an iterative approach to constructing a proposal distribution. We investigate the applicability of such algorithms by applying them to two realistic and challenging test problems, one in subsurface flow, and one in combustion modeling. More specifically, we implement importance sampling algorithms that iterate over the mean and covariance matrix of Gaussian or multivariate t-proposal distributions. Our implementation leverages massively parallel computers, and we present strategies to initialize the iterations using “coarse” MCMC runs or Gaussian mixture models.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of Multi-Vendor Grid-Forming Inverters for Grid-Connected Operation Through Hardware Experimentation: Preprint

Existing real-world projects of GFM inverters that operate in parallel to power grids typically are sized between dozens and a few hundreds Megawatt (MW) scale according to a recent NERC GFM inverter white paper. These large systems are often difficult to evaluate prior to deployments because of their large size. The performance of smaller GFM inverters (dozens to a few hundreds MW) that operate parallel with power grids (distribution systems) is even less understood. There is an opportunity to better understand these systems through hardware testing under controlled laboratory conditions. Therefore, this paper presents the functional performance evaluation tests of multiple (three) commercial GFM inverters when they operate in parallel with the grid through hardware experiments. The goal of these tests is to explore the GFM inverters' functionalities and dynamic response when in parallel with power grids to eventually develop universal specifications for GFM inverters. Both steady state (changing the inverter's frequency and voltage droop) and transient (adding step change in grid's frequency/voltage) tests are performed for each GFM inverter with the same testing circuit and testing protocol. The experimental results indicate the bench-marked performance that: 1) the GFM inverters can be dispatched through frequency and voltage droop intercepts to output the target power when paralleled to the grid; 2) the GFM inverters automatically respond to system frequency and voltage events to output the needed power, however, the GFM inverters all show stability issues when absorbing reactive power from the grid.

grid-forming inverters↗

Reconnection and electron temperature anisotropy in sub-proton scale plasma turbulence

Knowledge of turbulent behavior at sub-proton scales in magnetized plasmas is important for a full understanding of the energetics of astrophysical flows such as the solar wind. We study the formation of electron temperature anisotropy due to reconnection in the turbulent decay of sub-proton scale fluctuations using two-dimensional, particle-in-cell plasma simulations with a realistic electron-proton mass ratio and a guide field perpendicular to the simulation plane. A power spectrum fluctuation with approximately power-law form is created down to scales of the order of the electron gyroradius. We identify the signatures of collisionless reconnection at sites of X-point field geometry in the dynamic magnetic field topology, which gradually relaxes in complexity. The reconnection sites are generally associated with regions of strong parallel electron temperature anisotropy. The evolving topology of magnetic field lines connected to a reconnection site allows for the spatial mixing of electrons accelerated at multiple, spatially separated reconnection regions. This leads to the formation of multi-peaked velocity distribution functions with strong parallel temperature anisotropy. In a three-dimensional system that can support the appropriate wave vectors, the multi-peaked distribution functions would be expected to be unstable to kinetic instabilities, contributing to dissipation. The proposed mechanism of anisotropy formation is also relevant to space and astrophysical systems where the evolution of the plasma is constrained by linear temperature anisotropy instability thresholds. The presence of reconnection sites leads to electron energy gain, nonlocal velocity space mixing, and the formation of strong temperature anisotropy; this is evidence of an important role for reconnection in the dissipation of turbulent fluctuations.

79 ASTRONOMY AND ASTROPHYSICS↗

High order parallel numerical schemes for solving incompressible flows

The use of parallel computers for numerically solving flow fields has gained much importance in recent years. This paper introduces a new high order numerical scheme for computational fluid dynamics (CFD) specifically designed for parallel computational environments. A distributed MIMD system gives the flexibility of treating different elements of the governing equations with totally different numerical schemes in different regions of the flow field. The parallel decomposition of the governing operator to be solved is the primary parallel split. The primary parallel split was studied using a hypercube like architecture having clusters of shared memory processors at each node. The approach is demonstrated using examples of simple steady state incompressible flows. Future studies should investigate the secondary split because, depending on the numerical scheme that each of the processors applies and the nature of the flow in the specific subdomain, it may be possible for a processor to seek better, or higher order, schemes for its particular subcase.

Lin, Avi↗

The WorkPlace distributed processing environment

Real time control problems require robust, high performance solutions. Distributed computing can offer high performance through parallelism and robustness through redundancy. Unfortunately, implementing distributed systems with these characteristics places a significant burden on the applications programmers. Goddard Code 522 has developed WorkPlace to alleviate this burden. WorkPlace is a small, portable, embeddable network interface which automates message routing, failure detection, and re-configuration in response to failures in distributed systems. This paper describes the design and use of WorkPlace, and its application in the construction of a distributed blackboard system.

Ames, Troy↗

National Combustion Code: Parallel Implementation and Performance

The National Combustion Code (NCC) is being developed by an industry-government team for the design and analysis of combustion systems. CORSAIR-CCD is the current baseline reacting flow solver for NCC. This is a parallel, unstructured grid code which uses a distributed memory, message passing model for its parallel implementation. The focus of the present effort has been to improve the performance of the NCC flow solver to meet combustor designer requirements for model accuracy and analysis turnaround time. Improving the performance of this code contributes significantly to the overall reduction in time and cost of the combustor design cycle. This paper describes the parallel implementation of the NCC flow solver and summarizes its current parallel performance on an SGI Origin 2000. Earlier parallel performance results on an IBM SP-2 are also included. The performance improvements which have enabled a turnaround of less than 15 hours for a 1.3 million element fully reacting combustion simulation are described.

Quealy, A.↗

Diagnosis of Performance Faults in LargeScale MPI Applications via Probabilistic Progress-Dependence Inference

Debugging large-scale parallel applications is challenging. Most existing techniques provide little information about failure root causes. Further, most debuggers significantly slow down program execution, and run sluggishly with massively parallel applications. This paper presents a novel technique that scalably infers the tasks in a parallel program on which a failure occurred, as well as the code in which it originated. Our technique combines scalable runtime analysis with static analysis to determine the least-progressed task(s) and to identify the code lines at which the failure arose. We present a novel algorithm that infers probabilistically progress dependence among MPI tasks using a globally constructed Markov model that represents tasks' control-flow behavior. In comparison to previous work, our algorithm infers more precisely the least-progressed task. Further, we combine this technique with static backward slicing analysis, further isolating the code responsible for the current state. A blind study demonstrates that our technique isolates the root cause of a concurrency bug in a molecular dynamics simulation, which only manifests itself at 7,996 tasks or more. We extensively evaluate fault coverage of our technique via fault injections in 10 HPC benchmarks and show that our analysis takes less than a few seconds on thousands of parallel tasks.

97 MATHEMATICS AND COMPUTING↗

On the Structure of the AGN Torus through the Fraction of Optically Selected Type 1 AGNs

The ratio in number between unobscured (type 1) and obscured (type 2) active galactic nuclei (AGNs) is often used to explore the structure of the torus in the unified scheme for AGNs. Oh et al. (2015) investigated the type 1 AGN fraction on two-dimensional space in terms of black hole mass (M{sub BH}) and bolometric luminosity (L{sub bol}) and found that the fraction changes depending on both M{sub BH} and L{sub bol}, forming a ridge-shaped distribution. In this study, based on the up-to-date type 1 AGN catalog of Oh et al. (2015), we examine how the trend of the type 1 AGN fraction in the M{sub BH}–L{sub bol} plane is affected by the different methods used to derive M{sub BH} and L{sub bol}, and suggest an analytic model to explain the observations. We use galaxies from the Sloan Digital Sky Survey Data Release 7 in the redshift range 0.01⩽z⩽0.2. In estimating L{sub bol}, we employ two different methods using [O III] and/or [O I] emission lines, and find that the L{sub bol} values obtained from the two methods agree well. We consider the M{sub BH}--σ{sub ∗} relation, the M{sub BH}–L {sub bulge} relation, and the single-epoch Hα-based M{sub BH} estimate in calculating M{sub BH}. We find that the trends of the type 1 AGN fraction with respect to M{sub BH} and L{sub bol} are similar for the different methods of deriving L{sub bol} but different when using different methods to derive M{sub BH}. We present a model based on the clumpy-torus scheme that reproduces the ridge-shaped distribution of the fraction parallel to the iso-Eddington ratio lines.

79 ASTRONOMY AND ASTROPHYSICS↗

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗

Multiple scattering in reflection nebulae. I - A Monte Carlo approach. II - Uniform plane-parallel nebulae with foreground stars. III - Nebulae with embedded illuminating stars

A method for calculating the surface brightness distribution on a plane-parallel reflection nebula of uniform density illuminated by a star located either in front of, behind, or arbitrarily inside the scattering medium is proposed. The Monte Carlo technique is used to find solutions to the radiative transfer problem. The scattering properties of the nebular particles are parameterized by the albedo for single scattering and a three-parameter analytic phase function. Calculations are then presented for the surface brightness distribution across the face of such nebulae with (1) a foreground star and (2) immersed stars. The calculations include the full effects of multiple scattering, are independent of a particular assumed grain material or size distribution, and are applicable to any wavelength region for which observations can be obtained.

Witt, A. N.↗

The cleft ion fountain - A two-dimensional kinetic model

The transport of ionospheric ions from a source in the polar cleft ionosphere through the polar magnetosphere is investigated using a two-dimensional, kinetic, trajectory-based code. The transport model includes the effects of gravitation, longitudinal magnetic gradient force, convection electric fields, and parallel electric fields. Individual ion trajectories as well as distribution functions and resulting bulk parameters of density, parallel average energy, and parallel flux for a presumed cleft ionosphere source distribution are presented for various conditions to illustrate parametrically the dependences on source energies, convection electric field strengths, ion masses, and parallel electric field strengths. The essential features of the model are consistent with the concept of a cleft-based ion fountain supplying ionospheric ions to the polar magnetosphere, and the resulting plasma distributions and parameters are in general agreement with recent low-energy ion measurements from the DE 1 satellite.

Horwitz, J. L.↗

diBELLA: Distributed Long Read to Long Read Alignment

© 2019 ACM. We present a parallel algorithm and scalable implementation for genome analysis, specifically the problem of finding overlaps and alignments for data from "third generation" long read sequencers [29]. While long sequences of DNA offer enormous advantages for biological analysis and insight, current long read sequencing instruments have high error rates and therefore require different approaches to analysis than their short read counterparts. Our work focuses on an efficient distributed-memory parallelization of an accurate single-node algorithm for overlapping and aligning long reads. We achieve scalability of this irregular algorithm by addressing the competing issues of increasing parallelism, minimizing communication, constraining the memory footprint, and ensuring good load balance. The resulting application, diBELLA, is the first distributed memory overlapper and aligner specifically designed for long reads and parallel scalability. We describe and present analyses for high level design trade-offs and conduct an extensive empirical analysis that compares performance characteristics across state-of-the-art HPC systems as well as a commercial cloud architectures, highlighting the advantages of state-of-the-art network technologies.

Ellis, Marquita↗

On the existence of Weibel instability in a magnetized plasma. I. Parallel wave propagation

In a uniform static magnetic field (B{sub 0}) the nonresonant mechanism of Weibel instability is certainly affected, because the free energy stored in the temperature anisotropy (e.g., T{sub perpendicular}>T{sub parallel}), where perpendicular and parallel denote directions relative to the background magnetic field) can drive the parallel whistler instability due to the cyclotron resonance with plasma particles. However, it has already been shown that the nonresonant mechanism should exist and drive the whistler instability, at least, for anisotropic distribution functions with no parallel thermal velocity spread. Here the investigation is extended to a magnetized plasma with a bi-Maxwellian temperature anisotropy. New frequency limits are introduced and the necessary physical conditions are provided: The nonresonant whistler instabilities have in general small frequencies, smaller than the growth rate, {omega}{sub r}<{omega}{sub i}, and for a large temperature anisotropy, the nonresonant instabilities are limited to a {beta}{sub perpendicular}=8{pi}n{sub 0}T{sub perpendicular}/B{sub 0}{sup 2}>1 regime. These criteria restricts in general the magnetic field to strengths less than a threshold value proportional to the square root of the temperature anisotropy. In the presence of an ambient magnetic field, the growth rate of the nonresonant instability is reduced and the large wavelengths are stabilized.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Distributed Training for High Resolution Images: A Domain and Spatial Decomposition Approach

In this work we developed two Pytorch libraries using the PyTorch RPC interface for distributed deep learning approaches on high resolution images. The spatial decomposition library allows for distributedtraining on very large images, which otherwise won’t be possible on a single GPU. The domain parallelism library allows for distributed training across multiple domain unlabeled data, by leveraging the domain separation architecture. Both of those libraries were tested on the Summit supercomputer at a moderate scale, and we are releasing the code for both of them.

97 MATHEMATICS AND COMPUTING↗

Reducing Interprocessor Dependence in Recoverable Distributed Shared Memory

Checkpointing techniques in parallel systems use dependency tracking and/or message logging to ensure that a system rolls back to a consistent state. Traditional dependency tracking in distributed shared memory (DSM) systems is expensive because of high communication frequency. In this paper we show that, if designed correctly, a DSM system only needs to consider dependencies due to the transfer of blocks of data, resulting in reduced dependency tracking overhead and reduced potential for rollback propagation. We develop an ownership timestamp scheme to tolerate the loss of block state information and develop a passive server model of execution where interactions between processors are considered atomic. With our scheme, dependencies are significantly reduced compared to the traditional message-passing model.

Janssens, Bob↗

Scaling neural simulations in STACS

Abstract As modern neuroscience tools acquire more details about the brain, the need to move towards biological-scale neural simulations continues to grow. However, effective simulations at scale remain a challenge. Beyond just the tooling required to enable parallel execution, there is also the unique structure of the synaptic interconnectivity, which is globally sparse but has relatively high connection density and non-local interactions per neuron. There are also various practicalities to consider in high performance computing applications, such as the need for serializing neural networks to support potentially long-running simulations that require checkpoint-restart. Although acceleration on neuromorphic hardware is also a possibility, development in this space can be difficult as hardware support tends to vary between platforms and software support for larger scale models also tends to be limited. In this paper, we focus our attention on Simulation Tool for Asynchronous Cortical Streams (STACS), a spiking neural network simulator that leverages the Charm++ parallel programming framework, with the goal of supporting biological-scale simulations as well as interoperability between platforms. Central to these goals is the implementation of scalable data structures suitable for efficiently distributing a network across parallel partitions. Here, we discuss a straightforward extension of a parallel data format with a history of use in graph partitioners, which also serves as a portable intermediate representation for different neuromorphic backends. We perform scaling studies on the Summit supercomputer, examining the capabilities of STACS in terms of network build and storage, partitioning, and execution. We highlight how a suitably partitioned, spatially dependent synaptic structure introduces a communication workload well-suited to the multicast communication supported by Charm++. We evaluate the strong and weak scaling behavior for networks on the order of millions of neurons and billions of synapses, and show that STACS achieves competitive levels of parallel efficiency.

59 BASIC BIOLOGICAL SCIENCES↗