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 523 records · Page 29

eQE: An open‐source density functional embedding theory code for the condensed phase

Abstract In this work, we present the main features and algorithmic details of a novel implementation of the frozen density embedding (FDE) formulation of subsystem density functional theory (DFT) that is specifically designed to enable ab initio molecular dynamics (AIMD) simulations of large‐scale condensed‐phase systems containing 1000s of atoms. This code (available at http://eqe.rutgers.edu ) has been given the moniker of embedded Quantum ESPRESSO (eQE) as it is a generalization of the open‐source Quantum ESPRESSO (QE) suite of programs. The strengths of eQE reside in a hierarchical parallelization scheme that allows for an efficient and fully self‐consistent treatment of the electronic structure (via the addition of an additional DIIS extrapolation layer) while simultaneously exploiting the inherent symmetries and periodicities in the system (via sampling of subsystem‐specific first Brillouin zones and utilization of subsystem‐specific basis sets). While bulk liquids and molecular crystals are two classes of systems that exemplify the utility of the FDE approach (as these systems can be partitioned into weakly interacting subunits), we show that eQE has significantly extended this regime of applicability by outperforming standard semilocal Kohn–Sham DFT (KS‐DFT) for large‐scale heterogeneous catalysts with quite different layer‐specific electronic structure and intrinsic periodicities. eQE features very favorable strong parallel scaling for a model system of bulk liquid water composed of 256 water molecules, which allows for a significant decrease in the overall time to solution when compared to KS‐DFT. We show that eQE achieves speedups greater than one order of magnitude ( ) when performing AIMD simulations of such large‐scale condensed‐phase systems as: (1) molecular liquids via bulk liquid water represented by 1024 independent water molecules (3072 atoms with a 25.3× speedup over KS‐DFT), (2) polypeptide/biomolecule solvation via ( gly ) 6 solvated in (H 2 O) 395 (1230 atoms with a 38.6× speedup over KS‐DFT), and (3) molecular crystals via a 3 × 3 × 3 periodic supercell of pentacene (1940 atoms with a 12.0× speedup over KS‐DFT). These results represent a significant improvement over the current state‐of‐the‐art and now enable subsystem DFT‐based AIMD simulations of realistically sized condensed‐phase systems of interest throughout chemistry, physics, and materials science.

Genova, Alessandro↗

Towards Native Execution of Deep Learning on a Leadership-Class HPC System

Large parallel machines generally offer the best parallel performance with "native execution" that is achieved using codes developed with the optimized compilers, communication libraries, and runtimes offered on the machines. In this paper, we report and analyze performance results from native execution of deep learning on a leadership-class high-performance computing (HPC) system. Using our new code called DeepEx, we present a study of the parallel speed up and convergence rates of learning achieved with native parallel execution. In the trade-off between computational parallelism and synchronized convergence, we first focus on maximizing parallelism while still obtaining convergence. Scaling results are reported from execution on up to 15,000 GPUs using two scientific data sets from atom microscopy and protein folding applications, and also using the popular ImageNet data set. In terms of the traditional measure of parallel speed up, excellent scaling is observed up to 12,000 GPUs. Additionally, accounting for convergence rates of deep learning accuracy or error, a deep learning-specific metric called "learning speed up" is also tracked. The performance results indicate the need to evaluate parallel deep learning execution in terms of learning speed up, and point to additional directions for improved exploitation of high-end HPC systems.

Yoginath, Srikanth↗

libEnsemble: A complete Python toolkit for dynamic ensembles of calculations

Almost all science and engineering applications eventually stop scaling: their runtime no longer decreases as available computational resources increase. Therefore, many applications will struggle to efficiently use emerging extreme-scale high-performance, parallel, and distributed systems. libEnsemble is a complete Python toolkit and workflow system for intelligently driving ensembles of experiments or simulations at massive scales. It enables and encourages multidisciplinary design, decision, and inference studies portably running on laptops, clusters, and supercomputers.

97 MATHEMATICS AND COMPUTING↗

Integrated Model, Batch and Domain Parallelism in Training Neural Networks

We propose a new integrated method of exploiting model, batch and domain parallelism for the training of deep neural networks (DNNs) on large distributed-memory computers using minibatch stochastic gradient descent (SGD). Our goal is to find an efficient parallelization strategy for a fixed batch size using $P$ processes. Our method is inspired by the communication-avoiding algorithms in numerical linear algebra. We see $P$ processes as logically divided into a $P_r \times P_c$ grid where the $P_r$ dimension is implicitly responsible for model/domain parallelism and the $P_c$ dimension is implicitly responsible for batch parallelism. In practice, the integrated matrix-based parallel algorithm encapsulates these types of parallelism automatically. We analyze the communication complexity and analytically demonstrate that the lowest communication costs are often achieved neither with pure model nor with pure data parallelism. We also show how the domain parallel approach can help in extending the theoretical scaling limit of the typical batch parallel method.

97 MATHEMATICS AND COMPUTING↗

DFT-FE 1.0: A massively parallel hybrid CPU-GPU density functional theory code using finite-element discretization

In this work, we present DFT-FE 1.0, building on DFT-FE 0.6 [Comput. Phys. Commun. 246, 106853 (2020)], to conduct fast and accurate large-scale density functional theory (DFT) calculations (reaching ~ 100,000 electrons) on both many-core CPU and hybrid CPU-GPU computing architectures. This work involves improvements in the real-space formulation—via an improved treatment of the electrostatic interactions that substantially enhances the computational efficiency—as well high-performance computing aspects, including the GPU acceleration of all the key compute kernels in DFT-FE. We demonstrate the accuracy by comparing the ground-state energies, ionic forces and cell stresses on a wide-range of benchmark systems against those obtained from widely used DFT codes. Further, we demonstrate the numerical efficiency of our implementation, which yields ~ 20× CPU-GPU speed-up by using GPU acceleration on hybrid CPU-GPU nodes. Notably, owing to the parallel-scaling of the GPU implementation, we obtain wall-times of 80–140 seconds for full ground-state calculations, with stringent accuracy, on benchmark systems containing ~ 6, 000 – 15,000 electrons.

pseudopotential↗

Strategies for Energy-Efficient Resource Management of Hybrid Programming Models

Many scientific applications are programmed using hybrid programming models that use both message passing and shared memory, due to the increasing prevalence of large-scale systems with multicore, multisocket nodes. Previous work has shown that energy efficiency can be improved using software-controlled execution schemes that consider both the programming model and the power-aware execution capabilities of the system. However, such approaches have focused on identifying optimal resource utilization for one programming model, either shared memory or message passing, in isolation. The potential solution space, thus the challenge, increases substantially when optimizing hybrid models since the possible resource configurations increase exponentially. Nonetheless, with the accelerating adoption of hybrid programming models, we increasingly need improved energy efficiency in hybrid parallel applications on large-scale systems. In this work, we present new software-controlled execution schemes that consider the effects of dynamic concurrency throttling (DCT) and dynamic voltage and frequency scaling (DVFS) in the context of hybrid programming models. Specifically, we present predictive models and novel algorithms based on statistical analysis that anticipate application power and time requirements under different concurrency and frequency configurations. Furthermore, we apply our models and methods to the NPB MZ benchmarks and selected applications from the ASC Sequoia codes. Overall, we achieve substantial energy savings (8.74 percent on average and up to 13.8 percent) with some performance gain (up to 7.5 percent) or negligible performance loss.

97 MATHEMATICS AND COMPUTING↗

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Transport of cosmic-ray protons in intermittent heliospheric turbulence: Model and simulations

The transport of charged energetic particles in the presence of strong intermittent heliospheric turbulence is computationally analyzed based on known properties of the interplanetary magnetic field and solar wind plasma at 1 astronomical unit. The turbulence is assumed to be static, composite, and quasi-three-dimensional with a varying energy distribution between a one-dimensional Alfvénic (slab) and a structured two-dimensional component. The spatial fluctuations of the turbulent magnetic field are modeled either as homogeneous with a Gaussian probability distribution function (PDF), or as intermittent on large and small scales with a q-Gaussian PDF. Simulations showed that energetic particle diffusion coefficients both parallel and perpendicular to the background magnetic field are significantly affected by intermittency in the turbulence. This effect is especially strong for parallel transport where for large-scale intermittency results show an extended phase of subdiffusive parallel transport during which cross-field transport diffusion dominates. The effects of intermittency are found to depend on particle rigidity and the fraction of slab energy in the turbulence, yielding a perpendicular to parallel mean free path ratio close to 1 for large-scale intermittency. Investigation of higher order transport moments (kurtosis) indicates that non-Gaussian statistical properties of the intermittent turbulent magnetic field are present in the parallel transport, especially for low rigidity particles at all times.

79 ASTRONOMY AND ASTROPHYSICS↗

Aspherical particle models for molecular dynamics simulation

In traditional molecular dynamics (MD) simulations, atoms and coarse-grained particles are modeled as point masses interacting via isotropic potentials. For studies where particle shape plays a vital role, more complex models are required. Here, we describe a spectrum of approaches for modeling aspherical particles, all of which are now available (some recently) as options within the LAMMPS MD package. Broadly these include two classes of models. In the first, individual particles are aspherical, either via a pairwise anisotropic potential which implicitly assigns a simple geometric shape to each particle, or in a more general way where particles store internal state which can explicitly define a complex geometric shape. In the second class of models, individual particles are simple points or spheres, but rigid body constraints are used to create composite aspherical particles in a variety of complex shapes. This work discusses parallel algorithms and associated data structures for both kinds of models, which enable dynamics simulations of aspherical particle systems across a wide range of length and time scales. We also highlight parallel performance and scalability and give a few illustrative examples of aspherical models in different contexts.

74 ATOMIC AND MOLECULAR PHYSICS↗

Parallel multiple-chain DRAM MCMC for large-scale geosteering inversion and uncertainty quantification

Geosteering is the proactive control of a wellbore placement based on the downhole measurements, aiming at maximizing economic production from the well. We report the recent development of azimuthal resistivity logging-whiledrilling (LWD) tools have a much larger depth of detection, thus sets higher demands for geosteering inversion as more unknown parameters need to be taken into account in the earth model to be inverted. For complicated nonlinear problems, traditional deterministic inversion methods are more likely to be trapped near local optima. In general, Markov chain Monte Carlo (MCMC) inversion methods are more capable of finding the global optimal solution and providing additional uncertainty analyses by sampling from the target distribution. However, MCMC methods usually have the problem of slow convergence. Even though optimization methods like delayed rejection (DR) and adaptive Metropolis (AM) were proposed to speed up the convergence, using MCMC methods to solve geosteering inversion problems may still incur unacceptable time cost. To reduce the sampling cost of MCMC methods, we use parallel multiple-chain DRAM MCMC methods to solve geosteering inverse problems and estimate the corresponding uncertainty. A clustering method, density-based spatial clustering of applications with noise (DBSCAN), is applied to select the best solution among many results. Lastly, the simulation results show that running many relatively short MCMC chains for one problem can obtain a similar result as running a long single chain. Besides, avoiding communications between multiple Markov chains during the sampling process yields almost linear scalability.

97 MATHEMATICS AND COMPUTING↗

Intrinsic rotation driven by the electrostatic turbulence in up-down asymmetric toroidal plasmas

The transport of parallel momentum by small scale fluctuations is intrinsically linked to symmetry breaking in the direction of the magnetic field. In tokamaks, an up-down asymmetry in the equilibrium proves to be an efficient parallel symmetry breaking mechanism leading to the generation of a net radial flux of parallel momentum by the electrostatic turbulence [Y. Camenen et al., Phys. Rev. Lett. 102, 125001 (2009)]. This flux is neither proportional to the toroidal rotation nor to its gradient and arises from an incomplete cancellation of the local contributions to the parallel momentum flux under the flux surface average. The flux of parallel momentum then depends on the asymmetry of the curvature drift and on the extension of the fluctuations around the low field side midplane. In this paper, the mechanisms underlying the generation of the flux of parallel momentum are highlighted and the main dependences on plasma parameters investigated using linear gyrokinetic simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scalable training of graph convolutional neural networks for fast and accurate predictions of HOMO-LUMO gap in molecules

Abstract Graph Convolutional Neural Network (GCNN) is a popular class of deep learning (DL) models in material science to predict material properties from the graph representation of molecular structures. Training an accurate and comprehensive GCNN surrogate for molecular design requires large-scale graph datasets and is usually a time-consuming process. Recent advances in GPUs and distributed computing open a path to reduce the computational cost for GCNN training effectively. However, efficient utilization of high performance computing (HPC) resources for training requires simultaneously optimizing large-scale data management and scalable stochastic batched optimization techniques. In this work, we focus on building GCNN models on HPC systems to predict material properties of millions of molecules. We use HydraGNN, our in-house library for large-scale GCNN training, leveraging distributed data parallelism in PyTorch. We use ADIOS, a high-performance data management framework for efficient storage and reading of large molecular graph data. We perform parallel training on two open-source large-scale graph datasets to build a GCNN predictor for an important quantum property known as the HOMO-LUMO gap. We measure the scalability, accuracy, and convergence of our approach on two DOE supercomputers: the Summit supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) and the Perlmutter system at the National Energy Research Scientific Computing Center (NERSC). We present our experimental results with HydraGNN showing (i) reduction of data loading time up to 4.2 times compared with a conventional method and (ii) linear scaling performance for training up to 1024 GPUs on both Summit and Perlmutter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

