Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed 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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fully Kinetic Simulations of Proton-beam-driven Instabilities from Parker Solar Probe Observations

The expanding solar wind plasma ubiquitously exhibits anisotropic nonthermal particle velocity distributions. Typically, proton velocity distribution functions (VDFs) show the presence of a core and a field-aligned beam. Novel observations made by the Parker Solar Probe (PSP) in the innermost heliosphere have revealed new complex features in the proton VDFs, namely anisotropic beams that sometimes experience perpendicular diffusion. In this study, we use a 2.5D fully kinetic simulation to investigate the stability of proton VDFs with anisotropic beams observed by PSP. Our setup consists of a core and an anisotropic beam population that drift with respect to each other. This configuration triggers a proton beam instability from which nearly parallel fast magnetosonic modes develop. Our results demonstrate that before this instability reaches saturation, the waves resonantly interact with the beam protons, causing perpendicular heating at the expense of the parallel temperature.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Robust Decentralized Secondary Control Scheme for Inverter-based Power Networks

Inverter-dominated microgrids are quickly becoming a key building block of future power systems. They rely on centralized controllers that can provide reliability and resiliency in extreme events. Nonetheless, communication failures due to cyber-physical attacks or natural disasters can make autonomous operation of islanded microgrids challenging. This paper examines a unified decentralized secondary control scheme that is robust to inverter clock synchronization errors and can be seamlessly applied to grid-following or grid-forming control architectures. The proposed scheme overcomes the well-known stability problem that arises from parallel operation of local integral controllers. Theoretical guarantees for stability are provided along with criteria to appropriately tune the secondary control gains to achieve good frequency regulation performance while ensuring fair power sharing. The efficacy of our approach is demonstrated through simulations on a 5-bus microgrid with four grid-forming inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Emu v1.1

Emu is a particle-in-cell code for solving the neutrino quantum kinetic equations in 1, 2, or 3 spatial dimensions with arbitrary angular resolution in order to simulate neutrino flavor transformation in neutron star merger and core collapse supernova environments. Emu represents the neutrino distribution function as a set of particles, each of which represent a collection of neutrinos and antineutrinos with unique position and momentum. Each particle carries two density matrices to define the flavor state of the neutrinos and antineutrinos it represents. Emu includes the vacuum, matter, and neutrino self-interaction potentials. Emu calculates the self-interaction potential using PIC deposition and interpolation algorithms that efficiently compute the local number density and flux at particle locations. Emu is implemented in C++ and is based on the AMReX library for high-performance, block-structured adaptive mesh refinement. Emu is parallelized with MPI + OpenMP for CPUs and MPI + CUDA for GPUs.

Willcox, Donald↗
DOE OSTI2026

Direct Measurement of Diffusion Coefficients: Evidence for Diffusive Stochastic Heating in Collisionless Plasmas

Open questions in collisionless plasma dissipation can be addressed using space-based observations in different astrophysical environments, with implications for both astrophysical and laboratory plasma systems. We study a low-𝛽, highly imbalanced, sub-Alfvénic stream observed by Parker Solar Probe (PSP) to identify and distinguish between signatures of stochastic heating (SH) and resonant heating (RH) by parallel ion cyclotron waves (∥-ICWs). Prior work studying this stream [Trevor A. Bowen et al., Stochastic heating in the sub-Alfvénic solar wind, Phys. Rev. Lett. 135, 255201 (2025)] showed that the SH rate, accounting for intermittency, matched the amplitude of the local energy transfer (LET) rate, while the RH rate did not. This comparison relied on a number of assumptions regarding the nature of the diffusive process and the calculation of the LET rate. We introduce a novel technique of inverting the proton guiding center equation to empirically measure velocity-space diffusion coefficients using three-dimensional proton velocity distribution functions, from the ion electrostatic analyzer (the Solar Probe Analyzer for Ions) on PSP. Measured diffusion coefficients are used to determine phase-space heating rates, leading to a calculation of a fully kinetic heating rate independent of assumptions made in prior work. We show that scale-dependent analytic expressions for SH via noncoherent fluctuations match the empirical measurements from PSP data, provided that we account for intermittency in the heating calculation. In contrast, the derived heating rates for SH that accounts for the effects of the helicity barrier and heating rates for RH via ∥-ICWs do not peak in the same region of velocity space as the empirical measurements, nor do they reach the required magnitude. Our approach provides novel methodology to uniquely identify and constrain heating processes in collisionless plasmas and shows evidence of a Fokker-Planck-like diffusive process in the near-Sun solar wind.

