Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Resilient Design of Continuous-time Distributed Optimization Algorithm in the Presence of Cyber-attacks

This paper presents a continuous-time resilient distributed optimization algorithm based on competitive interaction design method on connected graphs in the presence of adversaries. Here, the competitive interaction method allows us to design a network that protects the multi-agent systems from adversaries without requiring high network connectivity. In addition, the proposed algorithm does not require the global information about the number of adversaries. First, we show that the proposed distributed algorithm solves the resilient distributed optimization problem with no attack on the communication links. Second, we show that the proposed continuous-time distributed optimization algorithm on connected graphs converges to the small neighborhood of the optimal solution in the presence of cyber-attacks onto the communication channel. Simulations are presented to illustrate our theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Stationary Distribution of a Stochastic Process

We find a stationary distribution of a stochastic process with delay at the origin. The trajectories of the process have linear growth and random jumps at random times. We use known results for regenerative processes and factorization technique for the study in boundary crossing problems for random walks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scalable Volume Visualization for Big Scientific Data Modeled by Functional Approximation

Considering the challenges posed by the space and time complexities in handling extensive scientific volumetric data, various data representations have been developed for the analysis of large-scale scientific data. Multivariate functional approximation (MFA) is an innovative data model designed to tackle substantial challenges in scientific data analysis. It computes values and derivatives with high-order accuracy throughout the spatial domain, mitigating artifacts associated with zero- or first-order interpolation. However, the slow query time through MFA makes it less suitable for interactively visualizing a large MFA model. In this work, we develop the first scalable interactive volume visualization pipeline, MFA-DVV, for the MFA model encoded from large-scale datasets. Our method achieves low input latency through distributed architecture, and its performance can be further enhanced by utilizing a compressed MFA model while still maintaining a high-quality rendering result for scientific datasets. We conduct comprehensive experiments to show that MFA-DVV can decrease the input latency and achieve superior visualization results for big scientific data compared with existing approaches.

big scientific dataset↗
DOE OSTI2015

ATLAS FTK Challenge: Simulation of a Billion-fold Hardware Parallelism

During the current LHC shutdown period the ATLAS experiment will upgrade the Trigger and Data Acquisition system to include a hardware tracker coprocessor: the Fast TracKer (FTK). The FTK receives data from the 80 million of channels of the ATLAS silicon detector, identifying charged tracks and reconstructing their parameters at a rate of up to 100 KHz and within 100 microseconds. To achieve this performance, the FTK system identifies candidate tracks utilizing the computing power of a custom ASIC chip with associative memory (AM) designed to perform “pattern matching” at very high speed; track parameters are then calculated using modern FPGAs. A detailed simulation of this massive system has been developed with the goal of supporting the hardware design and studying its impact in the ATLAS online event selection at high LHC luminosities. We present the issues related to emulating FTK on a general-purpose CPU platform, using ATLAS computing Grid resources, and the solutions developed in order to mitigate these problems and allow the studies required to support the system design, construction and installation.

Distributed Computing↗
DOE OSTI2024

A parallel and performance portable implementation of a full-field crystal plasticity model

We have developed a parallel implementation of an Elasto-Viscoplastic Fast Fourier Transform-based (EVPFFT) micromechanical solver to enable computationally efficient crystal plasticity modeling for polycrystalline materials. Our primary focus lies in achieving performance portability, allowing a single EVPFFT implementation to run optimally on various homogeneous architectures, including multi-core Central Processing Units (CPUs), as well as on heterogeneous computer architectures comprising multi-core CPUs and Graphics Processing Units (GPUs) from different vendors. To accomplish this goal, we have leveraged MATAR, a C++ software library that simplifies the creation and utilization of multidimensional dense or sparse matrix and array data structures. These data structures are designed to be portable across diverse architectures through the use of Kokkos, a performance-portable library. Additionally, we have employed the Message Passing Interface (MPI) to efficiently distribute the computational workload among processors. The heFFTe (Highly Efficient FFT for Exascale) library is used to facilitate the performance portability of the fast Fourier transforms (FFTs) computation. The computational performance of EVPFFT is evaluated and presented in terms of parallel scalability and simulation runtime on different high-performance computing (HPC) architectures. As a result, the utility of the developed framework to efficiently simulate the micro-mechanical fields in polycrystalline microstructures in engineering applications is discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2024

