Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel processing”

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 667 records · Page 37

IMPACT OF THE SMALL COLUMN ION EXCHANGE PROCESS ON THE DEFENSE WASTE PROCESSING FACILITY - 12112

The Savannah River Site (SRS) is investigating the deployment of a parallel technology to the Salt Waste Processing Facility (SWPF, presently under construction) to accelerate high activity salt waste processing. The proposed technology combines large waste tank strikes of monosodium titanate (MST) to sorb strontium and actinides with two ion exchange columns packed with crystalline silicotitanate (CST) resin to sorb cesium. The new process was designated Small Column Ion Exchange (SCIX), since the ion exchange columns were sized to fit within a waste storage tank riser. Loaded resins are to be combined with high activity sludge waste and fed to the Defense Waste Processing Facility (DWPF) for incorporation into the current glass waste form. Decontaminated salt solution produced by SCIX will be fed to the SRS Saltstone Facility for on-site immobilization as a grout waste form. Determining the potential impact of SCIX resins on DWPF processing was the basis for this study. Accelerated salt waste treatment is projected to produce a significant savings in the overall life cycle cost of waste treatment at SRS.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

MiniGhost: A Miniapp for Exploring Boundary Exchange Strategies Using Stencil Computations in Scientific Parallel Computing

A broad range of scientific computation involves the use of difference stencils. In a parallel computing environment, this computation is typically implemented by decomposing the spacial domain, inducing a 'halo exchange' of process-owned boundary data. This approach adheres to the Bulk Synchronous Parallel (BSP) model. Because commonly available architectures provide strong inter-node bandwidth relative to latency costs, many codes 'bulk up' these messages by aggregating data into a message as a means of reducing the number of messages. A renewed focus on non-traditional architectures and architecture features provides new opportunities for exploring alternatives to this programming approach. In this report we describe miniGhost, a 'miniapp' designed for exploration of the capabilities of current as well as emerging and future architectures within the context of these sorts of applications. MiniGhost joins the suite of miniapps developed as part of the Mantevo project.

99 GENERAL AND MISCELLANEOUS↗

Generalizing the self-healing diffusion Monte Carlo approach to finite temperature: A path for the optimization of low-energy many-body bases

A statistical method is derived for the calculation of thermodynamic properties of many-body systems at low temperatures. This method is based on the self-healing diffusion Monte Carlo method for complex functions [F. A. Reboredo, J. Chem. Phys. 136, 204101 (2012)] and some ideas of the correlation function Monte Carlo approach [D. M. Ceperley and B. Bernu, J. Chem. Phys. 89, 6316 (1988)]. In order to allow the evolution in imaginary time to describe the density matrix, we remove the fixed-node restriction using complex antisymmetric guiding wave functions. In the process we obtain a parallel algorithm that optimizes a small subspace of the many-body Hilbert space to provide maximum overlap with the subspace spanned by the lowest-energy eigenstates of a many-body Hamiltonian. We show in a model system that the partition function is progressively maximized within this subspace. We show that the subspace spanned by the small basis systematically converges towards the subspace spanned by the lowest energy eigenstates. Possible applications of this method for calculating the thermodynamic properties of many-body systems near the ground state are discussed. The resulting basis can also be used to accelerate the calculation of the ground or excited states with quantum Monte Carlo.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., from 2D grid or mesh domains) and certain non-planar graphs (specifically for 3D grids and meshes). For planar graphs with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of O{log n} and latency by a factor of O{log n}. For non-planar cases, our algorithm can reduce the per-process communication volume by 3× and latency by O{n^1/3} times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in superLU. Our new 3D code achieves speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D superLU when run on 24,000 cores of a Cray XC30.

Sao, Piyush↗

Scalable time series change detection for biomass monitoring using gaussian process

