Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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 613 records · Page 34

WE-AB-BRB-09: Real Time In Vivo Scintillating Fiber Array Detector for Medical LINACS

Purpose: An in vivo transmission scintillation fiber detector was developed to monitor patient treatment in real time for the enhancement of patient safety and treatment accuracy. The detector system is capable of monitoring each pulse from a medical LINAC during treatment to determine the dose delivered as treatment progresses. Methods: The detector system consists of 60 parallel scintillating fibers coupled to fast data processing optoelectronics that can monitor the beam fluence in real time. Each 2.5mm{sup 2} square fiber is aligned with an MLC leaf pair and is long enough to capture a 40cm field. The fibers are embedded within a water equivalent polymer substrate that is secured in the LINAC accessory tray. The fibers are coupled to high speed photosensors and front end amplifiers that filter noise and pass each pulse to a high speed analog-to-digital converter. The system components are capable of detecting pulse repetition times shorter than what is delivered by a medical LINAC to ensure true real time data acquisition. Results: The system was able to capture and record the signal from each linac pulse and display the information in real time with no pulse pile up. It was found that the fiber array attenuates 2.65% of the beam which can easily be compensated for in treatment planning. The fibers responded linearly with dose, are independent of clinical beam energies, and are independent of dose rate. Calibration of the system was performed as a function of beam energy, beam size, dose rate, and monitor units to optimize beam fluence error detection. Conclusion: The detector system presented provides true real time in vivo beam monitoring to enhance patient safety and treatment delivery accuracy. Furthermore, the detector can be used for current patient specific QA.

60 APPLIED LIFE SCIENCES↗

Advances in global optimization of high brightness beams

High brightness electron beams play an important role in accelerator-based applications such as driving X-ray free electron laser (FEL) radiation.Here in this paper, we report on advances in global beam dynamics optimization of an accelerator design using start-to-end simulations and a new parallel multi-objective differential evolution optimization method. The global optimization results in significant improvement of the final electron beam brightness.

43 PARTICLE ACCELERATORS↗

Distributed Cross-Channel Hierarchical Aggregation for Foundation Models

Vision-based scientific foundation models hold significant promise for advancing scientific discovery and innovation. This potential stems from their ability to aggregate images from diverse sources—such as varying physical groundings or data acquisition systems—and to learn spatio-temporal correlations using transformer architectures. However, tokenizing and aggregating images can be compute-intensive, a challenge not fully addressed by current distributed methods. In this work, we introduce the Distributed Cross-Channel Hierarchical Aggregation (D-CHAG) approach designed for datasets with a large number of channels across image modalities. Our method is compatible with any model-parallel strategy and any type of vision transformer architecture, significantly improving computational efficiency. We evaluated D-CHAG on hyperspectral imaging and weather forecasting tasks. When integrated with tensor parallelism and model sharding, our approach achieved up to a 75% reduction in memory usage and more than doubled sustained throughput on up to 1,024 AMD GPUs on the Frontier Supercomputer.

