Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel application”

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 379 records · Page 21

RMACXX: An Efficient High-Level C++ Interface over MPI-3 RMA

Parallel scientific applications can benefit from de- coupling communication and synchronization. One-sided pro- gramming abstractions, which separate communication from syn- chronization, have in fact served as a motivation for partitioned global address space (PGAS) models. However, the use of PGAS models in application codes in a manner that fully exploits the benefit of these programming models requires significant development effort. Meanwhile, a vast majority of scientific codes already use the Message Passing Interface (MPI) and need convenient features to support application-specific one-sided communication scenarios. MPI Remote Memory Access (RMA) can be employed for this purpose. MPI is a low-level API, however, and developing applications with MPI RMA requires programmers to be well versed in its nuances. We present RMACXX, a compact set of C++ bindings to MPI-3 RMA, to ease the use of MPI RMA. Unlike other PGAS models, which may have interoperability issues with MPI, RMACXX is written on top of MPI and uses the same runtime as MPI. The basic functionality of RMACXX adds only a relatively small number of extra instructions (about 20) to the critical communication path. Moreover, RMACXX provides an intuitive API for building a wide variety of scientific applications while enjoying performance matching handwritten MPI-3 RMA codes.

MPI-3 RMA, one-sided communication, PGAS, C++, exp↗

Commnity Petascale Project for Accelerator Science and Simulation: Advancing Computational Science for Future Accelerators and Accelerator Technologies

The design and performance optimization of particle accelerators is essential for the success of the DOE scientific program in the next decade. Particle accelerators are very complex systems whose accurate description involves a large number of degrees of freedom and requires the inclusion of many physics processes. Building on the success of the SciDAC1 Accelerator Science and Technology project, the SciDAC2 Community Petascale Project for Accelerator Science and Simulation (ComPASS) is developing a comprehensive set of interoperable components for beam dynamics, electromagnetics, electron cooling, and laser/plasma acceleration modeling. ComPASS is providing accelerator scientists the tools required to enable the necessary accelerator simulation paradigm shift from high-fidelity single physics process modeling (covered under SciDAC1) to high-fidelity multi-physics modeling. Our computational frameworks have been used to model the behavior of a large number of accelerators and accelerator R&D experiments, assisting both their design and performance optimization. As parallel computational applications, the ComPASS codes have been shown to make effective use of thousands of processors.

99 GENERAL AND MISCELLANEOUS↗

Simulating the Birth of the Universe on a PetaFlop

