Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 289 records · Page 16

Finding Tropical Cyclones on a Cloud Computing Cluster: Using Parallel Virtualization for Large-Scale Climate Simulation Analysis

Extensive computing power has been used to tackle issues such as climate changes, fusion energy, and other pressing scientific challenges. These computations produce a tremendous amount of data; however, many of the data analysis programs currently only run a single processor. In this work, we explore the possibility of using the emerging cloud computing platform to parallelize such sequential data analysis tasks. As a proof of concept, we wrap a program for analyzing trends of tropical cyclones in a set of virtual machines (VMs). This approach allows the user to keep their familiar data analysis environment in the VMs, while we provide the coordination and data transfer services to ensure the necessary input and output are directed to the desired locations. This work extensively exercises the networking capability of the cloud computing systems and has revealed a number of weaknesses in the current cloud system software. In our tests, we are able to scale the parallel data analysis job to a modest number of VMs and achieve a speedup that is comparable to running the same analysis task using MPI. However, compared to MPI based parallelization, the cloud-based approach has a number of advantages. The cloud-based approach is more flexible because the VMs can capture arbitrary software dependencies without requiring the user to rewrite their programs. The cloud-based approach is also more resilient to failure; as long as a single VM is running, it can make progress while as soon as one MPI node fails the whole analysis job fails. In short, this initial work demonstrates that a cloud computing system is a viable platform for distributed scientific data analyses traditionally conducted on dedicated supercomputing systems.

97 MATHEMATICS AND COMPUTING↗

Hierarchical calibration and validation for modeling bench-scale solvent-based carbon capture. Part 1: Non-reactive physical mass transfer across the wetted wall column

A hierarchical model calibration and validation are proposed here for quantifying the confidence level of mass transfer prediction using a computational fluid dynamics (CFD) model, where the solvent-based carbon dioxide (CO 2 ) capture is simulated and the predicted results are compared to the corresponding bench-scale experimental data. Two unit problems with an increasing level of complexity are proposed to break down the complex physical/chemical processes of solvent-based CO 2 capture into relatively simpler problems to separate the effects of physical transport and chemical reaction. This paper focuses on the calibration and validation of the first unit problem, i.e., the CO 2 mass transfer across a falling ethanolamine (MEA) film in the absence of chemical reaction. This problem is investigated both experimentally and numerically using non-reactive nitrous oxide (N 2 O) as a surrogate for CO 2 . To capture motion of the gas-liquid interface, a volume of fluid method is employed with a one-fluid formulation to compute the mass transfer between the two phases. Parallel bench-scale experiments are designed and conducted to validate and calibrate the CFD models using a general Bayesian calibration approach. Two important transport parameters, Henry's constant and gas diffusivity, are calibrated to produce the posterior distributions, which will be used as input for the second unit problem to address the chemical absorption of CO 2 across the MEA falling film, where both mass transfer and chemical reaction are involved. Finally, mass transfer coefficients predicted by CFD are also compared with those predicted by the traditional/empirical correlations under both steady and wavy falling film conditions.

54 ENVIRONMENTAL SCIENCES↗

Adapting the serial Alpgen parton-interaction generator to simulate LHC collisions on millions of parallel threads

As the LHC moves to higher energies and luminosity, the demand for computing resources increases accordingly and will soon outpace the growth of the World- wide LHC Computing Grid. To meet this greater demand, event generation Monte Carlo was targeted for adaptation to run on Mira, the supercomputer at the Argonne Leadership Computing Facility. Alpgen is a Monte Carlo event generation application that is used by LHC experiments in the simulation of collisions that take place in the Large Hadron Collider. This paper details the process by which Alpgen was adapted from a single-processor serial-application to a large-scale parallel-application and the performance that was achieved.

HEP↗

Provisioning a Multi-Tiered Data Staging Area for Extreme-Scale Machines

Massively parallel scientific applications, running on extreme-scale supercomputers, produce hundreds of terabytes of data per run, driving the need for storage solutions to improve their I/O performance. Traditional parallel file systems (PFS) in high performance computing (HPC) systems are unable to keep up with such high data rates, creating a storage wall. In this work, we present a novel multi-tiered storage architecture comprising hybrid node-local resources to construct a dynamic data staging area for extreme-scale machines. Such a staging ground serves as an impedance matching device between applications and the PFS. Our solution combines diverse resources (e.g., DRAM, SSD) in such a way as to approach the performance of the fastest component technology and the cost of the least expensive one. We have developed an automated provisioning algorithm that aids in meeting the checkpointing performance requirement of HPC applications, by using a least-cost storage configuration. We evaluate our approach using both an implementation on a large scale cluster and a simulation driven by six-years worth of Jaguar supercomputer job-logs, and show that our approach, by choosing an appropriate storage configuration, achieves 41.5% cost savings with only negligible impact on performance.

