Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelization efficiency”

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 1,045 records · Page 58

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

JBlulce Data Acquisition Software for Macromolecular Crystallography

JBlulce (Java Beam Line Universal Integrated Configuration Environment is a data acquisition software for macromolecular crystallography conforming user interface of the SSRL Blulce that has become a de-factor standard in the field. Besides this interface conformity, JBlulce is a unique system in terms of architecture, spec, capability and software implementation. It features only two software layers, the JBlulce clients and the EPICS servers, as compared to three layers present in Blulce and most of similar systems. This layers reduction provides a faster communication with hardware and an easier access to advanced hardware capabilities like on-the-fly scanning. Then JBlulce clients are designed to operate in parallel with the other beamline controls which streamlines the tasks performed by staff such as beamline preparation, maintenance, auditing and user assistance. Another distinction is the deployment of multiple plugins that can be written in any programming language thus involving more staff into the development. further on, JBlulce makes use of unified motion controls allowing for easy scanning and optimizing of any beamline component. Finally, the graphic interface is implemented in Java making full use of rich Java libraries and Jave IDE for debugging. to compare, Blulce user interface is implemented with aging Tcl/tk language providing very restricted capabilities. JBlulce makes full use of the industrial power and wide drivers selection of EPICS in controlling hardware; all hardware communication is routed via multiple EPICS servers residing on local area network. JBlulce also includes several EPICS State Notation servers aimed at making hardware communication more robust. Besides using EPICS for controlling hardware, JBlulce extensively uses EPICS databases for efficient communications between multiple instances of JBlulce clients and JBlulce plugins that can run in parallel on different computers. All of the above makes JBlulce one of the biggest and most sophisticated EPICS client projects to date. JBlulce configuration is stored in my SQL database which provides flexibility in tuning the system. The database is also accessible by the plugins. From the users perspective JBlulce provides all standard features of data acquisition software for macromolecular crystallography plus such unique capabilities as one click beamline energy change that may involve switching undulator harmonics, mirrors lanes and beam realignment, automated diffraction rtastering for finding small crystals and sweet spots on poorly diffracting crystals with automated scoring of raster cells by the number of reflections; data collection along a vector; automated on-the-fly fluorescent tastering, a faster and lower-irradiation compliment to the diffraction raster; fully automated fluorescence measurements for MAD that include signal optimization, fast on the fly energy scanning and automated adapting of scan range to chemical shifts; fly-scan minibeam realignment; automated loop and crystal centering, controls for sample automounter, automated screening, data collection auditing, remote access and a lot more.

Stepanov, Sergey↗

Data processing methods and data acquisition for samples larger than the field of view in parallel-beam tomography

Parallel-beam tomography systems at synchrotron facilities have limited field of view (FOV) determined by the available beam size and detector system coverage. Scanning the full size of samples bigger than the FOV requires various data acquisition schemes such as grid scan, 360-degree scan with offset center-of-rotation (COR), helical scan, or combinations of these schemes. Though straightforward to implement, these scanning techniques have not often been used due to the lack of software and methods to process such types of data in an easy and automated fashion. The ease of use and automation is critical at synchrotron facilities where using visual inspection in data processing steps such as image stitching, COR determination, or helical data conversion is impractical due to the large size of datasets. Here, we provide methods and their implementations in a Python package, named Algotom, for not only processing such data types but also with the highest quality possible. The efficiency and ease of use of these tools can help to extend applications of parallel-beam tomography systems.

36 MATERIALS SCIENCE↗

Molecular Reaction Imaging of a Surface Recombination Process Explains Performance Variation Among Smooth MoS 2 Photoelectrodes

Transition metal dichalcogenides (TMD) such as WSe 2 and MoS 2 are highly efficient and stable light absorbers in TMD∣I − ,I 3 − ∣Pt liquid junction solar cells. It is generally accepted that TMD crystals with a large fraction of exposed edge sites exhibit lower power conversion efficiencies (PCEs) than apparently smooth crystals. However, one open question is why does the PCE vary significantly from one crystal to another? Answering this critical question could lead to robust syntheses for high quality and uniform TMD samples. In this work, we apply nanoscale photoelectrochemical microscopy techniques to study n-type TMD nanoflake∣I − ,I 3 − ∣Pt cells. Using a combination of near-diffraction-limited photocurrent mapping and molecular reaction imaging techniques, we reveal a previously hidden surface recombination process: photogenerated holes in hidden p-type domains travel micron-scale distances parallel to the solid/liquid interface and preferentially react with iodide at step-edges. The overall efficiency of the nanoflake, as evidenced from whole nanoflake-level photoelectrochemical measurements, is dictated by the size, efficiency, and location of n- and p-type domains. Furthermore, these results provide a unifying view of efficiency losses in smooth TMD photoelectrodes and open the possibility to design electrode architectures that leverage the long-range lateral charge transport property for photoelectrocatalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first showthat the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.

97 MATHEMATICS AND COMPUTING↗

Scaling Up Data-Parallel Analytics Platforms: Linear Algebraic Operation Cases

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are key to supporting large scale data analysis that require efficient processing over millions of data samples. To this end, we present, ARION, a hardware acceleration based approach for scaling-up individual tasks of Spark, a popular data-parallel analytics platform. We support both linear algebraic operations of between two dense matrices, and between sparse and dense matrices in distributed environments. ARION provides a flexible control of acceleration according to matrix density, along with efficient scheduling based on runtime resource utilization. We demonstrate the benefit of our approach for general matrix multiplication operations over large matrices with up to four billion elements by using Gramian matrix computation that is commonly used in machine learning. Experiments show that our approach achieves more than 2× and 1.5× end-to-end performance speedups for dense and sparse matrices, respectively, and up to 57.04× faster computation compared to MLlib, a state of the art Spark-based implementation. This work is sponsored in part by the NSF under the grants: CNS-1565314, CNS-1405697, and CNS-1615411. The manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-00OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan). This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725.

