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 883 records · Page 49

Extreme Scaling of Production Visualization Software on Diverse Architectures

We present the results of a series of experiments studying how visualization software scales to massive data sets. Although several paradigms exist for processing large data, we focus on pure parallelism, the dominant approach for production software. These experiments utilized multiple visualization algorithms and were run on multiple architectures. Two types of experiments were performed. For the first, we examined performance at massive scale: 16,000 or more cores and one trillion or more cells. For the second, we studied weak scaling performance. These experiments were performed on the largest data set sizes published to date in visualization literature, and the findings on scaling characteristics and bottlenecks contribute to understanding of how pure parallelism will perform at high levels of concurrency and with very large data sets.

97 MATHEMATICS AND COMPUTING↗

Integration experiences and performance studies of A COTS parallel archive systems

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

99 GENERAL AND MISCELLANEOUS↗

Integration experiments and performance studies of a COTS parallel archive system

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

99 GENERAL AND MISCELLANEOUS↗

Simulation of Large-Scale HPC Architectures

The Extreme-scale Simulator (xSim) is a recently developed performance investigation toolkit that permits running high-performance computing (HPC) applications in a controlled environment with millions of concurrent execution threads. It allows observing parallel application performance properties in a simulated extreme-scale HPC system to further assist in HPC hardware and application software co-design on the road toward multi-petascale and exascale computing. This paper presents a newly implemented network model for the xSim performance investigation toolkit that is capable of providing simulation support for a variety of HPC network architectures with the appropriate trade-off between simulation scalability and accuracy. The taken approach focuses on a scalable distributed solution with latency and bandwidth restrictions for the simulated network. Different network architectures, such as star, ring, mesh, torus, twisted torus and tree, as well as hierarchical combinations, such as to simulate network-on-chip and network-on-node, are supported. Network traffic congestion modeling is omitted to gain simulation scalability by reducing simulation accuracy.

99 GENERAL AND MISCELLANEOUS↗

Optimizing High-Throughput Inference on Graph Neural Networks at Shared Computing Facilities with the NVIDIA Triton Inference Server

Abstract With machine learning applications now spanning a variety of computational tasks, multi-user shared computing facilities are devoting a rapidly increasing proportion of their resources to such algorithms. Graph neural networks (GNNs), for example, have provided astounding improvements in extracting complex signatures from data and are now widely used in a variety of applications, such as particle jet classification in high energy physics (HEP). However, GNNs also come with an enormous computational penalty that requires the use of GPUs to maintain reasonable throughput. At shared computing facilities, such as those used by physicists at Fermi National Accelerator Laboratory (Fermilab), methodical resource allocation and high throughput at the many-user scale are key to ensuring that resources are being used as efficiently as possible. These facilities, however, primarily provide CPU-only nodes, which proves detrimental to time-to-insight and computational throughput for workflows that include machine learning inference. In this work, we describe how a shared computing facility can use the NVIDIA Triton Inference Server to optimize its resource allocation and computing structure, recovering high throughput while scaling out to multiple users by massively parallelizing their machine learning inference. To demonstrate the effectiveness of this system in a realistic multi-user environment, we use the Fermilab Elastic Analysis Facility augmented with the Triton Inference Server to provide scalable and high-throughput access to a HEP-specific GNN and report on the outcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

HPC formulations of optimization algorithms for tensor completion

Tensor completion is a powerful tool used to estimate or recover missing values in multi-way data. It has seen great success in domains such as product recommendation and healthcare. Tensor completion is most often accomplished via low-rank sparse tensor factorization, a computationally expensive non-convex optimization problem which has only recently been studied in the context of parallel computing. In this work, we study three optimization algorithms that have been successfully applied to tensor completion: alternating least squares (ALS), stochastic gradient descent (SGD), and coordinate descent (CCD++). We explore opportunities for parallelism on shared- and distributed-memory systems and address challenges such as memory- and operation-efficiency, load balance, cache locality, and communication. Among our advancements are a communication-efficient CCD++ algorithm, an ALS algorithm rich in level-3 BLAS routines, and an SGD algorithm which combines stratification with asynchronous communication. Furthermore, we show that introducing randomization during ALS and CCD++ can accelerate convergence. We evaluate our parallel formulations on a variety of real datasets on a modern supercomputer and demonstrate speedups through 16384 cores. Further, these improvements reduce time-to-solution from hours to seconds on real-world datasets. We show that after our optimizations, ALS is advantageous on parallel systems of small-to-moderate scale, while both ALS and CCD++ provide the lowest time-to-solution on large-scale distributed systems.

97 MATHEMATICS AND COMPUTING↗

A Computational Approach for Modeling Neutron Scattering Data from Lipid Bilayers