99 GENERAL AND MISCELLANEOUS↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗

OPER: Optimality-Guided Embedding Table Parallelization for Large-scale Recommendation Model

With the sharp increasing volume of user data, Deep Learning Recommendation Model (DLRM) becomes an indispensable infrastructure in large technology companies. However, large-scale DLRM on the multi-GPU platform is still inefficient due to unbalanced workload partitioning and intensive inter-GPU communication. To this end, we propose OPER, an OPtimality guided Embedding table placement for large-scale Recommendation model training and inference. OPER explores the potential of mitigating remote memory access latency in DLRM through fine-grained embedding table placement. Specifically, OPER proposes a theoretical modeling that builds up the relationship between EMT placement and the embedding communication latency in both training and inference. OPER proves the NP hardness of finding the optimal embedding table placement and proposes a heuristic algorithm that yields near optimal placement. OPER implements a SHMEM-based embedding table training system and a unified embedding index mapping to support fine-grained embedding table sharding and placement. Comprehensive experiments reveal that OPER achieves on average 3.4× and 5.1× speedup on training and inference respectively over state-of-the-art DLRM frameworks.

Wang, Zheng↗

A Scalable Parallel Algorithm for Large-Scale Protein Sequence Homology Detection

Protein sequence homology detection is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting homology between two protein sequences is computationally inexpensive, detecting pairwise homology at a large-scale becomes prohibitive, requiring millions of CPU hours. Yet, there is currently no efficient method available to parallelize this kernel. In this paper, we present the key characteristics that make this problem particularly hard to parallelize, and then propose a new parallel algorithm that is suited for large-scale protein sequence data. Our method, called pGraph, is designed using a hierarchical multiple-master multiple-worker model, where the processor space is partitioned into subgroups and the hierarchy helps in ensuring the workload is load balanced fashion despite the inherent irregularity that may originate in the input. Experimental evaluation demonstrates that our method scales linearly on all input sizes tested (up to 640K sequences) on a 1,024 node supercomputer. In addition to demonstrating strong scaling, we present an extensive study of the various components of the system and related parametric studies.

59 BASIC BIOLOGICAL SCIENCES↗

Partition-of-unity finite-element method for large scale quantum molecular dynamics on massively parallel computational platforms

Over the course of the past two decades, quantum mechanical calculations have emerged as a key component of modern materials research. However, the solution of the required quantum mechanical equations is a formidable task and this has severely limited the range of materials systems which can be investigated by such accurate, quantum mechanical means. The current state of the art for large-scale quantum simulations is the planewave (PW) method, as implemented in now ubiquitous VASP, ABINIT, and QBox codes, among many others. However, since the PW method uses a global Fourier basis, with strictly uniform resolution at all points in space, and in which every basis function overlaps every other at every point, it suffers from substantial inefficiencies in calculations involving atoms with localized states, such as first-row and transition-metal atoms, and requires substantial nonlocal communications in parallel implementations, placing critical limits on scalability. In recent years, real-space methods such as finite-differences (FD) and finite-elements (FE) have been developed to address these deficiencies by reformulating the required quantum mechanical equations in a strictly local representation. However, while addressing both resolution and parallel-communications problems, such local real-space approaches have been plagued by one key disadvantage relative to planewaves: excessive degrees of freedom (grid points, basis functions) needed to achieve the required accuracies. And so, despite critical limitations, the PW method remains the standard today. In this work, we show for the first time that this key remaining disadvantage of real-space methods can in fact be overcome: by building known atomic physics into the solution process using modern partition-of-unity (PU) techniques in finite element analysis. Indeed, our results show order-of-magnitude reductions in basis size relative to state-of-the-art planewave based methods. The method developed here is completely general, applicable to any crystal symmetry and to both metals and insulators alike. We have developed and implemented a full self-consistent Kohn-Sham method, including both total energies and forces for molecular dynamics, and developed a full MPI parallel implementation for large-scale calculations. We have applied the method to the gamut of physical systems, from simple insulating systems with light atoms to complex d- and f-electron systems, requiring large numbers of atomic-orbital enrichments. In every case, the new PU FE method attained the required accuracies with substantially fewer degrees of freedom, typically by an order of magnitude or more, than the current state-of-the-art PW method. Finally, our initial MPI implementation has shown excellent parallel scaling of the most time-critical parts of the code up to 1728 processors, with clear indications of what will be required to achieve comparable scaling for the rest. Having shown that the key remaining disadvantage of real-space methods can in fact be overcome, the work has attracted significant attention: with sixteen invited talks, both domestic and international, so far; two papers published and another in preparation; and three new university and/or national laboratory collaborations, securing external funding to pursue a number of related research directions. Having demonstrated the proof of principle, work now centers on the necessary extensions and optimizations required to bring the prototype method and code delivered here to production applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