WRF-Comfort: simulating microscale variability in outdoor heat stress at the city scale with a mesoscale model

Abstract. Urban overheating and its ongoing exacerbation due to global warming and urban development lead to increased exposure to urban heat and increased thermal discomfort and heat stress. To quantify thermal stress, specific indices have been proposed that depend on air temperature, mean radiant temperature (MRT), wind speed, and relative humidity. While temperature and humidity vary on scales of hundreds of meters, MRT and wind speed are strongly affected by individual buildings and trees and vary on the meter scale. Therefore, most numerical thermal comfort studies apply microscale models to limited spatial domains (commonly representing urban neighborhoods with building blocks) with resolutions on the order of 1 m and a few hours of simulation. This prevents the analysis of the impact of city-scale adaptation and/or mitigation strategies on thermal stress and comfort. To solve this problem, we develop a methodology to estimate thermal stress indicators and their subgrid variability in mesoscale models – here applied to the multilayer urban canopy parameterization BEP-BEM within the Weather Research and Forecasting (WRF) model. The new scheme (consisting of three main steps) can readily assess intra-neighborhood-scale heat stress distributions across whole cities and for timescales of minutes to years. The first key component of the approach is the estimation of MRT in several locations within streets for different street orientations. Second, mean wind speed and its subgrid variability are downscaled as a function of the local urban morphology based on relations derived from a set of microscale LES and RANS simulations across a wide range of realistic and idealized urban morphologies. Lastly, we compute the distributions of two thermal stress indices for each grid square, combining all the subgrid values of MRT, wind speed, air temperature, and absolute humidity. From these distributions, we quantify the high and low tails of the heat stress distribution in each grid square across the city, representing the thermal diversity experienced in street canyons. In this contribution, we present the core methodology as well as simulation results for Madrid (Spain), which illustrate strong differences between heat stress indices and common heat metrics like air or surface temperature both across the city and over the diurnal cycle.

Geology↗
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 OSTI2024

Secure Federated Learning Across Heterogeneous Cloud and High-Performance Computing Resources: A Case Study on Federated Fine-Tuning of LLaMA 2

Federated learning enables multiple data owners to collaboratively train robust machine learning models without transferring large or sensitive local datasets by only sharing the parameters of the locally trained models. Here, in this article, we elaborate on the design of our Advanced Privacy-Preserving Federated Learning (APPFL) framework, which streamlines end-to-end secure and reliable federated learning experiments across cloud computing facilities and high-performance computing resources by leveraging Globus Compute, a distributed function as a service platform, and Amazon Web Services. We further demonstrate the use case of APPFL in fine-tuning an LLaMA 2 7B model using several cloud resources and supercomputers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Model-Free Voltage Control Approach to Mitigate Motor Stalling and FIDVR for Smart Grids

Electric power networks are large and highly nonlinear dynamical systems that present unique challenges to control design. Though there is a large number of dynamic models for power system stability and control, many models are only useful with right assumptions and wrong for other tasks. Moreover, the dynamic behavior of the grid is increasingly complex under the banner of smart grids. These lead to the difficulty of developing appropriate dynamic modeling, and thus an efficient control strategy. To avoid such modeling challenges, here we present a novel dynamic voltage control strategy based on a model-free control (MFC) approach, requiring no modeling procedure. In particular, it focuses on fault-induced delayed voltage recovery (FIDVR) events, which require complex and accurate dynamic load models to replicate such events. This work utilizes MFC as an online controller to achieve the desired voltage stability under the FIDVR event. The proposed MFC strategy allows simple implementation and low computational cost for efficient mitigation of FIDVR. For benchmarking, a reasonably accurate dynamic performance model is explored. Simulation results with the IEEE 57 bus test network demonstrate the enhanced dynamic voltage profile for load buses having induction motors with the support of reactive power resources.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Empowering Intensity Modulated Proton Therapy Through Physics and Technology: An Overview