Xu, Luna↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

BurstMem: A high-performance burst buffer system for scientific applications

The growth of computing power on large-scale systems requires commensurate high-bandwidth I/O systems. Many parallel file systems are designed to provide fast sustainable I/O in response to applications' soaring requirements. To meet this need, a novel system is imperative to temporarily buffer the bursty I/O and gradually flush datasets to long-term parallel file systems. In this paper, we introduce the design of BurstMem, a high-performance burst buffer system. BurstMem provides a storage framework with efficient storage and communication management strategies. Our experiments demonstrate that BurstMem is able to speed up the I/O performance of scientific applications by up to 8.5× on leadership computer systems.

Wang, Teng↗

A high-efficiency spin-resolved photoemission spectrometer combining time-of-flight spectroscopy with exchange-scattering polarimetry

We describe a spin-resolved electron spectrometer capable of uniquely efficient and high energy resolution measurements. Spin analysis is obtained through polarimetry based on low-energy exchange scattering from a ferromagnetic thin-film target. This approach can achieve a similar analyzing power (Sherman function) as state-of-the-art Mott scattering polarimeters, but with as much as 100 times improved efficiency due to increased reflectivity. Performance is further enhanced by integrating the polarimeter into a time-of-flight (TOF) based energy analysis scheme with a precise and flexible electrostatic lens system. The parallel acquisition of a range of electron kinetic energies afforded by the TOF approach results in an order of magnitude (or more) increase in efficiency compared to hemispherical analyzers. The lens system additionally features a 90 degrees bandpass filter, which by removing unwanted parts of the photoelectron distribution allows the TOF technique to be performed at low electron drift energy and high energy resolution within a wide range of experimental parameters. The spectrometer is ideally suited for high-resolution spin- and angle-resolved photoemission spectroscopy (spin-ARPES), and initial results are shown. The TOF approach makes the spectrometer especially ideal for time-resolved spin-ARPES experiments.

36 MATERIALS SCIENCE↗

Optimizing Distributed Training on Frontier for Large Language Models