GPU-based parallel algorithm for generating massive scale-free networks using the preferential attachment model

A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale-free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale-free network of two billion edges in less than 3 seconds.

Alam, Maksudul↗

Electromagnetic Shielding Design for 200 kW Stationary Wireless Charging of Light-Duty EV

Wireless power transfer (WPT) is a developing technology with the advantage of convenience and flexible charging. SAE recommended practice J2954 defines typical size and geometry with aluminum or ferrite plate shielding to limit leakage electromagnetic (EM) fields for WPT with power levels lower than 22 kVA from the input side. However, as the WPT power goes up to 100- or 200-kW level, EM safety surrounding the WPT becomes a critical concern. To address this oncoming safety challenge, a novel ferrite shielding design is proposed in this paper. Different misalignment scenarios in accordance with definitions in SAE J2954 are also taken into consideration to ensure EM safety under various operation scenarios. Simulation results, which are preliminarily verified by magnetic field measurements at 1.1 m from the center of the vehicle side coil under 100 kW operation, indicate that the magnetic field leakage can be maintained below the limits defined in SAE J2954 for 200 kW operation. A 3.3 kW scale-down test was also carried out and compared to parallel scale-down simulations. 26.8% field emission reduction is observed from the scale-down test, which supports the effectiveness of the proposed shielding design.

Zhang, Bo↗

Electromagnetic Shielding Design for 200 kW Stationary Wireless Charging of Light-Duty EV

Wireless power transfer (WPT) is a developing technology with the advantage of convenience and flexible charging. SAE recommended practice J2954 defines typical size and geometry with aluminum or ferrite plate shielding to limit leakage electromagnetic (EM) fields for WPT with power levels lower than 22 kVA from the input side. However, as the WPT power goes up to 100- or 200-kW level, EM safety surrounding the WPT becomes a critical concern. To address this oncoming safety challenge, a novel ferrite shielding design is proposed in this paper. Different misalignment scenarios in accordance with definitions in SAE J2954 are also taken into consideration to ensure EM safety under various operation scenarios. Simulation results, which are preliminarily verified by magnetic field measurements at 1.1 m from the center of the vehicle side coil under 100 kW operation, indicate that the magnetic field leakage can be maintained below the limits defined in SAE J2954 for 200 kW operation. A 3.3 kW scale-down test was also carried out and compared to parallel scale-down simulations. 26.8% field emission reduction is observed from the scale-down test, which supports the effectiveness of the proposed shielding design.

25 ENERGY STORAGE↗

Denovo--A New Three-Dimensional Parallel Discrete Ordinates Code in SCALE

Denovo is a new, three-dimensional, discrete ordinates (SN) transport code that uses state-of-the-art solution methods to obtain accurate solutions to the Boltzmann transport equation. Denovo uses the Koch-Baker-Alcouffe parallel sweep algorithm to obtain high parallel efficiency on O(100) processors on XYZ orthogonal meshes. As opposed to traditional SN codes that use source iteration, Denovo uses nonstationary Krylov methods to solve the within-group equations. Krylov methods are far more efficient than stationary schemes. Additionally, classic acceleration schemes (diffusion synthetic acceleration) do not suffer stability problems when used as a preconditioner to a Krylov solver. Denovo's generic programming framework allows multiple spatial discretization schemes and solution methodologies. Denovo currently provides diamond-difference, theta-weighted diamond-difference, linear-discontinuous finite element, trilinear-discontinuous finite element, and step characteristics spatial differencing schemes. Also, users have the option of running traditional source iteration instead of Krylov iteration. Multigroup upscatter problems can be solved using Gauss-Seidel iteration with transport, two-grid acceleration. A parallel first-collision source is also available. Denovo solutions to the Kobayashi benchmarks are in excellent agreement with published results. Parallel performance shows excellent weak scaling up to 20000 cores and good scaling up to 40000 cores.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A parallel Eulerian interface tracking/Lagrangian point particle multi-scale coupling procedure