Biomass monitoring, specifically detecting changes in the biomass or vegetation of a geographical region, is vital for studying the carbon cycle of the system and has significant implications in the context of understanding climate change and its impacts. Recently, several time series change detection methods have been proposed to identify land cover changes in temporal profiles (time series) of vegetation collected using remote sensing instruments. In this paper, we adapt Gaussian process regression to detect changes in such time series in an online fashion. While Gaussian process (GP) has been widely used as a kernel based learning method for regression and classification, their applicability to massive spatio-temporal data sets, such as remote sensing data, has been limited owing to the high computational costs involved. In this paper we address the scalability aspect of GP based time series change detection. Specifically, we exploit the special structure of the covariance matrix generated for GP analysis to come up with methods that can efficiently estimate the hyper-parameters associated with GP as well as identify changes in the time series while requiring a memory footprint which is linear in the size of input data, as compared to traditional method which involves solving a linear system of equations for the Choleksy decomposition of the quadratic sized covariance matrix. Experimental results show that our proposed method achieves significant speedups, as high as 1000, when processing long time series, while maintaining a small memory footprint. To further improve the computational complexity of the proposed method, we provide a parallel version which can concurrently process multiple input time series using the same set of hyper-parameters. The parallel version exploits the natural parallelization potential of the serial algorithm and is shown to perform significantly better than the serial version, with speedups as high as 10. Finally, we demonstrate the effectiveness of the proposed change detection method in identifying changes in Normalized Difference Vegetation Index (NDVI) data. Moreover, we show that the scalable solution is able to process NDVI data for the entire Iowa region significantly faster than the standard method.

Chandola, Varun↗

Improving computational efficiency of Monte Carlo simulations with variance reduction

CCFE perform Monte-Carlo transport simulations on large and complex tokamak models such as ITER. Such simulations are challenging since streaming and deep penetration effects are equally important. In order to make such simulations tractable, both variance reduction (VR) techniques and parallel computing are used. It has been found that the application of VR techniques in such models significantly reduces the efficiency of parallel computation due to 'long histories'. VR in MCNP can be accomplished using energy-dependent weight windows. The weight window represents an 'average behaviour' of particles, and large deviations in the arriving weight of a particle give rise to extreme amounts of splitting being performed and a long history. When running on parallel clusters, a long history can have a detrimental effect on the parallel efficiency - if one process is computing the long history, the other CPUs complete their batch of histories and wait idle. Furthermore some long histories have been found to be effectively intractable. To combat this effect, CCFE has developed an adaptation of MCNP which dynamically adjusts the WW where a large weight deviation is encountered. The method effectively 'de-optimises' the WW, reducing the VR performance but this is offset by a significant increase in parallel efficiency. Testing with a simple geometry has shown the method does not bias the result. This 'long history method' has enabled CCFE to significantly improve the performance of MCNP calculations for ITER on parallel clusters, and will be beneficial for any geometry combining streaming and deep penetration effects. (authors)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs

Recent development in Graphics Processing Units (GPUs) has enabled a new possibility for highly efficient parallel computing in science and engineering. Their massively parallel architecture makes GPUs very effective for algorithms where processing of large blocks of data can be executed in parallel. Multidimensional integration has important applications in areas like computational physics, plasma physics, computational fluid dynamics, quantum chemistry, molecular dynamics and signal processing. The computationally intensive nature of multidimensional integration requires a high-performance implementation. In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs. Various optimization techniques are applied to maximize the utilization of the GPU. GPU-based implementation outperforms the best known sequential methods and achieves a speed-up of up to 100. It also shows good scalability with the increase in dimensionality.

Arumugam, Kamesh↗

Implementation of Parallel Dynamic Simulation on Shared-Memory vs. Distributed-Memory Environments

Power system dynamic simulation computes the system response to a sequence of large disturbance, such as sudden changes in generation or load, or a network short circuit followed by protective branch switching operation. It consists of a large set of differential and algebraic equations, which is computational intensive and challenging to solve using single-processor based dynamic simulation solution. High-performance computing (HPC) based parallel computing is a very promising technology to speed up the computation and facilitate the simulation process. This paper presents two different parallel implementations of power grid dynamic simulation using Open Multi-processing (OpenMP) on shared-memory platform, and Message Passing Interface (MPI) on distributed-memory clusters, respectively. The difference of the parallel simulation algorithms and architectures of the two HPC technologies are illustrated, and their performances for running parallel dynamic simulation are compared and demonstrated.

dynamic simulation↗

Integration experiments and performance studies of a COTS parallel archive system