Large language models (LLMs) have demonstrated remarkable success as foundational models, benefiting various downstream applications through fine-tuning. Loss scaling studies have demonstrated the superior performance of larger LLMs compared to their smaller counterparts. Nevertheless, training LLMs with billions of parameters poses significant challenges and requires considerable computational resources. For example, training a one trillion parameter GPT-style model on 20 trillion tokens requires a staggering 120 million exaflops. This research explores efficient distributed training strategies to extract this computation from Frontier, the world's first exascale supercomputer. We enable and investigate various model and data parallel training techniques, such as tensor parallelism, pipeline parallelism, and sharded data parallelism, to facilitate training a trillion-parameter model on Frontier. We empirically assess these techniques and their associated parameters to determine their impact on memory footprint, communication latency, and GPU's computational efficiency. We analyze the complex interplay among these techniques and find a strategy to combine them to achieve high throughput through hyperparameter tuning. We have identified efficient strategies for training large LLMs of varying sizes through empirical analysis and hyperparameter tuning. For 22 Billion, 175 Billion, and 1 Trillion parameters, we achieved GPU throughputs of 38.38%, 36.14%, and 31.96%, respectively. For the training of the 175 Billion parameter model and the 1 Trillion parameter model, we achieved 100% weak scaling efficiency on 1024 and 3072 Mi250X GPUs, respectively. We also achieved strong scaling efficiencies of 89% and 87% for these two models. We trained these models only tens of iterations instead of training till completion.

Yin, Junqi↗

Task parallel sensitivity analysis and parameter estimation of groundwater simulations through the SALSSA framework

The Support Architecture for Large-Scale Subsurface Analysis (SALSSA) provides an extensible framework, sophisticated graphical user interface, and underlying data management system that simplifies the process of running subsurface models, tracking provenance information, and analyzing the model results. Initially, SALSSA supported two styles of job control: user directed execution and monitoring of individual jobs, and load balancing of jobs across multiple machines taking advantage of many available workstations. Recent efforts in subsurface modelling have been directed at advancing simulators to take advantage of leadership class supercomputers. We describe two approaches, current progress, and plans toward enabling efficient application of the subsurface simulator codes via the SALSSA framework: automating sensitivity analysis problems through task parallelism, and task parallel parameter estimation using the PEST framework.

99 GENERAL AND MISCELLANEOUS↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

Anisotropic Thermally Conductive Composites Enabled by Acoustophoresis and Stereolithography

Opportunities to improve thermal management in electronic devices are currently hindered by processing constraints that limit thermal conductivity in polymer-matrix composites. Active patterning of filler particles is a promising route to improve conductivity while retaining processability by improving particle contact density and directing heat along optimized pathways. Here, we employ acoustic patterning to align and compact filler particles into stripes during stereolithographic 3D printing. This approach produces polymer-based composite materials with highly efficient embedded heat transport pathways which reach 95 vol% particle utilization (relative to the parallel conduction upper limit). These composites exhibit anisotropic thermal conductivity up to 300% higher than unpatterned composites, with in-plane anisotropy ratios of up to 350%. Combining this high conductivity with 3D printing enables materials with engineered heat networks that optimize transport from hot spots to heatsinks while maintaining low viscosity for fast particle patterning and for infiltration around electronic components. Finally, numerical simulations of acoustic assembly of particles with varied geometry, when compared to experimentally characterized particle packing, illuminate pathways for further improving conductivity by optimizing particle geometry for alignment and stacking of particles with maximum contact surface area.

36 MATERIALS SCIENCE↗

Impact of media and antifoam selection on monoclonal antibody production and quality using a high throughput micro-bioreactor system

Monoclonal antibody production in commercial scale cell culture bioprocessing requires a thorough understanding of the engineering process and components used throughout manufacturing. It is important to identify high impact components early on during the lifecycle of a biotechnology-derived product. While cell culture media selection is of obvious importance to the health and productivity of mammalian bioreactor operations, other components such as antifoam selection can also play an important role in bioreactor cell culture. Silicone polymer-based antifoams were known to have negative impacts on cell health, production, and downstream filtration and purification operations. High throughput screening in micro-scale bioreactors provides an efficient strategy to identify initial operating parameters. Here, we utilized a micro-scale parallel bioreactor system to study an IgG1 producing CHO cell line, to screen Dynamis, ProCHO5, PowerCHO2, EX-Cell Advanced, and OptiCHO media, and 204, C, EX-Cell, SE-15, and Y-30 antifoams and their impacts on IgG1 production, cell growth, aggregation, and process control. This study found ProCHO5, EX-Cell Advanced, and PowerCHO2 media supported strong cellular growth profiles, with an IVCD of 25-35 3 106 cells-d/ mL, while maintaining specific antibody production (Qp> 2 pg/cell-d) for our model cell line and a monomer percentage above 94%. Antifoams C, EX-Cell, and SE-15 were capable of providing adequate control of foaming while antifoam 204 and Y-30 noticeably stunted cellular growth. This work highlights the utility of high throughput micro bioreactors and the importance of identifying both positive and negative impacts of media and antifoam selection on a model IgG1 producing CHO cell line.