Tsaris, Aristeidis (aris) [ORNL] (ORCID:0000000277↗

Tacho

SAND2022-7470 O Tacho is a performance portable sparse direct solver for use with various sparse matrix problems which typically arise from finite element methods. The code relies on the Kokkos parallel programming model porting to both CPUs and GPUs. It is also part of the Trilinos library. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Kim, Kyungjoo↗

Recommendations for the generation, quantification, storage and handling of peptides used for mass spectrometry-based assays

The Clinical Proteomic Tumor Analysis Consortium (1) (CPTAC) of the National Cancer Institute (NCI) is a comprehensive and coordinated effort to accelerate the understanding of the molecular basis of cancer through the application of robust technologies and workflows for the quantitative measurements of proteins. The Assay Development Working Group of the CPTAC Program aims to foster broad uptake of targeted mass spectrometry-based assays employing isotopically labeled peptides for confident assignment and quantification, including multiple reaction monitoring (MRM; also referred to as Selected Reaction Monitoring), parallel reaction monitoring (PRM), and other targeted methods.

Environmental Molecular Sciences Laboratory↗

Deep learning for electron and scanning probe microscopy: From materials design to atomic fabrication

Machine learning and artificial intelligence (ML/AI) are rapidly becoming an indispensable part of physics research, with applications ranging from theory and materials prediction to high-throughput data analysis. In parallel, the recent successes in applying ML/AI methods for autonomous systems from robotics through self-driving cars to organic and inorganic synthesis are generating enthusiasm for the potential of these techniques to enable automated and autonomous experiment in imaging. Here, we discuss recent progress in application of machine learning methods in scanning transmission electron microscopy and scanning probe microscopy, from applications such as data compression and exploratory data analysis to physics learning to atomic fabrication.

36 MATERIALS SCIENCE↗

Generation of Turbulence in Colliding Reconnection Jets

The collision of magnetic reconnection jets is reported on by means of a three-dimensional numerical simulation at the kinetic scale, in the presence of a strong guide field. We demonstrate that turbulence develops due to the collision of jets, producing several current sheets in reconnection outflows, aligned with the guide field direction. The turbulence is mainly two-dimensional, with stronger gradients in the plane perpendicular to the guide field and low wave-like activity in the parallel direction. First, we provide a numerical method to isolate the central turbulent region. Second, we analyze the spatial second-order structure function and prove that turbulence is confined in this region. Lastly, we compute local magnetic and electric frequency spectra, finding a trend in the subion range that differs from typical cases for which the Taylor hypothesis is valid, as well as wave activity in the range between ion and electron cyclotron frequencies. Our findings are relevant to understand observed collisions of reconnection jets in space plasmas.

79 ASTRONOMY AND ASTROPHYSICS↗

Method of synchronizing independent functional unit

A system for synchronizing parallel processing of a plurality of functional processing units (FPU), a first FPU and a first program counter to control timing of a first stream of program instructions issued to the first FPU by advancement of the first program counter; a second FPU and a second program counter to control timing of a second stream of program instructions issued to the second FPU by advancement of the second program counter, the first FPU is in communication with a second FPU to synchronize the issuance of a first stream of program instructions to the second stream of program instructions and the second FPU is in communication with the first FPU to synchronize the issuance of the second stream program instructions to the first stream of program instructions.

97 MATHEMATICS AND COMPUTING↗

Method of synchronizing independent functional unit

A system for synchronizing parallel processing of a plurality of functional processing units (FPU), a first FPU and a first program counter to control timing of a first stream of program instructions issued to the first FPU by advancement of the first program counter; a second FPU and a second program counter to control timing of a second stream of program instructions issued to the second FPU by advancement of the second program counter, the first FPU is in communication with a second FPU to synchronize the issuance of a first stream of program instructions to the second stream of program instructions and the second FPU is in communication with the first FPU to synchronize the issuance of the second stream program instructions to the first stream of program instructions.

97 MATHEMATICS AND COMPUTING↗

Method of synchronizing independent functional unit

A system for synchronizing parallel processing of a plurality of functional processing units (FPU), a first FPU and a first program counter to control timing of a first stream of program instructions issued to the first FPU by advancement of the first program counter; a second FPU and a second program counter to control timing of a second stream of program instructions issued to the second FPU by advancement of the second program counter, the first FPU is in communication with a second FPU to synchronize the issuance of a first stream of program instructions to the second stream of program instructions and the second FPU is in communication with the first FPU to synchronize the issuance of the second stream program instructions to the first stream of program instructions.

97 MATHEMATICS AND COMPUTING↗

Parallel Fokker–Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers

A major challenge for the conventional Direct Simulation Monte Carlo (DSMC) technique lies in the fact that its computational cost becomes prohibitive in the near continuum regime, where the Knudsen number (Kn)—characterizing the degree of rarefaction—becomes small. In contrast, the Fokker–Planck (FP) based particle Monte Carlo scheme allows for computationally efficient simulations of rarefied gas flows in the low and intermediate Kn regime. The Fokker–Planck collision operator—instead of performing binary collisions employed by the DSMC method—integrates continuous stochastic processes for the phase space evolution in time. This allows for time step and grid cell sizes larger than the respective collisional scales required by DSMC. Dynamically switching between the FP and the DSMC collision operators in each computational cell is the basis of the combined FP-DSMC method, which has been proven successful in simulating flows covering the whole Kn range. Until recently, this algorithm had only been applied to two-dimensional test cases. In this contribution, we present the first general purpose implementation of the combined FP-DSMC method. Utilizing both shared- and distributed-memory parallelization, this implementation provides the capability for simulations involving many particles and complex geometries by exploiting state of the art computer cluster technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel transport sweeps on two-dimensional cartesian and hexagonal grids

This paper aims to provide a proof of concept for parallel transport sweeps on two-dimensional hexagonal grids for the discrete ordinates transport equation. While the method is an extension of the popular and well-established Koch-Baker-Alcoulffe (KBA) algorithm, there are significant differences between the cartesian and hexagonal grid and thereafter sweep. The most important is the three-way connectivity of hexagons within the grid which creates greater dependencies between the elements. The KBA method in structured orthogonal grids was first implemented in the DRAGON5 code and the method is first described here. The differences in implementation for the hexagonal grid are also described. Benchmark results are also presented, showing roughly 10 times speedup in computational times with roughly 100 processors, in both cases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗

Detailed study of the eikonal reaction theory for the breakup of one-neutron halo nuclei

Background: One-neutron removal reactions are used to study the single-particle structure of unstable nuclei, and in particular the exotic halo nuclei. The eikonal reaction theory (ERT) has been developed by Yahiro, Ogata, and Minomo [Prog. Theor. Phys. 126, 167 (2011)] to include dynamical effects, which are missing in the usual eikonal description of these reactions. Encouraging results have been obtained for total breakup cross sections in comparison to more elaborate reaction models. Purpose: Here, we extend these comparisons to more differential breakup cross sections expressed as functions of the relative energy or parallel momentum between the core and halo neutron. Method: ERT predictions of these cross sections are compared to state-of-the-art calculations. Results: The hypotheses upon which the ERT is based are confirmed and their range of validity is made clearer. The actual ordering of the evolution operators affects ERT differential cross sections and a specific choice leads to excellent agreement with the reference calculation. Dynamical effects in the treatment of the neutron-target interaction can be significant in the parallel-momentum observable. Conclusions: The role of the different interactions in the dynamics of breakup reactions of one-neutron halo nuclei are better understood and improvements to the ERT are suggested.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerating Bilevel Optimization With Hierarchical Many-Threaded Parallel Differential Evolution

Bilevel optimization is encountered in many relevant real-world applications. The main feature of this type of problem is that an upper-level optimization problem is constrained by a nested lower-level optimization problem. Because of this nested structure, bilevel problems (BLPs) are usually computationally expensive to solve. Differential evolution (DE) has demonstrated promising results in solving BLPs of relatively small scales. As the problem scale increases, the decision space becomes intrinsically larger, requiring a growing number of function evaluations for the method to work properly. In this context, heavy parallelization and high-performance computing techniques are indispensable to enable the resolution of more complex and challenging optimization problems. Hence, we propose a hierarchical many-threaded parallel DE approach for BLPs, where both levels are parallelized. The computational experiments demonstrate that the parallel implementation achieved runtime speeds ranging from 44 to 2559 times faster than the sequential version on a well-known scalable SMD benchmark test problem when executed on an NVIDIA A100 GPU. The findings indicate that the algorithm’s convergence is strongly influenced by the number of both upper- and lower-level generations. Moreover, the success of experiments with large-scale problems is closely linked to the choice of small population sizes.

Dufek, Amanda S↗

Multiwall carbon nanotube microcavity arrays

Periodic highly dense multi-wall carbon nanotube (MWCNT) arrays can act as photonic materials exhibiting band gaps in the visible regime and beyond terahertz range. MWCNT arrays in square arrangement for nanoscale lattice constants can be configured as a microcavity with predictable resonance frequencies. Here, computational analyses of compact square microcavities (≈0.8 × 0.8 μm{sup 2}) in MWCNT arrays were demonstrated to obtain enhanced quality factors (≈170–180) and narrow-band resonance peaks. Cavity resonances were rationally designed and optimized (nanotube geometry and cavity size) with finite element method. Series (1 × 2 and 1 × 3) and parallel (2 × 1 and 3 × 1) combinations of microcavities were modeled and resonance modes were analyzed. Higher order MWCNT microcavities showed enhanced resonance modes, which were red shifted with increasing Q-factors. Parallel microcavity geometries were also optimized to obtain narrow-band tunable filtering in low-loss communication windows (810, 1336, and 1558 nm). Compact series and parallel MWCNT microcavity arrays may have applications in optical filters and miniaturized optical communication devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Static and Dynamic Community Detection Using Grappolo

Graph clustering, popularly known as community detection, is a fundamental kernel for several applications of relevance to the Defense Advanced Research Projects Agency’s (DARPA) Hierarchical Identify Verify Exploit (HIVE) Pro- gram. Clusters or communities represent natural divisions within a network that are densely connected within a cluster and sparsely connected to the rest of the network. The need to compute clustering on large scale data necessitates the development of efficient algorithms that can exploit modern architectures that are fundamentally parallel in nature. How- ever, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the HIVE Graph Challenge, we present several parallelization heuristics for fast community detection using the Louvain method as the serial template. We implement all the heuristics in a software library called Grappolo. Using the inputs from the HIVE Challenge, we demonstrate superior performance and high quality solutions based on four parallelization heuristics. We use Grappolo on static graphs as the first step towards community detection on streaming graphs.

Community Detection↗

Adaptive, Active Learning, and Multifidelity Monte Carlo Methods in the MOOSE Stochastic Tools Module

MOOSE is an open-source computational platform for constructing multi-physics models and executing them in a massively parallel fashion. It has a stochastic tools module (STM) for forward/inverse uncertainty quantification (UQ) and surrogate modeling. This presentation details some recent developments to the STM with respect to the implementation of adaptive, active learning, and multifidelity Monte Carlo methods for forward UQ of computational models. Specifically, the adaptive Monte Carlo methods include Markov Chain Monte Carlo (MCMC)-driven algorithms like adaptive importance sampling and parallelized subset simulation for statistical QoI estimation, rare events analysis, and stochastic gradient-free optimization. The active learning methods include Gaussian Process (GP) surrogates and their training via Adam optimization, design of acquisition functions, and integration with samplers like Monte Carlo, adaptive importance, and parallelized subset simulation. These active learning methods are also designed to work in a batch mode, wherein, the required calls to the full computational model are executed in parallel whenever a user-specified batch size is met. The multifidelity methods in STM are broadly divided into two categories: hierarchical, where a defined hierarchy exists among the low-fidelity models, and peer, where all the low-fidelity models are treated equally. A GP surrogate is used to learn the differences between the low- and high-fidelity models in both multifidelity categories, and acquisition functions from the active learning classes are used to decide whether to rely on a low-fidelity model or call the expensive high-fidelity model. Alongside the software description and usage, applications are also presented to nuclear engineering computational models including a TRISO nuclear fuel particle, a reactor pressure vessel, and a heat-pipe microreactor.

97 MATHEMATICS AND COMPUTING↗