Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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 775 records · Page 43

Knockout beyond the dripline

In this contribution, we will describe neutron and proton removal from {sup 9}C and {sup 7}Be which are two particularly interesting nuclei entering the nucleo-synthesis pp-chain [1, 2]. Neutron and proton removal reactions have been used in the past twenty years to probe the single-particle structure of exotic nuclei. The core parallel-momentum distribution can give information on the angular momentum and spin of the nucleon initial state while the total removal cross section is sensitive to the asymptotic part of the initial wave function and also to the reaction mechanism. Because knockout is a peripheral reaction from which the Asymptotic Normalization Constant (ANC) of the single-particle wave function can be extracted, it has been used as an indirect method to obtain the rate of reactions like {sup 8}B(p,γ){sup 9}C or {sup 7}Be(p,γ){sup 8}B. Nucleon removal has recently been applied by the HiRA collaboration [3] to situations in which the remaining “core” is beyond the drip line, such as {sup 8}C and {sup 6}Be, unbound by one or more protons, and whose excitation-energy spectrum can be obtained by the invariant-mass method. By gating on the ground-state peak, “core” parallel-momentum distributions and total knockout cross sections have been obtained similar to previous studies with well-bound “cores”. In addition for each projectile, knock out to final bound states has also been obtained in several cases. We will report on the theoretical description and comparison to this experimental data for a few cases for which advances in the accuracy of the transfer-to-the continuum model [4, 5] have been made [6]. These include the use, when available, of “ab-initio” overlaps for the initial state [7] and in particular their ANC values [8]. Also, the construction of a nucleus-target folding potential for the treatment of the core-target S-matrix [9] using for the cores “ab-initio” densities [10] and state-of-the-art n−{sup 9}Be optical potentials [11]. Preliminary results and open problems will be discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalability under a Power Bound using the GREMLINs Framework

With the move towards exascale, system and software developers will have to deal with issues of extreme parallelism. The system properties affected most by the increase in node and core count are the shared resources on node and across the system. The increase in parallelism leads to reduced memory and bandwidth when regarding individual cores. Since power is a limiting factor for supercomputers, and power is not fully utilized in current systems, overprovisioning compute resources is a viable approach to maximized power utilization. To maximize system performance in regard to these changing conditions, it is necessary to understand how resource restrictions impact performance and system behavior. For the purpose of understanding anticipated system properties the GREMLINs Framework was developed. The framework gives the opportunity to add power restrictions, hinder memory properties and introduce faults to study resilience, among others. These features give the opportunity to use current petascale technology to study problems system designers and software developers will have to face when moving towards exascale and beyond. This work describes the initial release of the GREMLINs Framework, developed for this work, and shows how it can be used to study the scaling behavior of proxy applications. These proxy applications represent a selection of HPC workloads important to the scientific community. The proxy applications studied are AMG2013, an algebraic multi-grid linear system solver, CoMD, a classical molecular dynamics proxy application and NEKBONE, an application that uses a high order spectral element method to solve the Navier-Stokes equations. The main interest of these studies lies in analysis regarding their power behavior at scale under a power bound. These findings show how the GREMLINs Framework can help systems and software designers to attain better application performance and can also be used as basis for CPU power balancing tools to use power more efficiently.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Fast shared-memory streaming multilevel graph partitioning

In this report we show that a fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved algorithms and the most successful methods in this category belong to the multilevel approaches. In this work, we assess the feasibility of using streaming graph partitioning algorithms within the multilevel framework. Our end goal is to come up with a fast parallel offline multilevel partitioner that can produce competitive cutsize quality. We rely on a simple but fast and flexible streaming algorithm throughout the entire multilevel framework. This streaming algorithm serves multiple purposes in the partitioning process: a clustering algorithm in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Its simple nature also lends itself easily for parallelization. The experiments on various graphs show that our approach is on the average up to 5.1x faster than the multi-threaded MeTiS, which comes at the expense of only 2x worse cutsize.

97 MATHEMATICS AND COMPUTING↗

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Architectures

Faced with physical and energy density limitations on clock speed, contemporary microprocessor designers have increasingly turned to on-chip parallelism for performance gains. Algorithms should accordingly be designed with ample amounts of fine-grained parallelism if they are to realize the full performance of the hardware. This requirement can be challenging for algorithms that are naturally expressed as a sequence of small-matrix operations, such as the Kalman filter methods widely in use in high-energy physics experiments. In the High-Luminosity Large Hadron Collider (HL-LHC), for example, one of the dominant computational problems is expected to be finding and fitting charged-particle tracks during event reconstruction; today, the most common track-finding methods are those based on the Kalman filter. Experience at the LHC, both in the trigger and offline, has shown that these methods are robust and provide high physics performance. Previously we reported the significant parallel speedups that resulted from our efforts to adapt Kalman-filter-based tracking to many-core architectures such as Intel Xeon Phi. Here we report on how effectively those techniques can be applied to more realistic detector configurations and event complexity.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields

We present a novel numerical method for solving the anisotropic diffusion equation in magnetic fields confined to a periodic box which is accurate and provably stable. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing both boundary conditions and parallel diffusion operator obtained by field line tracing. We prove that the fully-discrete approximation is unconditionally stable. Discrete energy estimates are shown to match the continuous energy estimate given the correct choice of penalty parameters. A nonlinear penalty parameter is shown to provide an effective method for tuning the parallel diffusion penalty and significantly minimises rounding errors. Several numerical experiments, using manufactured solutions, the “NIMROD benchmark” problem and a single island problem, are presented to verify numerical accuracy, convergence, and asymptotic preserving properties of the method. Finally, we present a magnetic field with chaotic regions and islands and show the contours of the anisotropic diffusion equation reproduce key features in the field.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Finite-difference schemes for anisotropic diffusion

In fusion plasmas diffusion tensors are extremely anisotropic due to the high temperature and large magnetic field strength. This causes diffusion, heat conduction, and viscous momentum loss, to effectively be aligned with the magnetic field lines. This alignment leads to different values for the respective diffusive coefficients in the magnetic field direction and in the perpendicular direction, to the extent that heat diffusion coefficients can be up to 10{sup 12} times larger in the parallel direction than in the perpendicular direction. This anisotropy puts stringent requirements on the numerical methods used to approximate the MHD-equations since any misalignment of the grid may cause the perpendicular diffusion to be polluted by the numerical error in approximating the parallel diffusion. Currently the common approach is to apply magnetic field-aligned coordinates, an approach that automatically takes care of the directionality of the diffusive coefficients. This approach runs into problems at x-points and at points where there is magnetic re-connection, since this causes local non-alignment. It is therefore useful to consider numerical schemes that are tolerant to the misalignment of the grid with the magnetic field lines, both to improve existing methods and to help open the possibility of applying regular non-aligned grids. To investigate this, in this paper several discretization schemes are developed and applied to the anisotropic heat diffusion equation on a non-aligned grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

Asynchronous distributed-memory task-parallel algorithm for compressible flows on unstructured 3D Eulerian grids

Here, we discuss the implementation of a finite element method, used to numerically solve the Euler equations of compressible flows, using an asynchronous runtime system (RTS). The algorithm is implemented for distributed-memory machines, using stationary unstructured 3D meshes, combining data-, and task-parallelism on top of the Charm++ RTS. Charm++’s execution model is asynchronous by default, allowing arbitrary overlap of computation and communication. Task-parallelism allows scheduling parts of an algorithm independently of, or dependent on, each other. Built-in automatic load balancing enables continuous redistribution of computational load by migration of work units based on real-time CPU load measurement. The RTS also features automatic checkpointing, fault tolerance, resilience against hardware failure, and supports power-, and energy-aware computation. We demonstrate scalability up to 25 x 10 9 cells at $\mathscr{O}$10 4 compute cores and the benefits of automatic load balancing for irregular workloads. The full source code with documentation is available at https://quinoacomputing.org.

42 ENGINEERING↗

Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

We employ Anderson extrapolation to accelerate the classical Jacobi iterative method for large, sparse linear systems. Specifically, we utilize extrapolation at periodic intervals within the Jacobi iteration to develop the Alternating Anderson–Jacobi (AAJ) method. We verify the accuracy and efficacy of AAJ in a range of test cases, including nonsymmetric systems of equations. We demonstrate that AAJ possesses a favorable scaling with system size that is accompanied by a small prefactor, even in the absence of a preconditioner. In particular, we show that AAJ is able to accelerate the classical Jacobi iteration by over four orders of magnitude, with speed-ups that increase as the system gets larger. Moreover, we find that AAJ significantly outperforms the Generalized Minimal Residual (GMRES) method in the range of problems considered here, with the relative performance again improving with size of the system. As a result, the proposed method represents a simple yet efficient technique that is particularly attractive for large-scale parallel solutions of linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

Massively parallel phase-field simulations targeting exascale

The interface thickness in the phase-field (PF) method limits its simulation scales. Consequently, large-scale PF simulations become prohibitively expensive for resolving the extremely fine microstructures that typically form during rapid solidification processing. This challenge is significant in predicting microstructure evolution in metal additive manufacturing and has been identified by the United States Department of Energy’s Exascale Computing Project. Here, to address this, we develop a multi-GPU and MPI-based massively parallel simulation code, utilizing state-of-the-art algorithms, software, and libraries, for large-scale three-dimensional (3D) PF simulations. We report the first GPU-parallel PF simulations on Frontier (currently the second TOP500 exascale cluster) and Summit machines, taking dendritic growth as an example problem. We evaluate the parallel performance of our implementation using scaling studies with more than 24 000 GPUs (among the largest known computations to date) and the acceleration performance using large-scale simulations of dendritic growth in 3D. Finally, massively parallel GPUs in these supercomputers enabled the first coupled multiscale simulations of laser melting and subsequent dendritic solidification on the scale of a full melt-pool, demonstrating the feasibility of performing PF simulations with a point total over 2 billion grid points within an acceptable time.