Biological cell membranes are responsible for a range of structural and dynamical phenomena crucial to a cell's well-being and its associated functions. Due to the complexity of cell membranes, lipid bilayer systems are often used as biomimetic models. These systems have led to signficant insights into vital membrane phenomena such as domain formation, passive permeation and protein insertion. Experimental observations of membrane structure and dynamics are, however, limited in resolution, both spatially and temporally. Importantly, computer simulations are starting to play a more prominent role in interpreting experimental results, enabling a molecular under- standing of lipid membranes. Particularly, the synergy between scattering experiments and simulations offers opportunities for new discoveries in membrane physics, as the length and time scales probed by molecular dynamics (MD) simulations parallel those of experiments. We also describe a coarse-grained MD simulation approach that mimics neutron scattering data from large unilamellar lipid vesicles over a range of bilayer rigidity. Specfically, we simulate vesicle form factors and membrane thickness fluctuations determined from small angle neutron scattering (SANS) and neutron spin echo (NSE) experiments, respectively. Our simulations accurately reproduce trends from experiments and lay the groundwork for investigations of more complex membrane systems.

59 BASIC BIOLOGICAL SCIENCES↗

Charge shielding in magnetized plasmas

The shielding of a charge sheet in a magnetized plasma is investigated by taking account of the diamagnetic drift start-up current in addition to the polarization current. For a charge sheet with an infinitesimal width, the shielding is the same as the conventional Debye shielding if the charge sheet is perpendicular to the magnetic field; the shielding length is {radical}(2) times larger than the conventional one if the charge sheet is parallel to the magnetic field. When the scale length of the charge sheet is comparable or smaller than the ion Larmor radius, the electric field is significantly enhanced within the charge sheet, while far away from the charge sheet, the electric field is shielded to the usual 1/{epsilon}{sub r} level (where {epsilon}{sub r} is the diamagnetic coefficient of the magnetized plasma).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Six-flow operations for catalyst development in Fischer-Tropsch synthesis: Bridging the gap between high-throughput experimentation and extensive product evaluation

Design and operation of a “six-flow fixed-bed microreactor” setup for Fischer-Tropsch synthesis (FTS) is described. The unit consists of feed and mixing, flow division, reaction, separation, and analysis sections. The reactor system is made of five heating blocks with individual temperature controllers, assuring an identical isothermal zone of at least 10 cm along six fixed-bed microreactor inserts (4 mm inner diameter). Such a lab-scale setup allows running six experiments in parallel, under equal feed composition, reaction temperature, and conditions of separation and analysis equipment. It permits separate collection of wax and liquid samples (from each flow line), allowing operation with high productivities of C5+ hydrocarbons. The latter is crucial for a complete understanding of FTS product compositions and will represent an advantage over high-throughput setups with more than ten flows where such instrumental considerations lead to elevated equipment volume, cost, and operation complexity. The identical performance (of the six flows) under similar reaction conditions was assured by testing a same catalyst batch, loaded in all microreactors.

36 MATERIALS SCIENCE↗

Pulsed laser deposition of high-quality thin films of the insulating ferromagnet EuS

High-quality thin films of the ferromagnetic insulator europium(II) sulfide (EuS) were fabricated by pulsed laser deposition on Al{sub 2}O{sub 3} (0001) and Si (100) substrates. A single orientation was obtained with the [100] planes parallel to the substrates, with atomic-scale smoothness indicates a near-ideal surface topography. The films exhibit uniform ferromagnetism below 15.9 K, with a substantial component of the magnetization perpendicular to the plane of the films. Optimization of the growth condition also yielded truly insulating films with immeasurably large resistance. This combination of magnetic and electric properties opens the gate for future devices that require a true ferromagnetic insulator.

36 MATERIALS SCIENCE↗

Toroidal effect on runaway vortex and avalanche growth rate

The momentum-space dynamics of runaway electrons in a slab geometry, in terms of both the geometry and topological transition of the runaway vortex when synchrotron radiative damping is taking into account, have recently been shown to play a crucial role in runaway mitigation and avoidance. In a tokamak geometry, magnetic trapping arises from parallel motion along the magnetic field that scales as 1/R in strength with R the major radius. Since the transit time for a runaway electron moving along the field is of order 10 -8 sec while the collisional time is of ~ 0.01 sec in ITER-like plasmas, a bounce-averaged formulation can drastically reduce computational cost. Here the LAPS-RFP code’s implementation of a bounce-averaged relativistic Fokker- Planck model, along with the essential physics of synchrotron radiation damping and knock-on collisions, is described. It is found that the magnetic trapping can reduce the volume of the runaway vortex as the momentum-space fluxes are strongly modified inside the trapped-region. As a result, the avalanche growth rate is reduced at off-axis locations. In addition to benchmarking with previous calculations that did not take into account radiation damping, we also clarify how synchrotron radiation damping modifies the avalanche growth rate in a tokamak.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generation of kinetic Alfvén waves in dayside magnetopause reconnection: A 3-D global-scale hybrid simulation