In the beginning, when the universe was less than one microsecond old and more than one trillion degrees hot, it transformed from a plasma of quarks and gluons into bound states of quarks we reefer to as protons and neutrons, the fundamental building blocks of nuclear matter that make up most of the visible universe. We believe this happened because the theory of quantum chromodynamics (QCD), which governs the interactions of the strong nuclear force, predicts it should happen when such conditions occur. Recent experiments at the Relativistic Heavy Ion Collider at Brookhaven National Laboratory have provided direct evidence of the existence of this phase transition in collisions between gold nuclei at the highest attainable energies. But calculating the properties of this phase transition has been notoriously difficult and computationally challenging. What we've been able to discern via this theory has come by situating space and time onto a 4D grid of lattice points, on a volume no bigger than the size of a large nucleus. This discrete formulation of QCD known as lattice QCD (LQCD) can be tamed in a way that's numerically amenable to massively parallel machines. Indeed, our LQCD code scaled with perfect speedup all the way to the 131,072 CPU cores on the world's fastest supercomputer, the BlueGene/L (BG/L) system at Lawrence Livermore National Laboratory (LLNL). Efforts are currently under way to calculate this phase transition's properties using tens of teraflops spread across many of the world's fastest computers. However, the lattice discretization used in our calculations of space-time breaks one of the most crucial properties of the underlying theory: the basic symmetry of chiral rotations. Chiral symmetry can't be fully restored on the lattice, but it can be restored and controlled to a high degree by using the method of domain wall fermions (DWF). DWF introduces an extra fifth dimension, in which chiral symmetry is restored with only a small amount of breaking, which decreases as the fifth dimension's size increases. In particular, researchers have estimated that a fifth dimension of roughly 64 lattice points is sufficient to restore symmetry with a systematic error of only a few percent, even around the transition temperature. Studies have also shown that DWF exhibits excellent fidelity in incorporating the transition's basic driving forces. But the computational cost of this calculation is roughly 2 x 64 = 128 times higher than the cost of current methods that don't preserve this symmetry on the lattice, and thus it falls outside the realm of current terascale supercomputing. With petascale supercomputing, however, this restriction is lifted. If we had petascale supercomputing for our calculation, we could use computational techniques similar to those used on BG/L to calculate the thermodynamic properties--or more precisely, the equation of state--of the quark-gluon plasma just as it begins to form protons and neutrons as it did in the very early universe. The basic level of parallelism again comes from the division of the 4D grid into subgrids assigned to nodes on a massively parallel machine, thereby providing perfect speedup. DWF's fifth dimension provides yet another level of parallelism: given that the nodes of a massively parallel petascale supercomputer will likely consist of several CPU cores per chip, it's natural to fully map the fifth dimension along the node chip's CPU cores. On a 16-CPU core chip, for example, we could assign four fifth-dimension 'slices' per CPU core for a total of 64. In this way, the new level of parallelism in the application matches the new level of parallelism in the hardware. The communication patterns along the fifth dimension are nearest-lattice-neighbor only and can be handled via shared memory or any other on-chip data transfer mechanism, thus alleviating off-chip data transfers while exploiting the hardware's native capability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Asynchronous Many-Task Implementation of In-Situ Statistical Analysis using Legion.

In this report, we propose a framework for the design and implementation of in-situ analy- ses using an asynchronous many-task (AMT) model, using the Legion programming model together with the MiniAero mini-application as a surrogate for full-scale parallel scientific computing applications. The bulk of this work consists of converting the Learn/Derive/Assess model which we had initially developed for parallel statistical analysis using MPI [PTBM11], from a SPMD to an AMT model. In this goal, we propose an original use of the concept of Legion logical regions as a replacement for the parallel communication schemes used for the only operation of the statistics engines that require explicit communication. We then evaluate this proposed scheme in a shared memory environment, using the Legion port of MiniAero as a proxy for a full-scale scientific application, as a means to provide input data sets of variable size for the in-situ statistical analyses in an AMT context. We demonstrate in particular that the approach has merit, and warrants further investigation, in collaboration with ongoing efforts to improve the overall parallel performance of the Legion system.

Pebay, Philippe Pierre↗

CCM vs. CRM Design Optimization of a Boost-derived Parallel Active Power Decoupler for Microinverter Applications

Single-phase inverter or rectifier systems often make use of an auxiliary active power decoupler (APD) to balance the mismatch between steady DC power and fluctuating AC power. This paper deals with efficiency and size optimization of a parallel boost-type APD circuit for PV microinverter applications. Specifically, design of an eGaNFET-based, 400 W APD circuit, employing planar inductor and operating in either continuous conduction mode (CCM) or critical conduction mode (CRM) is considered. Available design variables including inductance value, inductor core geometry, capacitor voltage, switching frequency, and modulation scheme (CCM vs. CRM) are explored to identify Pareto-optimal configurations, which can achieve low California Energy Commission (CEC) efficiency drop while also reducing the footprint area of the inductor. The theoretical study predicts that the optimal CRM design can achieve 37% reduced inductor size, while operating with similar efficiency drop, compared to the optimal CCM design. Experimental results, obtained using two separate 40 V, 400 W hardware prototypes for CCM and CRM, are presented to verify the analyses.

14 SOLAR ENERGY↗

Automatic Parallelization Using OpenMP Based on STL Semantics

