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

Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models

Single neuron models are fundamental for computational modeling of the brain's neuronal networks, and understanding how ion channel dynamics mediate neural function. A challenge in defining such models is determining biophysically realistic channel distributions. Here, we present an efficient, highly parallel evolutionary algorithm for developing such models, named NeuroGPU-EA. NeuroGPU-EA uses CPUs and GPUs concurrently to simulate and evaluate neuron membrane potentials with respect to multiple stimuli. We demonstrate a logarithmic cost for scaling the stimuli used in the fitting procedure. NeuroGPU-EA outperforms the typically used CPU based evolutionary algorithm by a factor of 10 on a series of scaling benchmarks. We report observed performance bottlenecks and propose mitigation strategies. Finally, we also discuss the potential of this method for efficient simulation and evaluation of electrophysiological waveforms.

59 BASIC BIOLOGICAL SCIENCES↗

Performance Characterization of a Hierarchical MPI Implementations on Large-scale Distributed-memory Platforms

The building blocks of emerging Petascale massively parallel processing (MPP) systems are multi-core processors with four or more cores as a single processing element and a customized network interface. The resulting memory and communication hierarchy of these platforms are now exposed to application developers and end users by creating a hierarchical or multi-core aware message-passing (MPI) programming interface and by providing a handful of runtime, tunable parameters that allows mapping and control of MPI tasks and message handling. We characterize performance of MPI communication patterns and present strategies for optimizing applications performance on Cray XT series systems that are composed of contemporary AMD processors and a proprietary network infrastructure. We highlight dependencies in its memory and network subsystems, which could influence production-level applications performance. We demonstrate that MPI micro-benchmarks could mislead an application developer or end user since these benchmarks often do not expose the interplay between memory allocation and usage in the user space, which depends on the number of tasks or cores and workload characteristics. Our studies show performance improvements compared to the default options for our target scientific benchmarks and production-level applications.

99 GENERAL AND MISCELLANEOUS↗

The New MCNP6 Depletion Capability

The first MCNP based inline Monte Carlo depletion capability was officially released from the Radiation Safety Information and Computational Center as MCNPX 2.6.0. Both the MCNP5 and MCNPX codes have historically provided a successful combinatorial geometry based, continuous energy, Monte Carlo radiation transport solution for advanced reactor modeling and simulation. However, due to separate development pathways, useful simulation capabilities were dispersed between both codes and not unified in a single technology. MCNP6, the next evolution in the MCNP suite of codes, now combines the capability of both simulation tools, as well as providing new advanced technology, in a single radiation transport code. We describe here the new capabilities of the MCNP6 depletion code dating from the official RSICC release MCNPX 2.6.0, reported previously, to the now current state of MCNP6. NEA/OECD benchmark results are also reported. The MCNP6 depletion capability enhancements beyond MCNPX 2.6.0 reported here include: (1) new performance enhancing parallel architecture that implements both shared and distributed memory constructs; (2) enhanced memory management that maximizes calculation fidelity; and (3) improved burnup physics for better nuclide prediction. MCNP6 depletion enables complete, relatively easy-to-use depletion calculations in a single Monte Carlo code. The enhancements described here help provide a powerful capability as well as dictate a path forward for future development to improve the usefulness of the technology.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Parallel Climate Analysis Toolkit (ParCAT)

The parallel analysis toolkit (ParCAT) provides parallel statistical processing of large climate model simulation datasets. ParCAT provides parallel point-wise average calculations, frequency distributions, sum/differences of two datasets, and difference-of-average and average-of-difference for two datasets for arbitrary subsets of simulation time. ParCAT is a command-line utility that can be easily integrated in scripts or embedded in other application. ParCAT supports CMIP5 post-processed datasets as well as non-CMIP5 post-processed datasets. ParCAT reads and writes standard netCDF files.

Smith, Brian Edward↗

GeoPhysical Analysis Code

GPAC is a code that integrates open source libraries for element formulations, linear algebra, and I/O with two main LLNL-Written components: (i) a set of standard finite elements physics solvers for rersolving Darcy fluid flow, explicit mechanics, implicit mechanics, and fluid-mediated fracturing, including resolution of contact both implicity and explicity, and (ii) a MPI-based parallelization implementation for use on generic HPC distributed memory architectures. The resultant code can be used alone for linearly elastic problems and problems involving hydraulic fracturing, where the mesh topology is dynamically changed. The key application domain is for low-rate stimulation and fracture control in subsurface reservoirs (e.g., enhanced geothermal sites and unconventional shale gas stimulation). GPAC also has interfaces to call external libraries for, e.g., material models and equations of state; however, LLNL-developed EOS and material models will not be part of the current release.

Source record↗