59 BASIC BIOLOGICAL SCIENCES↗

An Efficient Algorithm for Mapping Imaging Data to 3D Unstructured Grids in Computational Biomechanics

Geometries for organ scale and multiscale simulations of organ function are now routinely derived from imaging data. However, medical images may also contain spatially heterogeneous information other than geometry that are relevant to such simulations either as initial conditions or in the form of model parameters. In this manuscript, we present an algorithm for the efficient and robust mapping of such data to imaging based unstructured polyhedral grids in parallel. We then illustrate the application of our mapping algorithm to three different mapping problems: 1) the mapping of MRI diffusion tensor data to an unstuctured ventricular grid; 2) the mapping of serial cyro-section histology data to an unstructured mouse brain grid; and 3) the mapping of CT-derived volumetric strain data to an unstructured multiscale lung grid. Execution times and parallel performance are reported for each case.

Einstein, Daniel R.↗

A non-cooperative meta-modeling game for automated third-party calibrating, validating and falsifying constitutive laws with parallelized adversarial attacks

The evaluation of constitutive models, especially for high-risk and high-regret engineering applications, requires efficient and rigorous third-party calibration, validation and falsification. While there are numerous efforts to develop paradigms and standard procedures to validate models, difficulties may arise due to the sequential, manual, and often biased nature of the commonly adopted calibration and validation processes, thus slowing down data collections, hampering the progress towards discovering new physics, increasing expenses and possibly leading to misinterpretations of the credibility and application ranges of proposed models. This work attempts to introduce concepts from game theory and machine learning techniques to overcome many of these existing difficulties. Here, we introduce an automated meta-modeling game where two competing AI agents systematically generate experimental data to calibrate a given constitutive model and to explore its weakness such that the experiment design and model robustness can be improved through competitions. The two agents automatically search for the Nash equilibrium of the meta-modeling game in an adversarial reinforcement learning framework without human intervention. In particular, a protagonist agent seeks to find the more effective ways to generate data for model calibrations, while an adversary agent tries to find the most devastating test scenarios that expose the weaknesses of the constitutive model calibrated by the protagonist. By capturing all possible design options of the laboratory experiments into a single decision tree, we recast the design of experiments as a game of combinatorial moves that can be resolved through deep reinforcement learning by the two competing players. Our adversarial framework emulates idealized scientific collaborations and competitions among researchers to achieve a better understanding of the application range of the learned material laws and prevent misinterpretations caused by conventional AI-based third-party validation. Numerical examples are given to demonstrate the wide applicability of the proposed meta-modeling game with adversarial attacks on both human-crafted constitutive models and machine learning models.

97 MATHEMATICS AND COMPUTING↗

Jacobian-free Newton–Krylov method for the simulation of non-thermal plasma discharges with high-order time integration and physics-based preconditioning

A preconditioning framework for the numerical simulation of non-thermal streamer discharges is developed using the Jacobian-free Newton-Krylov (JFNK) method. A reduced plasma fluid model is considered, consisting of electrons, one positive ion, one negative ion, and the electrostatic potential. Here, the plasma kinetics model includes ionization, electron-ion recombination, electron attachment, electron detachment, and ion-ion recombination. The governing equations are made dimensionless, discretized in space with finite differences, and integrated in time with a fully implicit method based on high-order backward differentiation formulas. The preconditioning framework is based on a linearized form of the governing equations and physics-based operator splitting. The efficiency of the preconditioning strategy is assessed through two test cases: streamer propagation between parallel plates and an axisymmetric pin-to-pin discharge. The fully implicit approach overcomes traditional restrictions in the time step size due to processes such as electron drift, electron diffusion, and dielectric relaxation. Excellent performance is observed through relevant statistics of the JFNK solver, although the number of linear iterations increases for the pin-to-pin discharge when nonlinear numerical boundary conditions are imposed at the electrodes. Performance studies show scalability with O(100-1000) processors for O(10M) unknowns with ample room for optimization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