Exascale↗

Multirate partitioned Runge–Kutta methods for coupled Navier–Stokes equations

Earth system models are complex integrated models of atmosphere, ocean, sea ice, and land surface. Coupling the components can be a significant challenge due to the difference in physics, temporal, and spatial scales. Further, this study explores multirate partitioned Runge-Kutta methods for the fluid-fluid interaction problem and demonstrates its parallel performance by using the PETSc library. We consider compressible Navier-Stokes equations with gravity coupled through a rigid-lid interface. Our large-scale numerical experiments reveal that multirate partitioned Runge-Kutta coupling schemes (1) can conserve total mass; (2) have second-order accuracy in time; and (3) provide favorable strong- and weak-scaling performance on modern computing architectures. We also show that the speedup factors of multirate partitioned Runge-Kutta methods match theoretical expectations over their base (single-rate) method.

54 ENVIRONMENTAL SCIENCES↗

Impact of pellet preparation on reflectance measurements of ammonium sulfate by single-angle reflectance spectroscopy

The optical constants, n and k, are required to model the reflection, refraction and transmission of light at the first surface interface of a material, as well as its propagation through the material; here n corresponds to the real component and k the imaginary component of the refractive index. Several different spectroscopic methods have been used to determine the n and k values for different materials, including single angle reflectance spectroscopy and ellipsometry. The single-angle reflectance method quantitatively records the specular reflectance R(v) from a plane parallel face of the material and uses the Kramers-Kronig transform to extract the n and k values. For most compounds, however, it is difficult to obtain a single crystal or high-quality window of sufficient planarity and of the appropriate dimensions (several mm) to make the measurement. For this reason, we further investigate the use of pressed pellets of neat powdered substances to measure optical constants of these substances using the single-angle reflectance method. We have found that surface roughness can significantly influence the measured quantitative reflectance spectrum R(v) and, consequently, the derived n and k parameters. A collaborative study between Defence Research and Development Canada (DRDC) - Valcartier Research Center and Pacific Northwest National Laboratory (PNNL) has been carried out using different pellets of neat ammonium sulfate [(NH4)2SO4] to show how parameters such as the relative fraction of particle sizes for the component powder along with the grinding process of the pure compound all can affect the reflectance spectrum used to derive the optical constants. All pressed pellets were characterized by single-angle reflectance spectroscopy.

Diaz, Emmanuela↗

Sensor assemblies and methods for emulating interaction of entities within water systems

Sensor assemblies are provided for use in modeling water systems. These sensor assemblies can be used as sensor fish. These assemblies can include a circuit board supporting processing circuitry components on either or both opposing component support surfaces of the circuit board and a housing above the circuit board and the components, with the housing being circular about the circuit board in at least one cross section, and wherein the supporting surfaces of the circuit board are substantially parallel with the plane of the housing in the one cross section. Methods for emulating interaction of entities within water systems are provided. The methods can include introducing a sensor assembly into a water system. The sensor assembly can include: a circuit board supporting processing circuitry components on either or both of opposing component support surfaces of the circuit board; a housing about the circuit board and the components, the housing being circular about the circuit board in at least one cross section; and wherein the support surfaces of the circuit board are substantially parallel with the plane of the housing in the one cross section.

Deng, Z. Daniel↗

Nitrogen-modified nano-titania: True phase composition, microstructure and visible-light induced photocatalytic NO{sub x} abatement