GeoPhysical Analysis Code

GPAC is a code that integrates open source libraries for element formulations, linear algebra, and I/O with two main LLNL-written components: (i) a set of standard finite, discrete, and discontinuous displacement element physics solvers for resolving Darcy fluid flow, explicit mechanics, implicit mechanics, fault rupture and earthquake nucleation, and fluid-mediated fracturing, including resolution of physcial behaviors both implicity and explicity, and (ii) a MPI-based parallelization implementation for use on generic HPC distributed memory architectures. The resultant code can be used alone for linearly elastic problems; ploblems involving hydraulic fracturing, where the mesh topology is dynamically changed; fault rupture modeling and seismic risk assessment; and general granular materials behavior. The key application domain is for low-rate stimulation and fracture control in subsurface reservoirs (e.g., enhanced geothermal sites and unconventional shale gas stimulation). GPAC also has interfaces to call external libraries for , e.g., material models and equations of state; however, LLNL-developed EOS and material models will not be part of the current release. CPAC's secondary applications include modeling fault evolution for predicting the statistical distribution of earthquake events and to capture granular materials behavior under different load paths.

Source record↗

ecode - Electron Transport Algorithm Testing v. 1.0

ecode is a Monte Carlo code used for testing algorithms related to electron transport. The code can read basic physics parameters, such as energy-dependent stopping powers and screening parameters. The code permits simple planar geometries of slabs or cubes. Parallelization consists of domain replication, with work distributed at the start of the calculation and statistical results gathered at the end of the calculation. Some basic routines (such as input parsing, random number generation, and statistics processing) are shared with the Integrated Tiger Series codes. A variety of algorithms for uncertainty propagation are incorporated based on the stochastic collocation and stochastic Galerkin methods. These permit uncertainty only in the total and angular scattering cross sections. The code contains algorithms for simulating stochastic mixtures of two materials. The physics is approximate, ranging from mono-energetic and isotropic scattering to screened Rutherford angular scattering and Rutherford energy-loss scattering (simple electron transport models). No production of secondary particles is implemented, and no photon physics is implemented.

Franke, Brian C.↗

The new MCNP6 depletion capability

The first MCNP based in-line Monte Carlo depletion capability was officially released from the Radiation Safety Information and Computational Center as MCNPX 2.6.0. Both the MCNP5 and MCNPX codes have historically provided a successful combinatorial geometry based, continuous energy, Monte Carlo radiation transport solution for advanced reactor modeling and simulation. However, due to separate development pathways, useful simulation capabilities were dispersed between both codes and not unified in a single technology. MCNP6, the next evolution in the MCNP suite of codes, now combines the capability of both simulation tools, as well as providing new advanced technology, in a single radiation transport code. We describe here the new capabilities of the MCNP6 depletion code dating from the official RSICC release MCNPX 2.6.0, reported previously, to the now current state of MCNP6. NEA/OECD benchmark results are also reported. The MCNP6 depletion capability enhancements beyond MCNPX 2.6.0 reported here include: (1) new performance enhancing parallel architecture that implements both shared and distributed memory constructs; (2) enhanced memory management that maximizes calculation fidelity; and (3) improved burnup physics for better nuclide prediction. MCNP6 depletion enables complete, relatively easy-to-use depletion calculations in a single Monte Carlo code. The enhancements described here help provide a powerful capability as well as dictate a path forward for future development to improve the usefulness of the technology. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Mapping mesoscale heterogeneity in the plastic deformation of a copper single crystal

The work reported here is part of a 'multiscale characterization' study of heterogeneous deformation patterns in metals. A copper single crystal was oriented for single slip in the (111)[{bar 1}01] slip system and tested to {approx}10% strain in roughly uniaxial compression. The macroscopic strain field was monitored during the test by optical 'image correlation'. The strain field was measured on orthogonal surfaces, one of which (the x-face) was oriented perpendicular to [1{bar 2}1] and contained the [{bar 1}01] direction of the preferred slip system. The macroscopic strain developed in an inhomogeneous pattern of broad, crossed shear bands in the x-face. One, the primary band, lay parallel to (111). The second, the 'conjugate' band, was oriented perpendicular to (111) with an overall ({bar 1}01) habit that contains no common slip plane of the fcc crystal. The mesoscopic deformation pattern was explored with selected area diffraction, using a focused synchrotron radiation polychromatic beam with a resolution of 1-3 {micro}m. Areas within the primary, conjugate and mixed (primary + conjugate) strain regions of the x-face were identified and mapped for their orientation, excess defect density and shear stress. The mesoscopic defect structure was concentrated in broad, somewhat irregular primary bands that lay nominally parallel to (111) in an almost periodic distribution with a period of about 30 {micro}m. These primary bands were dominant even in the region of conjugate strain. There were also broad conjugate defect bands, almost precisely perpendicular to the primary bands, that tended to bridge primary bands and terminate at them. The residual shear stresses were large (ranging to well above 500 MPa) and strongly correlated with the primary shear bands; interband stresses were small. The maximum resolved shear stresses within the primary bands were oriented out of the plane of the bands, and, hence, could not recover the dislocation structure in the bands. The maximum resolved shear stresses in the interband regions lay predominantly in {l_brace}111{r_brace} planes. The results are compared to the mesoscopic defect patterns found in Cu in etch pit studies done some decades ago, which also revealed a mesoscopic dislocation structure made up of orthogonal bands.