Plasma kinetic theory↗
DOE OSTI2024

The data acquisition system of the LZ dark matter detector: FADR

The Data Acquisition System (DAQ) for the LUX-ZEPLIN (LZ) dark matter detector is described. The signals from 745 PMTs, distributed across three subsystems, are sampled with 100-MHz 32-channel digitizers (DDC-32s). A basic waveform analysis is carried out on the on-board Field Programmable Gate Arrays (FPGAs) to extract information about the observed scintillation and electroluminescence signals. This information is used to determine if the digitized waveforms should be preserved for offline analysis. The system is designed around the Kintex-7 FPGA. In addition to digitizing the PMT signals and providing basic event selection in real time, the flexibility provided by the use of FPGAs allows us to monitor the performance of the detector and the DAQ in parallel to normal data acquisition. Furthermore, the hardware and software/firmware of this FPGA-based Architecture for Data acquisition and Realtime monitoring (FADR) are discussed and performance measurements are described.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Ethylene Polymerizations Catalyzed by Fluorinated “Sandwich” Diimine-Nickel and Palladium Complexes

Nickel and palladium complexes bearing “sandwich” diimine ligands with perfluorinated aryl caps have been synthesized, characterized, and explored in ethylene polymerization reactions. The X-ray crystallographic analysis of the precatalysts 16 and 6b show differences from their non-fluorinated analogues 17 and 19, with the perfluorinated aryl caps centered precisely over the nickel and palladium centers which results in higher buried volumes of the metal centers relative to the non-fluorinated analogs. The sandwich diimine palladium complexes 5a and 5b containing perfluorinated aryl caps polymerize ethylene in a controlled fashion with activities that are substantially increased compared with their non-fluorinated analogues. Migratory insertion rates in relevant methyl ethylene complexes agree with activities exhibited in bulk polymerization experiments. DFT studies suggest that facility of ethylene rotation from its preferred orientation perpendicular to the Pd-alkyl bond into a parallel in-plane conformation contributes to the higher polymerization activity for 5b relative to 18a. For these palladium systems polymer molecular weights can be controlled via hydrogen addition (hydrogenolysis) which is unusual for late transition metal-catalyzed olefin polymerizations with no catalyst deactivation occurring. Sandwich diimine nickel complexes 6a and 6b with perfluorinated aryl caps show ethylene polymerization activities that are about half that of classical tetraisopropyl-substituted catalyst 2 but again are more active than the analogous nonfluorinated sandwich complexes. Ethylene polymerizations exhibit living behavior and branched ultra-high molecular weight polyethylenes (UHMWPEs) with very low molecular weight distributions (less than 1.1) are obtained. The activated nickel catalysts are stable in the absence of monomer and show good long-term stability at 25 °C.

36 MATERIALS SCIENCE↗
DOE OSTI2023

AI ATAC 1: An Evaluation of Prominent Commercial Malware Detectors

This work presents an evaluation of six prominent commercial endpoint malware detectors, a network malware detector, and a file-conviction algorithm from a cyber technology vendor. The evaluation was administered as the first of the Artificial I ntelligence Applications t o Autonomous Cybersecurity (AI ATAC) prize challenges, funded by / completed in service of the US Navy. The experiment employed 100K files (50/50% benign/malicious) with a stratified distribution of file types, including ~1K zero-day program executables (increasing experiment size two orders of magnitude over previous work). We present an evaluation process of delivering a file to a fresh virtual machine donning the detection technology, waiting 90s to allow static detection, then executing the file and waiting another period for dynamic detection; this allows greater fidelity in the observational data than previous experiments, in particular, resource and time-to-detection statistics. To execute all 800K trials (100K files × 8 tools), a software framework is designed to choreograph the experiment into an automated, time-synced, and reproducible workflow with substantial parallelization. Software with base classes for this framework are provided. A cost-benefit model was configured to integrate the tools’ detection statistics into a comparable quantity by simulating costs of use. This provides a ranking methodology for cyber competitions and a lens for reasoning about the varied statistical results. The results provide insights on state of commercial malware detection.