Considering the clinical potential of protons attributable to their physical characteristics, interest in proton therapy has increased greatly in this century, as has the number of proton therapy installations. Until recently, passively scattered proton therapy was used almost entirely. Notably, the overall clinical results to date have not shown a convincing benefit of protons over photons. A rapid transition is now occurring with the implementation of the most advanced form of proton therapy, intensity modulated proton therapy (IMPT). IMPT is superior to passively scattered proton therapy and intensity modulated radiation therapy (IMRT) dosimetrically. However, numerous limitations exist in the present IMPT methods. In particular, compared with IMRT, IMPT is highly vulnerable to various uncertainties. In this overview we identify three major areas of current limitations of IMPT: treatment planning, treatment delivery, and motion management, and discuss current and future efforts for improvement. For treatment planning, we need to reduce uncertainties in proton range and in computed dose distributions, improve robust planning and optimization, enhance adaptive treatment planning and delivery, and consider how to exploit the variability in the relative biological effectiveness of protons for clinical benefit. The quality of proton therapy also depends on the characteristics of the IMPT delivery systems and image guidance. Efforts are needed to optimize the beamlet spot size for both improved dose conformality and faster delivery. For the latter, faster energy switching time and increased dose rate are also needed. Real-time in-room volumetric imaging for guiding IMPT is in its early stages with cone beam computed tomography (CT) and CT-on-rails, and continued improvements are anticipated. In addition, imaging of the proton beams themselves, using, for instance, prompt γ emissions, is being developed to determine the proton range and to reduce range uncertainty. With the realization of the advances described above, we posit that IMPT, thus empowered, will lead to substantially improved clinical results.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Portable Software Environment for Ultrahigh-Resolution ELM Development on GPUs

This paper presents our endeavors in developing the large-scale, ultra-high-resolution E3SM Land Model (uELM), specifically designed for exascale computers furnished with accelerators such as Nvidia GPUs. The uELM is a sophisticated code that substantially relies on High-Performance Computing (HPC) environments, necessitating particular machine and software configurations. To facilitate community-based uELM developments employing GPUs, we have created a portable, standalone software environment preconfigured with uELM input datasets, simulation cases, and source code. This environment, utilizing Docker, encompasses all essential code, libraries, and system software for uELM development on GPUs. It also features a functional unit test framework and an offline model testbed for comprehensive numerical experiments. From a technical perspective, the paper discusses GPU-ready container generations, uELM code management, and input data distribution across computational platforms. Lastly, the paper demonstrates the use of environment for functional unit testing, end-to-end simulation on CPUs and GPUs, and collaborative code development.

E3SM Land Model↗
DOE OSTI2018

On Large Deviations for Sums of i.i.d. Bernoulli Random Variables

Tail probabilities are studied for the binomial distribution. The Hoeffding inequality is sharpened in this particular case through estimating an integral factor in the Esscher transform, which is omitted in Hoeffding’s proof. This approach was already used by Talagrand (1995) in the general case. However, our results are much more precise. In particular, all involved constants are given in the explicit form.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

O(N) Quantum Molecular Dynamics (QMD) Algorithms, Code Requirements, Release Notes, and Library Deployment

The Exascale Computing Project (ECP) Co-design Center for Particle Applications (CoPA) is addressing the challenges for particle applications to run on upcoming exascale computing architectures. This includes short- and long-range molecular dynamics (MD), particle-in-cell (PIC), and quantum molecular dynamics (QMD). This document addresses $\mathcal{O}(N)$ QMD. The goal of this CoPA team is to develop $\mathcal{O}(N)$ linear scaling methods for QMD optimized for new and next generation architectures. This will provide the capability to simulate larger systems and run for longer timeframes than is possible today. Focus is initially on the density matrix construction. This requires efficient matrix formats and linear algebra operations for distributed architectures. A significant reduction in the wallclock time for an MD timestep is necessary to achieve practical large scale QMD. Equally challenging is to develop scalable distributed implementations. This requires the exploration of efficient data formats (dense, sparse, etc.), data decomposition and distribution across compute nodes using block- and graph-based methods. Traditional programming models such as MPI/OpenMP, hybrid MPI/OpenMP/Accelerator, as well as asynchronous task-based models will be explored to achieve maximum parallelism. Parallelism at the level of a matrix operation, solver, and/or application needs to be explored to gain the most benefit on new and emerging architectures. This report serves as a “living document” of the additions and enhancements throughout the ECP CoPA project for $\mathcal{O}(N)$ QMD. The following sections address the applications we are working with, the quantum chemistry libraries (BML and PROGRESS), and our co-design exploration through the use of a proxy application.