36 MATERIALS SCIENCE↗

Simultaneous Retrieval of Effective Refractive Index and Density from Size Distribution and Light Scattering Data: Weakly-Absorbing Aerosol

We propose here a novel approach for retrieving in parallel the effective density and real refractive index of weakly absorbing aerosol from optical and size distribution measurements. Here we define “weakly absorbing” as aerosol single-scattering albedos that exceed 0.95 at 0.5 um.The required optical measurements are the scattering coefficient and the hemispheric backscatter fraction, obtained in this work from an integrating nephelometer. The required size spectra come from a Scanning Mobility Particle Sizer and an Aerodynamic Particle Sizer. The performance of this approach is first evaluated using a sensitivity study with synthetically generated but measurement-related inputs. The sensitivity study reveals that the proposed approach is robust to random noise; additionally the uncertainties of the retrieval are almost linearly proportional to the measurement errors, and these uncertainties are smaller for the real refractive index than for the effective density. Next, actual measurements are used to evaluate our approach. These measurements include the optical, microphysical, and chemical properties of weakly absorbing aerosol which are representative of a variety of coastal summertime conditions observed during the Two-Column Aerosol Project (TCAP; http://campaign.arm.gov/tcap/). The evaluation includes calculating the root mean square error (RMSE) between the aerosol characteristics retrieved by our approach, and the same quantities calculated using the conventional volume mixing rule for chemical constituents. For dry conditions (defined in this work as relative humidity less than 55%) and sub-micron particles, a very good (RMSE~3%) and reasonable (RMSE~28%) agreement is obtained for the retrieved real refractive index (1.49±0.02) and effective density (1.68±0.21), respectively. Our approach permits discrimination between the retrieved aerosol characteristics of sub-micron and sub-10micron particles. The evaluation results also reveal that the retrieved density and refractive index tend to decrease with an increase of the relative humidity.

density↗

Design & Implementation of MACSio

We are proposing to develop “MACSio” (pronounced “max-ee-oh”), a Multi-purpose, Application-Centric, Scalable I/O proxy application. It is being proposed to fill a long existing void in co-design proxy applications that allow for I/O performance testing and evaluation of tradeoffs in data model interfaces and parallel I/O paradigms for multi-physics, HPC applications. Two key design features of MACSio will set it apart from existing I/O benchmarking tools. The first is the level of abstraction (LOA) at which MACSio is being designed to operate. The second is the degree of flexibility MACSio is being designed to provide in driving an HPC I/O workload through parameterized, user-defined data objects and a variety of parallel I/O paradigms and I/O interfaces. Combined, these features will allow MACSio to closely mimic I/O workloads for a wide variety of real applications and, in particular, multi-physics applications where data object distribution and composition vary dramatically both within and across parallel tasks. These data objects can then be marshaled using one or more I/O interfaces and parallel I/O paradigms, allowing for direct comparisons of software interfaces, parallel I/O paradigms, and filesystem technologies with the same set of customizable data objects.

97 MATHEMATICS AND COMPUTING↗

The mechanisms of electron heating and acceleration during magnetic reconnection

The heating of electrons in collisionless magnetic reconnection is explored in particle-in-cell simulations with non-zero guide fields so that electrons remain magnetized. In this regime, electric fields parallel to B accelerate particles directly, while those perpendicular to B do so through gradient-B and curvature drifts. The curvature drift drives parallel heating through Fermi reflection, while the gradient B drift changes the perpendicular energy through betatron acceleration. We present simulations in which we evaluate each of these mechanisms in space and time in order to quantify their role in electron heating. For a case with a small guide field (20% of the magnitude of the reconnecting component), the curvature drift is the dominant source of electron heating. However, for a larger guide field (equal to the magnitude of the reconnecting component) electron acceleration by the curvature drift is comparable to that of the parallel electric field. In both cases, the heating by the gradient B drift is negligible in magnitude. It produces net cooling because the conservation of the magnetic moment and the drop of B during reconnection produce a decrease in the perpendicular electron energy. Heating by the curvature drift dominates in the outflow exhausts where bent field lines expand to relax their tension and is therefore distributed over a large area. In contrast, the parallel electric field is localized near X-lines. This suggests that acceleration by parallel electric fields may play a smaller role in large systems where the X-line occupies a vanishing fraction of the system. The curvature drift and the parallel electric field dominate the dynamics and drive parallel heating. A consequence is that the electron energy spectrum becomes extremely anisotropic at late time, which has important implications for quantifying the limits of electron acceleration due to synchrotron emission. An upper limit on electron energy gain that is substantially higher than earlier estimates is obtained by balancing reconnection drive with radiative loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Oblique instability of quasi-parallel whistler waves in the presence of cold and warm electron populations

Whistler waves propagating nearly parallel to the ambient magnetic field experience a nonlinear instability due to transverse currents when the background plasma has a population of sufficiently low energy electrons. Intriguingly, this nonlinear process may generate oblique electrostatic waves, including whistlers near the resonance cone with properties resembling oblique chorus waves in the Earth’s magnetosphere. Focusing on the generation of oblique whistlers, earlier analysis of the instability is extended here to the case where low-energy background plasma consists of both a “cold” population with energy of a few eV and a “warm” electron component with energy of the order of 100 eV. This is motivated by spacecraft observations in the Earth’s magnetosphere where oblique chorus waves were shown to interact resonantly with the warm electrons. The main new results are: 1) the instability producing oblique electrostatic waves is sensitive to the shape of the electron distribution at low energies. In the whistler range of frequencies, two distinct peaks in the growth rate are typically present for the model considered: a peak associated with the warm electron population at relatively low wavenumbers and a peak associated with the cold electron population at relatively high wavenumbers; 2) overall, the instability producing oblique whistler waves near the resonance cone persists (with a reduced growth rate) even in the cases where the temperature of the cold population is relatively high, including cases where cold population is absent and only the warm population is included; 3) particle-in-cell simulations show that the instability leads to heating of the background plasma and formation of characteristic plateau and beam features in the parallel electron distribution function in the range of energies resonant with the instability. The plateau/beam features have been previously detected in spacecraft observations of oblique chorus waves. However, they have been attributed to external sources and have been proposed to be the mechanism generating oblique chorus. In the present scenario, the causality link is reversed and the instability generating oblique whistler waves is shown to be a possible mechanism for formation of the plateau and beam features.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel Harness for Informatic Stream Hashing