Titanium dioxide (TiO{sub 2}) is a popular photocatalyst used for many environmental and anti-pollution applications, but it normally operates under UV light, exploiting ∼5% of the solar spectrum. Nitrification of titania to form N-doped TiO{sub 2} has been explored as a way to increase its photocatalytic activity under visible light, and anionic doping is a promising method to enable TiO{sub 2} to harvest visible-light by changing its photo-absorption properties. In this paper, we explore the insertion of nitrogen into the TiO{sub 2} lattice using our green sol–gel nanosynthesis method, used to create 10 nm TiO{sub 2} NPs. Two parallel routes were studied to produce nitrogen-modified TiO{sub 2} nanoparticles (NPs), using HNO{sub 3}+NH{sub 3} (acid-precipitated base-peptised) and NH{sub 4}OH (totally base catalysed) as nitrogen sources. These NPs were thermally treated between 450 and 800 °C. Their true phase composition (crystalline and amorphous phases), as well as their micro-/nanostructure (crystalline domain shape, size and size distribution, edge and screw dislocation density) was fully characterised through advanced X-ray methods (Rietveld-reference intensity ratio, RIR, and whole powder pattern modelling, WPPM). As pollutants, nitrogen oxides (NO{sub x}) are of particular concern for human health, so the photocatalytic activity of the NPs was assessed by monitoring NO{sub x} abatement, using both solar and white-light (indoor artificial lighting), simulating outdoor and indoor environments, respectively. Results showed that the onset of the anatase-to-rutile phase transformation (ART) occurred at temperatures above 450 °C, and NPs heated to 450 °C possessed excellent photocatalytic activity (PCA) under visible white-light (indoor artificial lighting), with a PCA double than that of the standard P25 TiO{sub 2} NPs. However, higher thermal treatment temperatures were found to be detrimental for visible-light photocatalytic activity, due to the effects of four simultaneous occurrences: (i) loss of OH groups and water adsorbed on the photocatalyst surface; (ii) growth of crystalline domain sizes with decrease in specific surface area; (iii) onset and progress of the ART; (iv) the increasing instability of the nitrogen in the titania lattice. - Graphical abstract: Nitrogen modified TiO{sub 2} synthesised via a green aqueous sol–gel method showed to degrade nitrogen oxides (NO{sub x}) under visible white-light (indoor artificial lighting), with a photocatalytic activity double than that of the standard P25 TiO{sub 2} NPs. - Highlights: • N–TiO{sub 2} synthesised via a green aqueous sol–gel method. • Advanced X-ray methods used to detect both crystalline and amorphous contents. • Microstructure fully addressed via XRPD and whole powder pattern modelling. • Photocatalytic NO{sub x} removal assessed using both solar and visible-light lamps.

36 MATERIALS SCIENCE↗

Virtual Time III, Part 1: Unified Virtual Time Synchronization for Parallel Discrete Event Simulation

Algorithms for synchronization of parallel discrete event simulation have historically been divided between conservative methods that require lookahead but not rollback, and optimistic methods that require rollback but not lookahead. In this paper we present a new approach in the form of a framework called Unified Virtual Time (UVT) that unifies the two approaches, combining the advantages of both within a single synchronization theory. Whenever timely lookahead information is available, a logical process (LP) executes conservatively using an irreversible event handler. When lookahead information is not available the LP does not block, as it would in a classical conservative execution, but instead executes optimistically using a reversible event handler. The switch from conservative to optimistic synchronization and back is decided on an event-by-event basis by the simulator, transparently to the model code. UVT treats conservative synchronization algorithms as optional accelerators for an underlying optimistic synchronization algorithm, enabling the speed of conservative execution whenever it is applicable, but otherwise falling back on the generality of optimistic execution. We describe UVT in a novel way, based on fundamental invariants, monotonicity requirements, and synchronization rules. UVT permits zero-delay messages and pays careful attention to tie-handling using superposition. We prove that under fairly general conditions a UVT simulation always makes progress in virtual time. This is Part 1 of a trio of papers describing the UVT framework for PDES, mixing conservative and optimistic synchronization and integrating throttling control.

97 MATHEMATICS AND COMPUTING↗

Recovering noise-free quantum observables

We introduce a technique for recovering noise-free observables in noisy quantum systems by combining the results of many slightly different experiments. Our approach is applicable to a variety of quantum systems, but we illustrate it with applications to quantum information and quantum sensing. The approach corresponds to repeating the same quantum evolution many times with known variations on the underlying systems' error properties, e.g., the spontaneous emission and dephasing times $T_1$ and $T_2$. As opposed to standard quantum error correction methods, which have an overhead in the number of qubits (many physical qubits must be added for each logical qubit), our method has only an overhead in the number of evaluations, allowing the overhead to, in principle, be hidden via parallelization. We show that the effective spontaneous emission $T_1$ and dephasing $T_2$ times can be increased using this method in both simulation and experiments on an actual quantum computer. We also show how to correct more complicated entangled states and how Ramsey fringes relevant to quantum sensing can be significantly extended in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Decentralized Interleaving of Paralleled Dc-Dc Buck Converters: Preprint

We present a decentralized control strategy that yields switch interleaving among parallel connected dc-dc buck converters without communication. The proposed method is based on the digital implementation of the dynamics of a nonlinear oscillator circuit as the controller. Each controller is fully decentralized, i.e., it only requires the locally measured output current to synthesize the pulse width modulation (PWM) carrier waveform. By virtue of the intrinsic electrical coupling between converters, the nonlinear oscillator-based controllers converge to an interleaved state with uniform phase-spacing across PWM carriers. To the knowledge of the authors, this work represents the first fully decentralized strategy for switch interleaving of paralleled dc-dc buck converters.

14 SOLAR ENERGY↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