36 MATERIALS SCIENCE↗
DOE OSTI2014

TH-A-19A-08: Intel Xeon Phi Implementation of a Fast Multi-Purpose Monte Carlo Simulation for Proton Therapy

Purpose: Recent studies have demonstrated the capability of graphics processing units (GPUs) to compute dose distributions using Monte Carlo (MC) methods within clinical time constraints. However, GPUs have a rigid vectorial architecture that favors the implementation of simplified particle transport algorithms, adapted to specific tasks. Our new, fast, and multipurpose MC code, named MCsquare, runs on Intel Xeon Phi coprocessors. This technology offers 60 independent cores, and therefore more flexibility to implement fast and yet generic MC functionalities, such as prompt gamma simulations. Methods: MCsquare implements several models and hence allows users to make their own tradeoff between speed and accuracy. A 200 MeV proton beam is simulated in a heterogeneous phantom using Geant4 and two configurations of MCsquare. The first one is the most conservative and accurate. The method of fictitious interactions handles the interfaces and secondary charged particles emitted in nuclear interactions are fully simulated. The second, faster configuration simplifies interface crossings and simulates only secondary protons after nuclear interaction events. Integral depth-dose and transversal profiles are compared to those of Geant4. Moreover, the production profile of prompt gammas is compared to PENH results. Results: Integral depth dose and transversal profiles computed by MCsquare and Geant4 are within 3%. The production of secondaries from nuclear interactions is slightly inaccurate at interfaces for the fastest configuration of MCsquare but this is unlikely to have any clinical impact. The computation time varies between 90 seconds for the most conservative settings to merely 59 seconds in the fastest configuration. Finally prompt gamma profiles are also in very good agreement with PENH results. Conclusion: Our new, fast, and multi-purpose Monte Carlo code simulates prompt gammas and calculates dose distributions in less than a minute, which complies with clinical time constraints. It has been successfully validated with Geant4. This work has been financialy supported by InVivoIGT, a public/private partnership between UCL and IBA.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2015

Toroidal nanotraps for cold polar molecules

Electronic excitations in metallic nanoparticles in the optical regime that have been of great importance in surface-enhanced spectroscopy and emerging applications of molecular plasmonics, due to control and confinement of electromagnetic energy, may also be of potential to control the motion of nanoparticles and molecules. Here, we propose a concept for trapping polarizable particles and molecules using toroidal metallic nanoparticles. Specifically, gold nanorings are investigated for their scattering properties and field distribution to computationally show that the response of these optically resonant particles to incident photons permit the formation of a nanoscale trap when proper aspect ratio, photon wavelength, and polarization are considered. However, interestingly the resonant plasmonic response of the nanoring is shown to be detrimental to the trap formation. The results are in good agreement with analytic calculations in the quasistatic limit within the first-order perturbation of the scalar electric potential. The possibility of extending the single nanoring trapping properties to two-dimensional arrays of nanorings is suggested by obtaining the field distribution of nanoring dimers and trimers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2013

The impact of fuel particle size distribution on neutron transport in stochastic media

This paper presents a study of the particle size distribution impact on neutron transport in three-dimensional stochastic media. An eigenvalue problem is simulated in a cylindrical container consisting of fissile fuel particles with five different size distributions: constant, uniform, power, exponential and Gaussian. We construct 15 cases by altering the fissile particle volume packing fraction and its optical thickness, but keeping the mean chord length of the spherical fuel particle the same at different size distributions. The tallied effective multiplication factor (k{sub eff}) and flux distribution along axial and radial directions are compared between different size distributions. At low packing fraction and low optical thickness, the size distribution has a significant impact on radiation transport in stochastic media, which can cause as high as {approx}270 pcm difference in k{sub eff} value and {approx}2.6% relative error difference in peak flux. As the packing fraction and optical thickness increase, the impact gradually dissipates. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