Automatic parallelization of sequential applications using OpenMP as a target has been attracting significant attention recently because of the popularity of multicore processors and the simplicity of using OpenMP to express parallelism for shared-memory systems. However, most previous research has only focused on C and Fortran applications operating on primitive data types. C++ applications using high level abstractions such as STL containers are largely ignored due to the lack of research compilers that are readily able to recognize high level object-oriented abstractions of STL. In this paper, we use ROSE, a multiple-language source-to-source compiler infrastructure, to build a parallelizer that can recognize such high level semantics and parallelize C++ applications using certain STL containers. The idea of our work is to automatically insert OpenMP constructs using extended conventional dependence analysis and the known domain-specific semantics of high-level abstractions with optional assistance from source code annotations. In addition, the parallelizer is followed by an OpenMP translator to translate the generated OpenMP programs into multi-threaded code targeted to a popular OpenMP runtime library. Our work extends the applicability of automatic parallelization and provides another way to take advantage of multicore processors.

99 GENERAL AND MISCELLANEOUS↗

Massively Parallel Near-Linear Scalability Algorithms with Application to Unstructured Video Analysis

This paper describes the use of high performance, massively parallel unstructured data analysis techniques to computationally extract human faces from streaming video data. The use of parallel high-throughput algorithms is essential to maximize the rate at which frames can be analyzed so large volumes of data can be evaluated to answer the question “Have we seen this person’s face before?” This paper will highlight the method used to achieve near-linear scalability according to number of processing cores for principle component analysis (PCA) on the Texas Advanced Computing Center (TACC) Ranger supercomputer. A global summation across processing core operation, accomplished via MPI_Reduce on Ranger, causes a slight deviation from linear scaling behavior. This mapping has been utilized in the past to enable a host of data centric analytic techniques such as neural networks, multi-dimensional scaling (MDS), signal processing and other methods to address, with massively parallel computers, problems of scientific interest in Physics, Mathematics, Biology and Chemistry.

99 GENERAL AND MISCELLANEOUS↗

Measurement of PVFS2 performance on InfiniBand

InfiniBand is becoming increasingly popular as a fast interconnect technology between servers and storage. It has far better price/performance ratio compared to both Gigabit Ethernet and 10 Gigabit Ethernet, and hence is being increasingly used for highperformance computing applications. PVFS2, the second generation Parallel Virtual File System (PVFS), is a distributed file system for parallel data access that is being increasingly used in clustered applications. As previous studies have shown, in general, PVFS2 over InfiniBand offers enhanced I/O rates compared to PVFS2 over TCP and Gigabit Ethernet. Apart from the hardware technology, the application programming interface into the file system also makes a difference. To get better parallel performance, the choice of a file system interface is important. Our study is to benchmark and compare the performance of PVFS2 running over InfiniBand using different file system interfaces. IOR is a popular I/O benchmarking tool that supports the POSIX and MPI I/O file system interfaces. In addition to testing these already supported interfaces, we have written a PVFS2 module extension for IOR to support native PVFS2 interfaces into the PVFS2 file system. As we shall see in this study, using native PVFS2 interface offers significant performance benefit compared to other file system interfaces on the PVFS2 file system. Our benchmarking effort also involves studying the effect of a multi-client environment on the I/O performance of different file system interfaces. Based on the benchmarking results we obtain, we determine the most efficient application programming interface for parallel I/O on PVFS2 in a typical multi-client parallel application scenario.

97 MATHEMATICS AND COMPUTING↗

Towards a theory of economic value for modeling and simulation: incremental cost of parallel simulation (wip)

A useful perspective on the economic value of simulation in engineering comes from considering the role simulation plays in constructing a system. We propose a conceptual model that combines an embryonic concept of the value of an information bit with cost estimation tools used in software engineering. The model provides an economic justification for the common conception that models should be built to address specific questions rather than to comprehensively represent a referent system. Extending these ideas, we offer a model for the incremental value of parallel execution to explain why simulation applications that take advantage of sophisticated parallel discrete event simulation tools form a relatively narrow niche despite the ubiquity of parallel computing hardware. The proposed model enables us to bring value of information criteria into model development and to make predictions about the future of parallel simulation applications.

Nutaro, James J↗

Understanding scale-dependent soft-error behavior of scientific applications