PHISH is a lightweight framework which a set of independent processes can use to exchange data as they run on the same desktop machine, on processors of a parallel machine, or on different machines across a network. This enables them to work in a coordinated parallel fashion to perform computations on either streaming, archived, or self-generated data. The PHISH distribution includes a simple, portable library for performing data exchanges in useful patterns either via MPI message-passing or ZMQ sockets. PHISH input scripts are used to describe a data-processing algorithm, and additional tools provided in the PHISH distribution convert the script into a form that can be launched as a parallel job.

Plimpton, Steve↗

Parallel Harness for Informatic Stream Hashing

PHISH is a lightweight framework which a set of independent processes can use to exchange data as they run on the same desktop machine, on processors of a parallel machine, or on different machines across a network. This enables them to work in a coordinated parallel fashion to perform computations on either streaming, archived, or self-generated data. The PHISH distribution includes a simple, portable library for performing data exchanges in useful patterns either via MPI message-passing or ZMQ sockets. PHISH input scripts are used to describe a data-processing algorithm, and additional tools provided in the PHISH distribution convert the script into a form that can be launched as a parallel job.

Steve Plimpton, Tim Shead↗

p4est : Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees

We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected two-dimensional quadtrees or three-dimensional octrees, referred to as a forest of octrees. By distributing the union of octants from all octrees in parallel, we combine the high scalability proven previously for adaptive single-octree algorithms with the geometric flexibility that can be achieved by arbitrarily connected hexahedral macromeshes, in which each macroelement is the root of an adapted octree. A key concept of our approach is an encoding scheme of the interoctree connectivity that permits arbitrary relative orientations between octrees. Based on this encoding we develop interoctree transformations of octants. These form the basis for high-level parallel octree algorithms, which are designed to interact with an application code such as a numerical solver for partial differential equations. We have implemented and tested these algorithms in the p4est software library. We demonstrate the parallel scalability of p4est on its own and in combination with two geophysics codes. Using p4est we generate and adapt multioctree meshes with up to $5.13\times10^{11}$ octants on as many as 220,320 CPU cores and execute the 2:1 balance algorithm in less than 10 seconds per million octants per process.

Mathematics↗

A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

99 GENERAL AND MISCELLANEOUS↗