Current and future Archive Storage Systems have been asked to (a) scale to very high bandwidths, (b) scale in metadata performance, (c) support policy-based hierarchical storage management capability, (d) scale in supporting changing needs of very large data sets, (e) support standard interface, and (f) utilize commercial-off-the-shelf (COTS) hardware. Parallel file systems have been asked to do the same thing but at one or more orders of magnitude faster in performance. Archive systems continue to move closer to file systems in their design due to the need for speed and bandwidth, especially metadata searching speeds such as more caching and less robust semantics. Currently the number of extreme highly scalable parallel archive solutions is very small especially those that will move a single large striped parallel disk file onto many tapes in parallel. We believe that a hybrid storage approach of using COTS components and innovative software technology can bring new capabilities into a production environment for the HPC community much faster than the approach of creating and maintaining a complete end-to-end unique parallel archive software solution. In this paper, we relay our experience of integrating a global parallel file system and a standard backup/archive product with a very small amount of additional code to provide a scalable, parallel archive. Our solution has a high degree of overlap with current parallel archive products including (a) doing parallel movement to/from tape for a single large parallel file, (b) hierarchical storage management, (c) ILM features, (d) high volume (non-single parallel file) archives for backup/archive/content management, and (e) leveraging all free file movement tools in Linux such as copy, move, Is, tar, etc. We have successfully applied our working COTS Parallel Archive System to the current world's first petafiop/s computing system, LANL's Roadrunner machine, and demonstrated its capability to address requirements of future archival storage systems.

99 GENERAL AND MISCELLANEOUS↗

Supercomputing Pipelines Search for Therapeutics Against COVID-19

The urgent search for drugs to combat SARS-CoV-2 has included the use of supercomputers. The use of general-purpose graphical processing units (GPUs), massive parallelism, and new software for high-performance computing (HPC) has allowed researchers to search the vast chemical space of potential drugs faster than ever before. We developed a new drug discovery pipeline using the Summit supercomputer at Oak Ridge National Laboratory to help pioneer this effort, with new platforms that incorporate GPU-accelerated simulation and allow for the virtual screening of billions of potential drug compounds in days compared to weeks or months for their ability to inhibit SARS-COV-2 proteins. Here, this effort will accelerate the process of developing drugs to combat the current COVID-19 pandemic and other diseases.

60 APPLIED LIFE SCIENCES↗

SYMPATHETIC MAGNETIC BREAKOUT CORONAL MASS EJECTIONS FROM PSEUDOSTREAMERS

We present high-resolution 2.5D MHD simulation results of magnetic breakout-initiated coronal mass ejections (CMEs) originating from a coronal pseudostreamer configuration. The coronal null point in the magnetic topology of pseudostreamers means that the initiation of consecutive sympathetic eruptions is a natural consequence of the system's evolution. A generic source region energization process-ideal footpoint shearing parallel to the pseudostreamer arcade polarity inversion lines-is all that is necessary to store sufficient magnetic energy to power consecutive CME eruptions given that the pseudostreamer topology enables the breakout initiation mechanism. The second CME occurs because the eruptive flare reconnection of the first CME simultaneously acts as the overlying pre-eruption breakout reconnection for the sympathetic eruption. We examine the details of the magnetic and kinetic energy evolution and the signatures of the overlying null point distortion, current sheet formation, and magnetic breakout reconnection giving rise to the runaway expansion that drives the flare reconnection below the erupting sheared field core. The numerical simulation's spatial resolution and output cadence are sufficient to resolve the formation of magnetic islands during the reconnection process in both the breakout and eruptive flare current sheets. We quantify the flux transfer between the pseudostreamer arcades and show that the eruptive flare reconnection processes flux {approx}10 times faster than the pre-eruption breakout reconnection. We show that the breakout reconnection jets cause bursty, intermittent upflows along the pseudostreamer stalk, as well as downflows in the adjacent pseudostreamer arcade, both of which may be observable as pre-eruption signatures. Finally, we examine the flux rope CME trajectories and show that the breakout current sheet provides a path of least resistance as an imbalance in the surrounding magnetic energy density and results in a non-radial CME deflection early in the eruption.

79 ASTRONOMY AND ASTROPHYSICS↗

Performing a local reduction operation on a parallel computer

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

97 MATHEMATICS AND COMPUTING↗

Performing a local reduction operation on a parallel computer

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

97 MATHEMATICS AND COMPUTING↗

Habitat-specific patterns and drivers of bacterial β-diversity in China’s drylands

The existence of biogeographic patterns among most free-living microbial taxa has been well established, yet little is known about the underlying mechanisms that shape these patterns. In this work, we examined soil bacterial β-diversity across different habitats in the drylands of northern China. We evaluated the relative importance of environmental factors versus geographic distance to a distance-decay relationship, which would be explained by the relative effect of basic ecological processes recognized as drivers of diversity patterns in macrobial theoretical models such as selection and dispersal. While the similarity of bacterial communities significantly declined with increasing geographic distance, the distance-decay slope and the relative importance of factors driving distance-decay patterns varied across different habitats. A strong distance-decay relationship was observed in the alpine grassland, where the community similarity was influenced only by the environmental factors. Yet, geographic distance was solely responsible for community similarity in the desert. Even the average compositional similarity among locations in the desert was distinctly lower compared with those in other habitats. We found no evidence that dispersal limitation strongly influenced the β-diversity of bacterial communities in the desert grassland and typical grassland. Together, our results provide robust evidence of habitat specificity for microbial diversity patterns and their underlying drivers. Our findings suggest that microorganisms also have multiple drivers of diversity patterns and some of which may be parallel to some fundamental processes for explaining biodiversity patterns in macroorganisms.