Analyzing application fault behavior on large-scale systems is time-consuming and resource-demanding. Currently, researchers need to perform fault injection campaigns at full scale to understand the effects of soft errors on applications and whether these faults result in silent data corruption. Both time and resource requirements greatly limit the scope of the resilience studies that can be currently performed. In this work, we propose a methodology to model application fault behavior at large scale based on a reduced set of experiments performed at small scale. We employ machine learning techniques to accurately model application fault behavior using a set of experiments that can be executed in parallel at small scale. Our methodology drastically reduces the set and the scale of the fault injection experiments to be performed and provides a validated methodology to study application fault behavior at large scale. We show that our methodology can accurately model application fault behavior at large scale by using only small scale experiments. In some cases, we can model the fault behavior of a parallel application running on 4,096 cores with about 90% accuracy based on experiments on a single core.

Kestor, Gokcen G.↗

A Framework for Lattice QCD Calculations on GPUs

Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor. This algorithm is capable of computing GCDs efficiently on many pairs of big integers in parallel by utilizing all cores on a Xeon Phi coprocessor as well as taking advantage of all vector processing units of the coprocessor to speed up critical integer operations within the algorithm. Using 240 threads on a Xeon Phi coprocessor to carry out GCD calculations for a large amount of 2048-bit integers, the implementation achieves the speedup of 30 times over a sequential binary GCD algorithm implementation on a single CPU core, and it delivers twice amount of performance in comparison to the same sequential binary GCD implementation running on 240 threads of the Xeon Phi.

Winter, F. T.↗

IOPro: a parallel I/O profiling and visualization framework for high-performance storage systems

Efficient execution of large-scale scientific applications requires high-performance computing systems designed to meet the I/O requirements. To achieve high-performance, such data-intensive parallel applications use a multi-layer layer I/O software stack, which consists of high-level I/O libraries such as PnetCDF and HDF5, the MPI library, and parallel file systems. To design efficient parallel scientific applications, understanding the complicated flow of I/O operations and the involved interactions among the libraries is quintessential. Such comprehension helps identify I/O bottlenecks and thus exploits the potential performance in different layers of the storage hierarchy. To profile the performance of individual components in the I/O stack and to understand complex interactions among them, we have implemented a GUI-based integrated profiling and analysis framework, IOPro. IOPro automatically generates an instrumented I/O stack, runs applications on it, and visualizes detailed statistics based on the user-specified metrics of interest. We present experimental results from two different real-life applications and show how our framework can be used in practice. By generating an end-to-end trace of the whole I/O stack and pinpointing I/O interference, IOPro aids in understanding I/O behavior and improving the I/O performance significantly.

97 MATHEMATICS AND COMPUTING↗

Parallel heat transport in integrable and chaotic magnetic fields

The study of transport in magnetized plasmas is a problem of fundamental interest in controlled fusion, space plasmas, and astrophysics research. Three issues make this problem particularly challenging: (i) The extreme anisotropy between the parallel (i.e., along the magnetic field), {chi}{sub ||} , and the perpendicular, {chi}{sub Up-Tack }, conductivities ({chi}{sub ||} /{chi}{sub Up-Tack} may exceed 10{sup 10} in fusion plasmas); (ii) Nonlocal parallel transport in the limit of small collisionality; and (iii) Magnetic field lines chaos which in general complicates (and may preclude) the construction of magnetic field line coordinates. Motivated by these issues, we present a Lagrangian Green's function method to solve the local and non-local parallel transport equation applicable to integrable and chaotic magnetic fields in arbitrary geometry. The method avoids by construction the numerical pollution issues of grid-based algorithms. The potential of the approach is demonstrated with nontrivial applications to integrable (magnetic island), weakly chaotic (Devil's staircase), and fully chaotic magnetic field configurations. For the latter, numerical solutions of the parallel heat transport equation show that the effective radial transport, with local and non-local parallel closures, is non-diffusive, thus casting doubts on the applicability of quasilinear diffusion descriptions. General conditions for the existence of non-diffusive, multivalued flux-gradient relations in the temperature evolution are derived.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Simplifying Performance Analysis of Large-scale Adaptive Scientific Applications