Machine Learning Assisted HPC Workload Trace Generation for Leadership Scale Storage Systems

Monitoring and analyzing a wide range of I/O activities in an HPC cluster is important in maintaining mission-critical performance in a large-scale, multi-user, parallel storage system. Center-wide I/O traces can provide high-level information and fine-grained activities per application or per user running in the system. Studying such large-scale traces can provide helpful insights into the system. It can be used to develop predictive methods for making predictive decisions, adjusting scheduling policies, or providing decisions for the design of next-generation systems. However, sharing real-world I/O traces to expedite such research efforts leaves a few concerns; i) the cost of sharing the large traces is expensive due to this large size, and ii) privacy concern is an issue.We address such issues by building an end-to-end machine learn- ing (ML) workflow that can generate I/O traces for large-scale HPC applications. We leverage ML based feature selection and gener- ative models for I/O trace generation. The generative models are trained on I/O traces collected by the darshan I/O characterization tool over a period of one year. We present a two-step generation process consisting of two deep-learning models, called the feature generator and the trace generator. The combination of two-step generative models provides robustness by reducing the bias of the model and accounting for the stochastic nature of the I/O traces across different runs of an application. We evaluate the performance of the generative models and show that the two-step model can generate time-series I/O traces with less than 20% root mean square error.