In this paper, we perform a three-dimensional (3-D) global-scale hybrid simulation to investigate the generation of kinetic Alfvén waves (KAWs) in reconnection at the dayside magnetopause. In the simulation, the magnetopause reconnection takes place due to a self-consistent interaction between the solar wind and Earth's magnetosphere, in which the solar wind is assumed to carry a southward interplanetary magnetic field. As multiple X-line reconnection occurs, shear Alfvénic perturbations are generated from reconnection, which propagate toward polar regions along the magnetic field lines. Our detailed analysis of the electromagnetic characteristics reveals the existence of kinetic Alfvén waves on the ion kinetic scales in these perturbations, in which the parallel electric field is generated. The 3-D structures and the Poynting fluxes in the shear Alfvén waves/KAWs in the global magnetopause are presented. It is shown that these KAWs carry electromagnetic energy into the cusp, which may lead to aurora brightening.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Ultrathin two-dimensional superconductivity with strong spin–orbit coupling

Significance By studying epitaxially grown Pb thin films, this paper explores a new regime in the physics of uniform 2D superconductivity, in which the spin–orbit coupling-induced Rashba splitting is larger than the superconducting gap. The first quantitative determination of superfluid rigidity in nearly atomically thin 2D superconductors was performed using measurement that covers microscopic to macroscopic length scales to establish uniformity. The extraordinarily strong parallel critical fields were discovered, which is greatly in excess of the normal Clogston–Chandrasekhar limit. Moreover, this remarkable behavior is theoretically explained as a consequence of strong spin–orbit coupling in 2D superconductors that are uniform but in the dirty limit.

Nam, Hyoungdo↗

Cross-field electron diffusion due to the coupling of drift-driven microinstabilities

In this paper, the nonlinear interaction between kinetic instabilities driven by multiple ion beams and magnetized electrons is investigated. Electron diffusion across magnetic field lines is enhanced by the coupling of plasma instabilities. Here, a two-dimensional collisionless particle-in-cell simulation is performed accounting for singly and doubly charged ions in a cross-field configuration. Consistent with prior linear kinetic theory analysis and observations from coherent Thomson scattering experiments, the present simulations identify an ion-ion two-stream instability due to multiply charged ions (flowing in the direction parallel to the applied electric field) which coexists with the electron cyclotron drift instability (propagating perpendicular to the applied electric field and parallel to the ExB drift). Small-scale fluctuations due to the coupling of these naturally driven kinetic modes are found to be a mechanism that can enhance cross-field electron transport and contribute to the broadening of the ion velocity distribution functions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Trapped Electron Mode Turbulence Driven Intrinsic Rotation in Tokamak Plasmas

Progress from global gyrokinetic simulations in understanding the origin of intrinsic rotation in toroidal plasmas is reported. The turbulence-driven intrinsic torque associated with nonlinear residual stress generation due to zonal flow shear induced asymmetry in the parallel wave number spectrum is shown to scale close to linearly with plasma gradients and the inverse of the plasma current, qualitatively reproducing experimental empirical scalings of intrinsic rotation. The origin of current scaling is found to be enhanced k{sub ||} symmetry breaking induced by the increased radial variation of the safety factor as the current decreases. The intrinsic torque is proportional to the pressure gradient because both turbulence intensity and zonal flow shear, which are two key ingredients for driving residual stress, increase with turbulence drive, which is R/L{sub T{sub e}} and R/L{sub n{sub e}} for the trapped electron mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Distributed Memory Community Detection Using Vite

Graph clustering, popularly known as community detection, is a fundamental graph operation used in several applications of relevance for network analysis and cybersecurity. Community detection is an operation of partitioning a network into an arbitrary number of “communities” such that each com munity represents a tightly-knit group of nodes with relatively sparser connections to the rest of the nodes in the network. The need to compute clustering on large-scale networks necessitates the development of efficient parallel algorithms capable of exploiting modern parallel architectures. However, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the 2018 Graph Challenge, we present Vite which is a distributed-memory parallel community detection method. Vite is a parallelization of the algorithmic template provided by a widely-used serial method (Louvain). Alongside, it uses several heuristics aimed at significantly improving parallelism and performance, while preserving output quality. Using the inputs from the 2018 Graph Challenge (static and streaming), we demonstrate superior performance and high quality solutions based on four parallelization heuristics.

community detection↗

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

HACC: extreme scaling and performance across diverse architectures, In: SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Supercomputing is evolving towards hybrid and accelerator-based architectures with millions of cores. The HACC (Hardware/Hybrid Accelerated Cosmology Code) framework exploits this diverse landscape at the largest scales of problem size, obtaining high scalability and sustained performance. Developed to satisfy the science requirements of cosmological surveys, HACC melds particle and grid methods using a novel algorithmic structure that flexibly maps across architectures, including CPU/GPU, multi/many-core, and Blue Gene systems. We demonstrate the success of HACC on two very different machines, the CPU/GPU system Titan and the BG/Q systems Sequoia and Mira, attaining unprecedented levels of scalable performance. We demonstrate strong and weak scaling on Titan, obtaining up to 99.2% parallel efficiency, evolving 1.1 trillion particles. On Sequoia, we reach 13.94 PFlops (69.2% of peak) and 90% parallel efficiency on 1,572,864 cores, with 3.6 trillion particles, the largest cosmological benchmark yet performed. HACC design concepts are applicable to several other supercomputer applications.

Computer Science↗