Bridges, Robert↗
DOE OSTI2020

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

True Load Balancing for Matricized Tensor Times Khatri-Rao Product

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Using Apptainer in a Pilot-based Distributed Workload

GlideinWMS is a pilot and pressure-based workload manager for distributed scientific computing. Many experiments like CMS and Fermilab’s Neutrino experiments use it to provision elastic clusters for their analysis and simulations, split into close to a million concurrent jobs. Most user jobs require containers, and the pilots use Apptainer to set up the desired platform. For the pilots that run as regular batch jobs, Apptainer is safer, lighter, and easier to use than other containerization solutions. Many images used by the pilots are expanded SIF images distributed via the CernVM-FS: this combination is very efficient. At Fermilab, for example, we store on GitHub Dockerfiles that mimic the platform in the worker nodes of local clusters. GitHub workflows build and push the images to Docker Hub, and a service periodically pulls and converts them to the expanded SIF images in the CernVM-FS, so the scientists can find a familiar environment everywhere. Apptainer has also been used to run services inside the pilot jobs, like benchmarks that characterize the worker node being used, or a Triton Inference Server that allows sharing a GPU with all the jobs that run in parallel on a node.

Mambelli, Marco [Fermilab] (ORCID:0000000294892681↗
DOE OSTI2020

Optimizing the Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems of Equations

The need to solve block tridiagonal systems with hundreds or thousands of right-hand sides for the same block tridiagonal matrix is common in a variety of disciplines. To meet this need, the Accelerated Recursive Doubling Algorithm was developed. After a right-hand side independent phase, the algorithm allows for the quick, online calculation of solutions for different right-hand sides. In this work, we present methods to optimize the Accelerated Recursive Doubling Algorithm in memory usage and computation time in a hybrid parallelization model. The right-hand side independent phase of the naïve implementation takes ≥ 11/3 the amount of memory required to store the tridiagonal matrix, while our implementation reduces the fraction to ≈ 5/3 . The right-hand side dependent phase of the naïve implementation takes ≥ 6 times the amount of memory required to store the right-hand side, while our implementation reduces the fraction to ≈ 3. The computation time for the independent phase is reduced to ≈ 2/3 times that of the naïve implementation, while the computation time for the dependent phase is reduced to ≈ 5/9 . With increasing numbers of shared-memory threads q on every distributed processing element, we have O(q) theoretical speedup.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Local Distortions and Metal–Semiconductor–Metal Transition in Quasi-One-Dimensional Nanowire Compounds AV 3 Q 3 O δ (A = K, Rb, Cs and Q = Se, Te)

Metal cluster compounds have garnered renewed interest in the search for novel superconductors and topological semimetals owing to structural instabilities of metal-cluster geometries and broken symmetries. Here we synthesized needle-like crystals of the V-cluster-based quasi-one-dimensional (Q1D) materials AV 3 Q 3 O δ (A = K, Rb, Cs, Q= Se, Te) which can also be viewed as being composed of parallel nanowires. We examine how changes in their average and local structure control their electronic properties. All compounds crystallize in the TIFe 3 Te 3 -type structure (P6 3 /m space group) with infinite (V 3 )Q 3 ) - double-walled columnar chains separated by A + cations. Our single-crystal and synchrotron powder diffraction studies indicate oxygen atoms partially occupy the center site of the V 6 octahedral metal cluster cages in KV 3 Te 3 O 0.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 , whereas KV 3 Se 3 is structurally oxygen-free. Our synchrotron X-ray pair distribution function (PDF) analyses indicate that the oxygen-free V 6 cluster octahedra in KV 3 Se 3 are highly distorted perpendicular to the chain direction even at room temperature, reducing the symmetry of the average structure from hexagonal P6 3 /m to monoclinic P2 1 /m. Our theoretical calculation supports this P2 1 /m distortion and suggests the structure further distorts to P2 1 or P2 1 /c at lower temperatures. In contrast, the oxygen-centered V-cluster in KV 3 Te 3 O 0.33 exhibits a V-3-triangle-trimerization along the chain direction. This feature is discernible from the local PDF and is consistent with lattice dynamical calculations based on density functional theory. Resistivity measurements indicate that KV 3 Se 3 exhibits metallic behavior, whereas a dramatic metal-semiconductor-metal transition emerges in KV 3 Te 3 O 6.33 , RbV 3 Te 3 O 0.32 , and CsV 3 Te 3 O 0.35 because of oxygen disorder and changes in local structure captured from our electronic structure analyses of the Fermi surface. Our investigation of the AV 3 Q 3 O 6 family demonstrates the importance of understanding local changes in structure driven by electronic instabilities, which can guide the search for new quantum materials in other low-dimensional cluster-compound materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

