Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallelization”

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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

1D model of SOL with self consistent calculation of non-coronalradiation and applications to shallow field line angles

A 1D model of the scrape off layer (SOL) is created with a physics based calculation of the impurity radiation and the inclusion of the perpendicular heat flux q ⊥ compared to previous 1D models. The calculation of the impurity radiation includes the addition of a model using parallel and perpendicular motion to calculate the impurity confinement time τ and the inclusion of charge exchange between neutral hydrogen and impurity ions. Reasonable agreement is found between the model and the 2D fluid code SOLPS-ITER. Additionally, an improvement is shown over the constant τ used in previous works The model is used to examine the effects of shallow field line angles at ITER levels of parallel heat flux (q || ). A large increase in radiation results in an increase in the upstream parallel heat flux which can still be in detachment at shallow field line angles for both q ⊥ and the calculated τ for traditional impurities (argon and nitrogen) as well as boron. The physics behind this increase in radiation at shallow field line angles is shown to be a decrease in τ and a change in the temperature profile with the inclusion of q ⊥ .

ITER↗
DOE OSTI2021

Substantial reduction of the anisotropy in the critical current densities J c of Ni-doped CaKFe 4 As 4 single crystals by chemical and irradiation-induced disorder

Here, we demonstrate that the anisotropy in the critical current densities, J c , of CaK(Fe 1–x Ni x ) 4 As 4 (x = 0, 0.015, 0.025, and 0.030) single crystals reduces with increasing chemical and irradiation-induced disorder. The magnetic field dependences of J c are analyzed by performing magnetization measurements with H applied parallel and perpendicular to the crystallographic c-axis. The results show that undoped crystals display large anisotropies in Jc due to an enhancement of the vortex pinning with H applied parallel to the crystallographic ab-planes. This anisotropy reduces substantially as Ni addition increases. Moreover, we found that random disorder introduced by proton irradiation enhances mainly the vortex pinning for H parallel to the c-axis. Consequently, using adequate fluencies, the vortex pinning at low temperatures in both undoped and doped samples becomes close to isotropic. These results make the CaKFe 4 As 4 system promising for applications that require isotropic J c under magnetic fields.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Staged cooling of a fusion-grade plasma in a tokamak thermal quench

Abstract In tokamak disruptions where the magnetic connection length becomes comparable to or even shorter than the plasma mean-free-path, parallel transport can dominate the energy loss and the thermal quench of the core plasma goes through four phases (stages) that have distinct temperature ranges and durations. The main temperature drop occurs while the core plasma remains nearly collisionless, with the parallel electron temperature T e ∥ dropping in time t as T e ∥ ∝ t − 2 and a cooling time that scales with the ion sound wave transit time over the length of the open magnetic field line. These surprising physics scalings are the result of effective suppression of parallel electron thermal conduction in an otherwise bounded, quasineutral, and collisionless plasma, which is different from what are known to date on electron thermal conduction along the magnetic field in a nearly collisionless and quasineural plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: N -body mock challenge for the quasar sample

ABSTRACT The growth rate and expansion history of the Universe can be measured from large galaxy redshift surveys using the Alcock–Paczynski effect. We validate the Redshift Space Distortion models used in the final analysis of the Sloan Digital Sky Survey (SDSS) extended Baryon Oscillation Spectroscopic Survey (eBOSS) Data Release 16 quasar clustering sample, in configuration and Fourier space, using a series of halo occupation distribution mock catalogues generated using the OuterRim N-body simulation. We test three models on a series of non-blind mocks, in the OuterRim cosmology, and blind mocks, which have been rescaled to new cosmologies, and investigate the effects of redshift smearing and catastrophic redshifts. We find that for the non-blind mocks, the models are able to recover fσ8 to within 3 per cent and α∥ and α⊥ to within 1 per cent. The scatter in the measurements is larger for the blind mocks, due to the assumption of an incorrect fiducial cosmology. From this mock challenge, we find that all three models perform well, with similar systematic errors on fσ8, α∥, and α⊥ at the level of $\sigma _{f\sigma _8}=0.013$, $\sigma _{\alpha _\parallel }=0.012$, and $\sigma _{\alpha _\bot }=0.008$. The systematic error on the combined consensus is $\sigma _{f\sigma _8}=0.011$, $\sigma _{\alpha _\parallel }=0.008$, and $\sigma _{\alpha _\bot }=0.005$, which is used in the final DR16 analysis. For baryon acoustic oscillation fits in configuration and Fourier space, we take conservative systematic errors of $\sigma _{\alpha _\parallel }=0.010$ and $\sigma _{\alpha _\bot }=0.007$.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Independence of the spin current from the Néel vector orientation in antiferromagnet CoO