This paper presents a parallel Eulerian/Lagrangian multi-scale coupling procedure for two-phase flows. At the fully resolved scale, the dynamically evolving phase interface is tracked using a Eulerian approach. In regions of the flow, where the phase interface geometry can no longer be resolved adequately, separated, small scale liquid structures are described by a Lagrangian point particle approach. The coupling procedure of these two descriptions consists of an efficient parallel algorithm that identifies tracked liquid candidate structures, removes them from the resolved Eulerian description, and inserts them into the Lagrangian description preserving their position, mass, momentum, and lower order shape. While in principle applicable to level set, Volume of Fluid, and marker particle interface tracking methods for the fully resolved scale, this paper focuses on examples from atomization simulations using the refined level set grid method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global Hybrid Simulations of Interaction Between Interplanetary Rotational Discontinuity and Bow Shock/Magnetosphere: Can Ion-Scale Magnetic Reconnection be Driven by Rotational Discontinuity Downstream of Quasi-Parallel Shock?

Ion-scale magnetic reconnection has been observed downstream of the terrestrial quasi-parallel (Q-∥) shock. Whether it is driven by interplanetary discontinuities or turbulent Q-∥ shock, however, is unclear. Using three-dimensional global hybrid simulation, we investigate the generation of magnetic reconnection downstream of the Q-∥ shock, while an interplanetary rotational discontinuity (RD) is launched to the bow shock. Cases with various solar wind Alfvén Mach numbers, M A = 3.0 to 8, and propagation directions of the RD are presented. The propagation direction n is assumed to be in the GSE xz plane and pointing earthward, with n = (-sin(θ 12 /2),0,-cos(θ 12 /2)), where θ 12 is the angle between the upstream (B1) and downstream (B2) magnetic fields across the transmitted RD. It is found that magnetic reconnection occurs inside the RD downstream of the Q-∥ shock, forming flux ropes extending along the dawn-dusk direction about tens of ion inertial lengths. Large-amplitude low-frequency waves originated from the Q-∥ shock lead to the bending and squeezing of the field lines around the RD, which play an important role in triggering reconnection inside the RD. As the RD impacts the dayside magnetopause, magnetopause reconnection takes place between the field lines behind the RD and geomagnetic field lines. Nevertheless, no reconnection is found downstream of the Q-∥ shock itself or outside the RD in the magnetosheath. The existent and structure of reconnection in the magnetosheath are found to strongly depend on the parameters M A and n. Our simulation shows that ion-scale magnetic reconnection is driven by an external driver in the form of the compression of an RD around the bow shock and in the magnetosheath, rather than caused by the turbulent Q-∥ shock alone.

79 ASTRONOMY AND ASTROPHYSICS↗

Fit Fly: A Case Study of Interconnect Innovation through Parallel Simulation

To meet the demand for exascale-level performance from high-performance computing (HPC) interconnects, many system architects are turning to simulation results for accurate and reliable predictions of the performance of prospective technologies. Testing full-scale networks with a variety of benchmarking tools, including synthetic workloads and application traces, can give crucial insight into what ideas are most promising without needing to physically construct a test network. While flexible, however, this approach is extremely compute time intensive. We address this time complexity challenge through the use of large-scale, optimistic parallel simulation that ultimately leads to faster HPC network architecture innovations. In this paper we demonstrate this innovation capability through a real-world network design case study. Specifically, we have simulated and compared four extreme-scale interconnects: Dragonfly, Megafly, Slim Fly, and a new dual-rail-dual-plane variation of the Slim Fly network topology. We present this new variant of Slim Fly, dubbed Fit Fly, to show how interconnect innovation and evaluation-beyond what is possible through analytic methods-can be achieved through parallel simulation. We validate and compare the model with various network designs using the CODES interconnect simulation framework. By running large-scale simulations in a parallel environment, we are able to quickly generate reliable performance results that can help network designers break ground on the next generation of high-performance network designs.

High Performance Computing↗

Performance Evaluation of Different Parallel Programming Models in SCALE-Shift Sequences for Criticality and Shielding Applications [Abstract]

The SCALE code system has been widely used for nuclear criticality safety, reactor physics, radiation shielding, source term generation, and inventory analyses by researchers, industry, and regulatory bodies. Although limited support for shared- and distributed-memory parallel processing was introduced via C++ threading, OpenMP, and MPI, a hybrid parallel programming model with both distributed- and shared-memory parallelism has not been fully supported in the SCALE code system.

Nuclear Criticality Safety Program (NCSP)↗