Paul, Arnab↗

Evidence of the ion cyclotron resonance at proton kinetic scales in the solar wind

The k-filtering and wave polarization techniques are applied to Cluster magnetic field data at four intervals of fast free (not connected to Earth's foreshock) solar wind. In addition to the commonly observed population of magnetic field fluctuations propagating at quasi-perpendicular angles to the global mean field B{sub 0}, a population of fluctuations propagating at quasi-parallel angles are also observed when no local plasma instability can be identified. At low wavenumbers (kv{sub A}/Ω{sub p} ≤ 0.6) both components are present, and have powers of similar strength, while at higher wavenumbers (kv{sub A}Ω{sub p} > 0.6) only the perpendicular component can be identified. Here v{sub A} and Ω{sub p} are the Alfvén speed and the proton (angular) gyration frequency, k denotes the wavenumber. The dispersion curve obtained (and the ratio of the magnitudes of left and right hand polarized fluctuations) shows a sharp transition (and decrease) at (kv{sub A}/Ω{sub p}) ∼ 0.6, which corresponds to a spacecraft frequency f {sub sc} = 0.32 Hz. At higher wavenumbers the measurements agree with previous studies indicating the presence of kinetic Alfvén wave (KAW) turbulence or a mixture of KAW turbulence and convected structures. The parallel component displays a scaling of k{sub ∥}{sup −δ} where the spectral index δ ranges between about 5/3 and 2 although the number of data points does not warrant an accurate determination. The origins of the observed parallel component are unclear. The presence of a parallel component is consistent with ion cyclotron waves, and we interpret the sharp drop of this component at higher wavenumbers as evidence that the ion cyclotron resonance is occurring in the solar wind intervals studied.

79 ASTRONOMY AND ASTROPHYSICS↗

Ion temperature and rotation fluctuation measurements with ultra-fast charge exchange recombination spectroscopy (UF-CHERS) in the DIII-D tokamak

An upgraded detector and several optimizations have significantly improved the Ultra-Fast Charge Exchange Recombination Spectroscopy (UF-CHERS) diagnostic sensitivity to ion temperature and parallel velocity fluctuations at turbulence relevant spatio-temporal scales. Normalized broadband ion temperature and parallel velocity fluctuations down to x̃x∼1% (x = Ti, v∥) and up to ∼450 kHz have been measured in a variety of plasmas. The multi-field nature of the CHERS technique also allows measurements of the cross-phase angles of the fluctuating fields. UF-CHERS is optimized to observe emissions from the electron exchange reaction between intrinsic C6+ and hydrogenic neutral beam injected particles near 529 nm. UF-CHERS consists of two chords separated by ∼1 cm radially, less than the turbulence correlation length in DIII-D plasmas, which enables correlated measurements to suppress incoherent electronic and photon noise. The optical components of the spectrometer include a volume-phase-holographic grating with >90% transmission between 528 and 530 nm and f/2 200-mm lenses, selected to maximize the optical efficiency and photon flux. Diffracted light from each chord is collected in eight spectral bins, each with a bandwidth of ∼0.25 nm, and detected and amplified by chilled avalanche photodiodes and custom high-gain, wide bandwidth low-noise preamplifiers to achieve the optimal signal-to-noise ratio. The resulting signals are digitized at 1 MHz, 103–104× faster than the conventional CHERS diagnostics. Spatial coverage is achieved by repositioning a motorized fiber tray between plasmas. UF-CHERS measurements will advance the understanding of turbulent ion transport and contribute to the validation of transport models and simulations.

Truong, D. D. (ORCID:0000000285732539)↗

Simulating Billion-Task Parallel Programs

In simulating large parallel systems, bottom-up approaches exercise detailed hardware models with effects from simplified software models or traces, whereas top-down approaches evaluate the timing and functionality of detailed software models over coarse hardware models. Here, we focus on the top-down approach and significantly advance the scale of the simulated parallel programs. Via the direct execution technique combined with parallel discrete event simulation, we stretch the limits of the top-down approach by simulating message passing interface (MPI) programs with millions of tasks. Using a timing-validated benchmark application, a proof-of-concept scaling level is achieved to over 0.22 billion virtual MPI processes on 216,000 cores of a Cray XT5 supercomputer, representing one of the largest direct execution simulations to date, combined with a multiplexing ratio of 1024 simulated tasks per real task.

Perumalla, Kalyan S↗