59 BASIC BIOLOGICAL SCIENCES↗

Characterization and Rationalization of Microstructural Evolution in GRCop-84 Processed by Laser-Powder Bed Fusion (L-PBF)

In this study, prismatic geometries of GRCop-84 [Cu-8Cr-4Nb (at. pct)] were built with laser-powder bed fusion (L-PBF) process. The samples were sectioned parallel or perpendicular to the build direction and characterized in the as-built and after post-processing with a hot-isostatically pressing (HIP) treatment. The microstructure and phase evolutions were evaluated with optical microscopy, scanning electron microscopy (SEM), electron backscattered diffraction (EBSD), and high-temperature X-ray diffraction (HTXRD) up to 1223 K. The samples in the as-built conditions exhibited predominantly columnar epitaxial and misoriented Cu-FCC grains. The microstructure evolutions are discussed based on locations within the overall build geometry, the dynamics of small melt pool shape and sectioning effects. The above grain structure did not change significantly during post-process HIP treatment. The stability of this FCC grain structure is attributed to the formation of primary stable Cr 2 Nb (Laves phase) during L-PBF, even before the emergence of FCC grains from liquid. The stability of Cr 2 Nb in both as-built and HIPed samples were evaluated using high-temperature X-ray diffraction measurements and compared with that of gas-atomized powder. The significance of these results is discussed with reference to aerospace applications.

36 MATERIALS SCIENCE↗

Technical Report: Scalable Parallel Algorithms for High Dimensional Numerical Integration

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the entire integration domain. The performance of the algorithm was tested. Obtained results prove the scalability and accuracy of the implemented algorithms. The implemented algorithm could be used in different applications where a huge data volume is generated and numerical integration is required. We suggest using the hyprid MPI and OpenMP programming model to improve the performance of the algorithms. If the mixed model is used, attention should be paid to the scalability and accuracy.

97 MATHEMATICS AND COMPUTING↗

CUDA Computation of the Feynman Distribution

In 2006, NVIDIA Corporation introduced the Computer Unified Device Architecture (CUDA) for C, C++, and Fortran programming languages. The CUDA parallel computing platform uses the Graphics Processing Unit (GPU) of NVIDIA graphics card, and it is designed for parallel computations. In these computations, the same algorithms are executed on the data in parallel. The GPU contains many Streaming Multiprocessors (SM) that can independently execute blocks of threads. A thread is a sequence of serial programmed instructions. The SM executes threads in groups of 32 and a group of 32 threads is called warp. The threads within a block can be synchronized and have access to a shared memory that is visible only to them. Conversely, blocks of threads cannot be synchronized and have access only to the global memory of the graphics card. This memory is called device memory and is independent of the host memory controlled by the Central Processing Unit (CPU). A single thread has access to a local memory (register) that is not visible to any other thread. The part of the program that is executed on the graphics card is called kernel. Each thread of the kernel has a unique identification index that is accessible by the in-built variable threadIdx; the latter is a 3-component vector. A threads block can contain up to 1024 threads. Blocks of threads have a unique identification index that is accessible by the in-built variable blockIdx; the latter is a 3-component vector. The in-built variable blockDim contains the number of threads per block; this variable is a 3-component vector. Threads and blocks represent different levels of parallelism; a kernel is executed as a grid of blocks of threads. Figure 1 illustrates a grid of thread blocks for a GPU with 2 SM. A SM can execute multiple blocks of threads in parallel; a block of threads is executed on a single SM. A GPU can execute multiple kernels concurrently. This work has used the Quadro M5000 graphics card with the following technical specifications: - 2048 cores with 861 MHz frequency, - 16 streaming multiprocessors, - 5.2 trillion transistors, - 8.2 Gb device memory, - 64 kb register memory (per thread), - 48 kb shared memory (per block) - 211.6 GB/s memory bandwidth, and - 3.5 GFLOPS floating point performance.

97 MATHEMATICS AND COMPUTING↗

Streaming data analytics via message passing with application to graph algorithms

The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of either message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.

97 MATHEMATICS AND COMPUTING↗