How the Size and Density of Charge-Transfer Excitons Depend on Heterojunction’s Architecture

We have characterized the size, intensity, density, and distribution of charge-transfer (CT) excitons as a function of the acceptor–donor architecture of prototypical organic interfaces. This characterization was done by computational analysis of 17 models of varying numbers, positions, and orientations of the donor and acceptor molecules. The models’ building blocks were phenyl-C61-butyric acid methyl ester (PCBM) fullerene acceptors and dual-band donor polymers composed of thiophene, benzothiadiazole, and benzotriazole subunits. The electronic structure of the donor–acceptor complexes was computed with the time-dependent long-range-corrected density-functional tight-binding method and analyzed with the fragment-based one-electron transition density matrix. In all models, the complexes with edge-on orientation have denser spectra of low-energy CT states lying below the absorption bands compared to the complexes with face-on orientation. This CT-state distribution in edge-on complexes provides a gate to efficiently populate cold CT excitons. Moreover, the cold CT excitons have a higher degree of charge separation in the edge-on than in the face-on complexes. The CT amount and the CT exciton size generally increase with the energy of the CT states, although the electron remains localized on a single molecule in cold CT states. Delocalization over two PCBM molecules was observed for high-energy CT states. The exciton size also depends on the orientation. Larger excitons are produced by the delocalization of the electrons perpendicularly to the interface. When the delocalization is parallel, the smaller electron–hole distances yield moderately sized CT excitons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗
DOE OSTI2023

HEPnOS: a Specialized Data Service for High Energy Physics Analysis

In this paper, we present HEPnOS, a distributed data service for managing data produced by high-energy physics (HEP) experiments. Using HEPnOS, HEP applications can use HPC resources more effciently than traditional fle-based applications. The fle-based model leads to a rigid, chunk-based allocation of computational resources and limits the number of cores that can be used concurrently by an HEP application. The fundamental problem is that organizing domain-specifc data into fles inadvertently introduces a single, artifcial, confated tuning parameter that puts key optimization goals into confict: larger fle sizes reduce metadata overhead and thus improve I/O effciency, but smaller fle sizes provide more opportunity for workfow parallelism and load balancing. In this work, we introduce a domain-specifc data service that decouples that constraint so that data can be accessed and processed in its natural granularity while still maintaining I/O effciency. By removing the constraints introduced by fle handling we are able to obtain better scaling and make effcient use of more cores for processing a fxed-sized data sample. We demonstrate the improved scalability by using an application developed in the fle-based paradigm and comparing it to a version modifed to use HEPnOS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

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↗
DOE OSTI2021

dc electrical conductivity in strongly magnetized plasmas

A generalized Ohm's law is derived to treat strongly magnetized plasmas in which the electron gyrofrequency significantly exceeds the electron plasma frequency. Here, strong magnetization of electrons causes the frictional drag between electrons and ions due to Coulomb collisions to shift, producing an additional transverse resistivity term in the generalized Ohm's law that is perpendicular to both the current ($J$) and the Hall ($JxB$) direction. In the limit of very strong magnetization the parallel resistivity is found to increase by a factor of 3/2, and the perpendicular resistivity by a factor of $\frac{3}{4} \ln (m_i/m_e)$, where $m_i$ and $m_e$ are the ion and electron masses. These results suggest that strong magnetization significantly changes the magnetohydrodynamic evolution of a plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