Performance analysis of parallel scientific codes is becoming increasingly difficult due to the rapidly growing complexity of applications and architectures. Existing tools fall short in providing intuitive views that facilitate the process of performance debugging and tuning. In this paper, we exploit a recent idea of projecting and visualizing performance data on the communication and hardware domain for faster, more intuitive analysis of applications. We leverage several performance analysis and visualization tools to showcase the discovery of scalability bottlenecks in a structured AMR library. Using novel techniques to project per-phase timing data, application data, and communication data on a communication graph, we identify a previously elusive scaling bottleneck in the library. We present solutions that mitigate this problem, resulting in 22% improvement in the performance for a 65,536-core run on an IBM Blue Gene/P system.

97 MATHEMATICS AND COMPUTING↗

MOOSE ProbML: Parallelized probabilistic machine learning and uncertainty quantification for computational energy applications

Here, this paper presents the development and demonstration of massively parallel probabilistic machine learning (ML) and uncertainty quantification (UQ) capabilities within the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open-source computational platform for parallel finite element and finite volume analyses. In addressing the computational expense and uncertainties inherent in complex multiphysics simulations, this paper integrates Gaussian process (GP) variants, active learning, Bayesian inverse UQ, adaptive forward UQ, Bayesian optimization, evolutionary optimization, and Markov chain Monte Carlo (MCMC) within MOOSE. It also elaborates on the interaction among key MOOSE systems — Sampler, MultiApp, Reporter, and Surrogate — in enabling these capabilities. The modularity offered by these systems enables development of a multitude of probabilistic ML and UQ algorithms in MOOSE. Example code demonstrations include parallel active learning and parallel Bayesian inference via active learning. The impact of these developments is illustrated through five applications relevant to computational energy applications: UQ of nuclear fuel fission product release, using parallel active learning Bayesian inference; very rare events analysis in nuclear microreactors using active learning; advanced manufacturing process modeling using multi-output GPs (MOGPs) and dimensionality reduction; fluid flow using deep GPs (DGPs); and tritium transport model parameter optimization for fusion energy, using batch Bayesian optimization. These capabilities are part of the MOOSE framework.

97 - MATHEMATICS AND COMPUTING↗

Pagoda

Pagoda is a set of parallel tools as well as an application programmer interface for parallel data analysis of high-resolution climate data. Pagoda implements data parallel versions of some of the commonly used tools from the NetCDF Operators. These tools support data processing operations including subsetting, record and ensemble averages, binary operations, and interpolation. Pagoda also provides an application programmer interface for developing custom data analysis programs.

Source record↗

Anisotropic heat transport in integrable and chaotic 3-D magnetic fields

A study of anisotropic heat transport in 3-D chaotic magnetic fields is presented. The approach is based on the recently proposed Lagrangian-Green s function (LG) method in Ref. [1] that allows an efficient and accurate integration of the parallel transport equation applicable to general magnetic fields with local or non-local parallel flux closures. We focus on reversed shear magnetic field configurations known to exhibit separatrix reconnection and shearless transport barriers. The role of reconnection and magnetic field line chaos on temperature transport is studied. Numerical results are presented on the anomalous relaxation of radial temperature gradients in the presence of shearless Cantori partial barri- ers. Also, numerical evidence of non-local effective radial temperature transport in chaotic fields is presented. Going beyond purely parallel transport, the LG method is generalized to include finite perpendicular diffusivity, and the problem of temperature flattening inside a magnetic island is studied.

Del-Castillo-Negrete, Diego B↗

Pagoda

Pagoda is a set of parallel tools as well as an application programmer interface for parallel data analysis of high-resolution climate data. Pagoda implements data parallel versions of some of the commonly used tools from the NetCDF Operators. These tools support data processing operations including subsetting, record and ensemble averages, binary operations, and interpolation. Pagoda also provides an application programmer interface for developing custom data analysis programs.

Source record↗