Spin pumping from ferromagnetic Fe into antiferromagnetic CoO across a Ag spacer layer was studied using ferromagnetic resonance (FMR) in Py/CoO/Ag/Fe/Ag(001). The thin Py film on top of CoO permits an alignment of the CoO Neél vector through field cooling in two otherwise equivalent [110] and [110] crystalline axes which are parallel and perpendicular to the Fe magnetization direction, respectively. Fe FMR linewidth is measured as a function of Ag thickness in 10-20-GHz frequency range and in 180-330 K temperature range. Furthermore, we find that there exists an anisotropy in the Fe FMR damping for parallel and perpendicular alignment of the Fe and CoO spins. However, such anisotropic damping exists only at thin Ag thickness where there exists a magnetic interlayer coupling between Fe and CoO, and vanishes at thick Ag thickness where the interlayer coupling becomes negligible but permitting spin-current transmission into CoO. Our result indicates the absence of anisotropic spin current for parallel and perpendicular alignment of the Fe and CoO spin axes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Two-neutron knockout as a probe of the composition of states in Mg 22 , Al 23 , and Si 24

Simpson and Tostevin proposed that the width and shape of exclusive parallel momentum distributions of the A - 2 residue in direct two-nucleon knockout reactions carry a measurable sensitivity to the nucleon single-particle configurations and their couplings within the wave functions of exotic nuclei. We further report here on the first benchmarks and use of this new spectroscopic tool. Exclusive parallel momentum distributions for states in the neutron-deficient nuclei Mg 22 , Al 23 , and Si 24 populated in such direct two-neutron removal reactions were extracted and compared to predictions combining eikonal reaction theory and shell-model calculations. For the well-known Mg 22 and Al 23 nuclei, measurements and calculations were found to agree, supporting the dependence of the parallel momentum distribution width on the angular momentum composition of the shell-model two-neutron amplitudes. In Si 24 , a level at 3439(9) keV, of relevance for the important Al 23 ( p , γ ) Si 24 astrophysical reaction rate, was confirmed to be the 2 2 + state, whereas the 4 1 + state, expected to be strongly populated in two-neutron knockout, was not observed. This puzzle is resolved by theoretical considerations of the Thomas-Ehrman shift, which also indicates that a previously reported 3471-keV state in Si 24 is, in fact, the ( 0 2 + ) level with one of the largest experimental mirror-energy shifts ever observed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Quantum Overlapping Tomography

It is now experimentally possible to entangle thousands of qubits, and efficiently measure each qubit in parallel in a distinct basis. To fully characterize an unknown entangled state of $\textit{n}$ qubits, one requires an exponential number of measurements in $\textit{n}$, which is experimentally unfeasible even for modest system sizes. By leveraging (i) that single-qubit measurements can be made in parallel, and (ii) the theory of perfect hash families, we show that all $\textit{k}$-qubit reduced density matrices of an $\textit{n}$ qubit state can be determined with at most $e^{\mathcal{O}}(k) \text{log}^2(n)$ rounds of parallel measurements. In this work, we provide concrete measurement protocols which realize this bound. As an example, we argue that with near-term experiments, every two-point correlator in a system of 1024 qubits could be measured and completely characterized in a few days. This corresponds to determining nearly 4.5 million correlators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Characterization of a Pixelated Cadmium Telluride Detector System Using a Polychromatic X-Ray Source and Gold Nanoparticle-Loaded Phantoms for Benchtop X-Ray Fluorescence Imaging

In this paper, the imaging dose and scan time have been considered as the two major constraints for routine benchtop x-ray fluorescence computed tomography (XFCT) imaging. One way to address this issue is to acquire x-ray fluorescence (XRF) signals in parallel through a 2D array of single-crystal detectors or a pixelated detector along with the cone-beam x-ray source. To identify a detector system suitable for this purpose, a commercially available, fully spectroscopic cadmium telluride (CdTe) pixelated detector, HEXITEC (High-Energy X-ray Imaging Technology), was tested under the experimental conditions optimized for benchtop XFCT imaging of gold nanoparticles (GNPs). Specifically, two different parallel-hole stainless steel collimators were fabricated and coupled with the detector for seamless integration into our existing benchtop cone-beam XFCT system. After the detector deployment, this benchtop XFCT system was used to detect XRF photons from GNP-loaded phantoms. A pixel-merging algorithm was introduced to enhance the sensitivity of XRF photon detection thereby minimizing the scan time. The effect of pixel-level charge sharing correction algorithms was investigated within the context of benchtop XFCT imaging. The detector energy resolution, in terms of the full width at half maximum (FWHM) values at different gold K-shell XRF energies, was also determined. Of the two charge sharing correction algorithms examined, the charge sharing addition gave better sensitivity than the charge sharing discrimination (csd). On the other hand, under the current experimental conditions, the energy resolution of the HEXITEC detector was the best with the csd and estimated to be 1.56 keV FWHM at 66-69 keV photon energy. Overall, despite some degradation of the detector energy resolution (compared with typical single crystal CdTe detectors), the HEXITEC detector enabled parallel data acquisition under the experimental conditions typical of benchtop XFCT imaging and operated well within our benchtop XFCT setup.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗
DOE OSTI2024

Experimental Characterization Test of a Grid-Forming Inverter for Microgrid Applications

Standardized experimental testing protocols for grid forming (GFM) inverters to ensure expected operation under both normal and contingency conditions do not exist. Such protocols increase the confidence of system owner/operators that an inverter deployed in a proposed system will engage in typical behaviors to ensure interoperability with other units and ancillary equipment (e.g. protection equipment). This paper presents systematic and comprehensive test protocols to evaluate the performance of GFM inverters under the following operational configurations: islanded operation, heterogeneous islanded operation (parallel with a synchronous generator), grid-connected operation, and transition operation. A commercial GFM inverter is used to verify the test protocols and to understand the inverter's performance and functionalities. In particular, required configuration and tuning of the inverter will be explained in the full paper to enrich the testing protocol.

black start↗
DOE OSTI2022

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗
DOE OSTI2024

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗
DOE OSTI2024

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗
DOE OSTI2023

Invited Paper: Benchmarking and Optimizing Data Movement on Emerging Heterogeneous Architectures

As supercomputers evolve, nodes are continually increasing in complexity. As a result, each generation of parallel systems brings new performance challenges. For instance, on recent systems inter-node communication has outperformed inter-socket, resulting in poor performance of many node-aware communication optimizations. Communication optimizations are critical for the performance and scalability of parallel applications, but are dependent on the parallel architecture, which varies significantly among recent generations of supercomputers. Furthermore, this paper investigates the performance of various paths of data movement on recent generations of systems, and analyzes the increased complexity of communication, particularly on recent heterogeneous systems. The paper also introduces MPI Advance, a communication library that enables optimizations to be created based on benchmark analysis of each emerging system.

benchmarking↗
DOE OSTI2024

Pretraining Billion-Scale Geospatial Foundational Models on Frontier

As AI workloads increase in scope, generalization capability becomes challenging for small task-specific models and their demand for large amounts of labeled training samples increases. On the contrary, Foundation Models (FMs) are trained with internet-scale unlabeled data via self-supervised learning and have been shown to adapt to various tasks with minimal fine-tuning. Although large FMs have demonstrated significant impact in natural language processing and computer vision, efforts toward FMs for geospatial applications have been restricted to smaller size models, as pretraining larger models requires very large computing resources equipped with state-of-the-art hardware accelerators. Current satellite constellations collect 100+TBs of data a day, resulting in images that are billions of pixels and multimodal in nature. Such geospatial data poses unique challenges opening up new opportunities to develop FMs. We investigate billion scale FMs and HPC training profiles for geospatial applications by pretraining on publicly available data. We studied from end-to-end the performance and impact in the solution by scaling the model size. Our larger 3B parameter size model achieves up to 30% improvement in top1 scene classification accuracy when comparing a 100M parameter model. Moreover, we detail performance experiments on the Frontier supercomputer, America's first exascale system, where we study different model and data parallel approaches using PyTorch's Fully Sharded Data Parallel library. Specifically, we study variants of the Vision Transformer architecture (ViT), conducting performance analysis for ViT models with size up to 15B parameters. By discussing throughput and performance bottlenecks under different parallelism configurations, we offer insights on how to leverage such leadership-class HPC resources when developing large models for geospatial imagery applications.

Tsaris, Aristeidis (aris)↗
DOE OSTI2022

Accelerating Simulation for High-Fidelity PV Inverter System Reliability Assessment with High-Performance Computing

The overall cost of photovoltaic (PV) systems has shown a downward trend during the last decade; however, PV inverter failures account for the highest cost of operation and maintenance. To address this, reliability tools with powerful computation and better accuracy are required for the lifetime prediction and degradation evaluation of PV inverters. This paper proposes an event-driven parallel computing-based simulator. The proposed simulator applies high-performance computing techniques and other accessory optimization techniques-including cluster merging, adaptive model updates, and steady-state identification-to make reliability assessments for PV inverters under given input mission profiles and operating conditions with high efficiency and high fidelity. The main idea of the simulator and its workflow are introduced. Then, a demo PV inverter system simulator is implemented, and the speedup of the total simulations of the switching model reaches 123.03 times.

high-performance computing↗
DOE OSTI2020

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗
DOE OSTI2026

Scalable Computation of Topological Abstractions for Scalar Data

Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial and on single machines. This paper presents the state of the art in the scalable computation of topological abstractions on scalar data, in shared memory parallel on single machines, and in distributed memory parallel on multiple machines. We highlight results for set‐based, graph‐based and complex‐based abstractions and organize the state of the art based on this taxonomy. The paper identifies parallelization and distribution techniques common in topological algorithms and highlights further areas of interest with underdeveloped efforts.

97 MATHEMATICS AND COMPUTING↗