Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational demand”

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 73 records · Page 4

Full Detector Simulation with Unprecedented Background Occupancy at a Muon Collider

In recent years, a Muon collider has attracted a lot of interest in the high-energy physics community, thanks to its ability of achieving clean interaction signatures at multi-TeV collision energies in the most cost-effective way. Estimation of the physics potential of such an experiment must take into account the impact of beam-induced background on the detector performance, which has to be carefully evaluated using full detector simulation. Tracing of all the background particles entering the detector region in a single bunch crossing is out of reach for any realistic computing facility due to the unprecedented number of such particles. To make it feasible a number of optimisations have been applied to the detector simulation workflow. This contribution presents an overview of the main characteristics of the beam-induced background at a Muon collider, the detector technologies considered for the experiment and how they are taken into account to strongly reduce the number of irrelevant computations performed during the detector simulation. Special attention is dedicated to the optimisation of track reconstruction with the conformal tracking algorithm in this high-occupancy environment, which is the most computationally demanding part of event reconstruction.

97 MATHEMATICS AND COMPUTING↗

Model emulation and closure tests for (3+1)D relativistic heavy-ion collisions

In nuclear and particle physics, reconciling sophisticated simulations with experimental data is vital for understanding complex systems like the Quark Gluon Plasma (QGP) generated in heavy ion collisions. However, computational demands pose challenges, motivating using Gaussian Process emulators for efficient parameter extraction via Bayesian calibration. We conduct a comparative analysis of Gaussian Process emulators in heavy-ion physics to identify the most adept emulator for parameter extraction with minimal uncertainty. Furthermore, our study contributes to advancing computational techniques in heavy-ion physics, enhancing our ability to interpret experimental data and understand QGP properties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ASPIRES: Airport Shuttle Planning and Improved Routing Event-driven Simulation

Most of the existing traffic simulation packages require significant calibration work to be able to reflect reality. To evaluate special operations including emerging technologies, a microscopic simulation that tracks detailed interactions of all the elements of the traffic systems is usually needed. This type of simulation is usually computationally demanding. This work developed an Airport Shuttle Planning and Improved Routing Event-driven Simulation (ASPIRES) package to simulate and evaluate current, potential, and future airport shuttle operations. Here, the simulation was driven by data and thus did not require much calibration effort. The discrete-event simulation nature of ASPIRES makes the simulation computationally efficient. Simulating 1 day of shuttle operations takes less than 2s. The study site of this work is the Dallas/Fort Worth International Airport in the U.S. The shuttle service that connects the five terminals of the airport and the rental car center was studied. Travel times, dwell times, and passenger arrivals were simulated using empirical distributions derived mainly from real data to capture the stochastic nature of the rental car center shuttle bus operations. Data on bus miles traveled, bus energy consumption, passenger wait times, and passengers left behind at stops were collected to study the trade-off between energy use and passenger experience. Electric bus and on-demand bus operations were also included. The simulation outputs can show passengers statistics at terminals, shuttles statistics, and charging station statistics. ASPIRES cannot be used to model a generic traffic system but is well-suited for fleet systems.

33 ADVANCED PROPULSION SYSTEMS↗

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗

Portable Acceleration of CMS Computing Workflows with Coprocessors as a Service

Computing demands for large scientific experiments, such as the CMS experiment at the CERN LHC, will increase dramatically in the next decades. To complement the future performance increases of software running on central processing units (CPUs), explorations of coprocessor usage in data processing hold great potential and interest. Coprocessors are a class of computer processors that supplement CPUs, often improving the execution of certain functions due to architectural design choices. We explore the approach of Services for Optimized Network Inference on Coprocessors (SONIC) and study the deployment of this as-a-service approach in large-scale data processing. In the studies, we take a data processing workflow of the CMS experiment and run the main workflow on CPUs, while offloading several machine learning (ML) inference tasks onto either remote or local coprocessors, specifically graphics processing units (GPUs). With experiments performed at Google Cloud, the Purdue Tier-2 computing center, and combinations of the two, we demonstrate the acceleration of these ML algorithms individually on coprocessors and the corresponding throughput improvement for the entire workflow. This approach can be easily generalized to different types of coprocessors and deployed on local CPUs without decreasing the throughput performance. We emphasize that the SONIC approach enables high coprocessor usage and enables the portability to run workflows on different types of coprocessors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Computationally Predicted High-Throughput Free-Energy Phase Diagrams for the Discovery of Solid-State Hydrogen Storage Reactions

The design of multinary solid-state material systems that undergo reversible phase changes via changes in temperature and pressure provides a potential means of safely storing hydrogen. However, fully mapping the stabilities of known or newly targeted compounds relative to competing phases at reaction conditions has previously required many stringent experiments or computationally demanding calculations of each compound’s change in Gibbs energy with respect to temperature, G(T). Here, we have extended the approach of constructing chemical potential phase diagrams based on ΔG f (T) to enable the analysis of phase stability at non-zero temperatures. We first performed density functional theory calculations to compute the formation enthalpies of binary, ternary, and quaternary compounds within several compositional spaces of current interest for solid-state hydrogen storage. Temperature effects on solid compound stability were then accounted for using our recently introduced machine learned descriptor for the temperature-dependent contribution G δ (T) to the Gibbs energy G(T). From these Gibbs energies, we evaluated each compound’s stability relative to competing compounds over a wide range of conditions and show using chemical potential and composition phase diagrams that the predicted stable phases and H2 release reactions are consistent with experimental observations. This demonstrates that our approach rapidly computes the thermochemistry of hydrogen release reactions for compounds at sufficiently high accuracy relative to experiment to provide a powerful framework for analyzing hydrogen storage materials. This framework based on G(T) enables the accelerated discovery of active materials for a variety of technologies that rely on solid-state reactions involving these materials.

08 HYDROGEN↗

Emulator of PR‐DNS: Accelerating Dynamical Fields With Neural Operators in Particle‐Resolved Direct Numerical Simulation

Abstract Particle‐resolved direct numerical simulations (PR‐DNS) play an increasing role in investigating aerosol‐cloud‐turbulence interactions at the most fundamental level of processes. However, the high computational cost associated with high resolution simulations poses considerable challenges for large domain or long duration simulation using PR‐DNS. To address these issues, here we present an emulator of the complex physics‐based PR‐DNS developed by use of the data‐driven Fourier Neural Operator (FNO) method. The effectiveness of the method is showcased by presenting turbulence and temperature fields in a two‐dimensional space. The results demonstrate high accuracy at various resolutions and the emulator is two orders of magnitude cheaper in terms of computational demand compared to the physics‐based PR‐DNS model. Furthermore, the FNO emulator exhibits strong generalization capabilities for different initial conditions and ultra‐high‐resolution without the need to retrain models. These findings highlight the potential of the FNO method as a promising tool to simulate complex fluid dynamics problems with high accuracy, computational efficiency, and generalization capabilities, enhancing our understanding of the aerosol‐cloud‐precipitation system.

99 GENERAL AND MISCELLANEOUS↗

Two-Stage Reinforcement Learning Policy Search for Grid-Interactive Building Control

This paper develops an intelligent grid-interactive building controller, which optimizes building operation during both normal hours and demand response (DR) events. To avoid costly on-demand computation and to adapt to non-linear building models, the controller utilizes reinforcement learning (RL) and makes real-time decisions based on a near-optimal control policy. Learning such a policy typically amounts to solving a hard non-convex optimization problem. We propose to address this problem with a novel global-local policy search method. In the first stage, an RL algorithm based on zero-order gradient estimation is leveraged to search for the optimal policy globally, due to its scalability and the potential to escape some poor performing local optima. The obtained policy is then fine-tuned locally to bring the first-stage solution closer to that of the original unsmoothed problem. Experiments on a simulated five-zone commercial building demonstrate the advantages of the proposed method over existing learning approaches. They also show that the learned control policy outperforms a pragmatic linear model predictive controller (MPC) and approaches the performance of an oracle MPC in testing scenarios. Using a state-of-the-art advanced computing system, we demonstrate that the controller can be learned and deployed within hours of training.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Contrast Calibration Protocol for X-ray Speckle Visibility Spectroscopy

X-ray free electron lasers, with their ultrashort highly coherent pulses, opened up the opportunity of probing ultrafast nano- and atomic-scale dynamics in amorphous and disordered material systems via speckle visibility spectroscopy. However, the anticipated count rate in a typical experiment is usually low. Therefore, visibility needs to be extracted via photon statistics analysis, i.e., by estimating the probabilities of multiple photons per pixel events using pixelated detectors. Considering the realistic X-ray detector responses including charge cloud sharing between pixels, pixel readout noise, and gain non-uniformity, speckle visibility extraction relying on photon assignment algorithms are often computationally demanding and suffer from systematic errors. In this paper, we present a systematic study of the commonly-used algorithms by applying them to an experimental data set containing small-angle coherent scattering with visibility levels ranging from below 1% to ∼60%. We also propose a contrast calibration protocol and show that a computationally lightweight algorithm can be implemented for high-speed correlation evaluation.

47 OTHER INSTRUMENTATION↗

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗

Quantum Computing in the Cloud: Analyzing job and machine characteristics

As the popularity of quantum computing continues to grow, quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis of resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing. This paper is a first-of-its-kind academic study, analyzing various trends in job execution and resources consumption / utilization on quantum cloud systems. We focus on IBM Furthermore, quantum systems and analyze characteristics over a two year period, encompassing over 6000 jobs which contain over 600,000 quantum circuit executions and correspond to almost 10 billion “shots” or trials over 20+ quantum machines. Specifically, we analyze trends focused on, but not limited to, execution times on quantum machines, queuing/waiting times in the cloud, circuit compilation times, machine utilization, as well as the impact of job and machine characteristics on all of these trends. Furthermore, our analysis identifies several similarities and differences with classical HPC cloud systems. Based on our insights, we make recommendations and contributions to improve the management of resources and jobs on future quantum cloud systems.

42 ENGINEERING↗

Toward a Seamless Integration of Computing, Experimental, and Observational Science Facilities: A Blueprint to Accelerate Discovery

The Department of Energy, Office of Science operates world-leading facilities for experimental, observational, and computational science. DOE supercomputing facilities will reach performance at the scale of ExaFLOPs in the coming years, enabling new vistas of scale and precision for large scale simulations and data analysis. Experimental scientific facilities are undergoing similar upgrades that will lead to higher data rates and correspondingly larger computational demands, and will increase the need for near-real-time processing and resilient support for more complex workflows. A transformation of science is underway, with workloads at supercomputing facilities increasingly driven by this explosion of data from instruments and experimental facilities, as well as the accelerating use of Artificial Intelligence (AI) as a tool for scientific discovery. A seamless integration of computing, networking, instruments, and experimental facilities is required to support these emerging workloads and open up a new frontier of U.S. leadership in scientific discovery. We propose to accomplish this by providing frictionless access to the ASCR supercomputing facilities. We describe our vision of combining the power of ASCR supercomputers and networking infrastructure into an integrated scalable fabric, available to end user scientists via interfaces that aim to automate and simplify access to high performance computing systems. This will enable unprecedented computational science capabilities for experimental and observational facilities, and will create new opportunities to combine large simulations and modeling with experimental facility data analysis. This blueprint for creating an integrated network of computational and experimental facilities will provide an enriched discovery environment and open doors for new scientific communities to access the DOE’s world-leading computing and networking capabilities.

97 MATHEMATICS AND COMPUTING↗

Fast increased fidelity samplers for approximate Bayesian Gaussian process regression

Gaussian processes (GPs) are common components in Bayesian non-parametric models having a rich methodological literature and strong theoretical grounding. The use of exact GPs in Bayesian models is limited to problems containing several thousand observations due to their prohibitive computational demands. We develop a posterior sampling algorithm using H-matrix approximations that scales at O(n log 2 n). We show that this approximation’s Kullback-Leibler divergence to the true posterior can be made arbitrarily small. Though multidimensional GPs could be used with our algorithm, d-dimensional surfaces are modeled as tensor products of univariate GPs to minimize the cost of matrix construction and maximize computational efficiency. We illustrate the performance of this fast increased fidelity approximate GP, FIFA-GP, using both simulated and non-synthetic data sets

97 MATHEMATICS AND COMPUTING↗

Knowledge-informed deep learning for hydrological model calibration: an application to Coal Creek Watershed in Colorado

Abstract. Deep learning (DL)-assisted inverse mapping has shown promise in hydrological model calibration by directly estimating parameters from observations. However, the increasing computational demand for running the state-of-the-art hydrological model limits sufficient ensemble runs for its calibration. In this work, we present a novel knowledge-informed deep learning method that can efficiently conduct the calibration using a few hundred realizations. The method involves two steps. First, we determine decisive model parameters from a complete parameter set based on the mutual information (MI) between model responses and each parameter computed by a limited number of realizations (∼50). Second, we perform more ensemble runs (e.g., several hundred) to generate the training sets for the inverse mapping, which selects informative model responses for estimating each parameter using MI-based parameter sensitivity. We applied this new DL-based method to calibrate a process-based integrated hydrological model, the Advanced Terrestrial Simulator (ATS), at Coal Creek Watershed, CO. The calibration is performed against observed stream discharge (Q) and remotely sensed evapotranspiration (ET) from the water year 2017 to 2019. Preliminary MI analysis on 50 realizations resulted in a down-selection of 7 out of 14 ATS model parameters. Then, we performed a complete MI analysis on 396 realizations and constructed the inverse mapping from informative responses to each of the selected parameters using a deep neural network. Compared with calibration using observations covering all time steps, the new inverse mapping improves parameter estimations, thus enhancing the performance of ATS forward model runs. The Nash–Sutcliffe efficiency (NSE) of streamflow predictions increases from 0.53 to 0.8 when calibrating against Q alone. Using ET observations, on the other hand, does not show much improvement on the performance of ATS modeling mainly due to both the uncertainty of the remotely sensed product and the insufficient coverage of the model ET ensemble in capturing the observation. By using observed Q only, we further performed a multiyear analysis and show that Q is best simulated (NSE > 0.8) by including in the calibration the dry-year flow dynamics that show more sensitivity to subsurface characteristics than the other wet years. Moreover, when continuing the forward runs till the end of 2021, the calibrated models show similar simulation performances during this evaluation period as the calibration period, demonstrating the ability of the estimated parameters in capturing climate sensitivity. Our success highlights the importance of leveraging data-driven knowledge in DL-assisted hydrological model calibration.

54 ENVIRONMENTAL SCIENCES↗

Sentinel

Network intrusion detection systems (NIDS) are commonplace in network security but they frequently employ algorithms that are computational demanding requiring hardware and software with significant power requirements. Two examples of such resource-intensive algorithms used for network security are regular expression matching and broader signature pattern matching which are commonly used in deep packet inspection (DPI). Network security algorithms that have large power requirements may be a challenge for low-power internet-of-things (IoT) environments, which generally lack the power resources to implement complex security measures like computationally expensive DPI at the edge. Furthermore, IoT environments incorporating 5G standalone networks have network latency constraints beyond just power that make DPI at the edge even more difficult. Programmable logic is ideally suited for machine learning inference for DPI because of its deep instruction level parallelism and single-cycle memory access. Machine learning approaches for DPI have been explored before using the programmable logic of field programmable gate arrays (FPGA) as a potential solution for NIDS approaches that would be power-suitable for IoT. However, those previous programmable logic NIDS approaches utilize either a supervised or unsupervised learning model. Sentinel utilizes the ensemble of these two machine learning approaches known as a semi-supervised approach which has shown promise in NIDS implementations. Sentinel provides a programmable logic implementation of a semi-supervised approach for DPI which operates at much lower power and latency than a GPU implementation with negligible loss of accuracy due to quantization through a logistic regressor.

Anderson, MatthewW [Idaho National Laboratory (INL↗

Accelerating detector simulations with Celeritas: profiling and performance optimizations

Celeritas is a GPU-optimized MC particle transport code designed to meet the growing computational demands of next-generation HEP experiments. It provides efficient simulation of EM physics processes in complex geometries with magnetic fields, detector hit scoring, and seamless integration into Geant4-driven applications to offload EM physics to GPUs. Recent efforts have focused on performance optimizations and expanding profiling capabilities. This paper presents some key advancements, including the integration of the Perfetto system profiling tool for detailed performance analysis and the development of track-sorting methods to improve computational efficiency.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Latent space mapping: Revolutionizing predictive models for divertor plasma detachment control

The inherent complexity of boundary plasma, characterized by multi-scale and multi-physics challenges, has historically restricted high-fidelity simulations to scientific research due to their intensive computational demands. Consequently, routine applications such as discharge control and scenario development have relied on faster but less accurate empirical methods. This work introduces DivControlNN, a novel machine-learning-based surrogate model designed to address these limitations by enabling quasi-real-time predictions (i.e., ~ 0.2 ms) of boundary and divertor plasma behavior. Trained on over 70,000 2D UEDGE simulations from KSTAR tokamak equilibria, DivControlNN employs latent space mapping to efficiently represent complex divertor plasma states, achieving a computational speed-up of over 10 8 compared to traditional simulations while maintaining a relative error below 20% for key plasma property predictions. During the 2024 KSTAR experimental campaign, a prototype detachment control system powered by DivControlNN successfully demonstrated detachment control on its first attempt, even for a new tungsten divertor configuration and without any fine-tuning. These results highlight the transformative potential of DivControlNN in overcoming diagnostic challenges in future fusion reactors by providing fast, robust, and reliable predictions for advanced integrated control systems.

Artificial neural networks↗

SSA Monte Carlo and Master Equation Modeling of Neutron Leakage Distributions

Strongly stochastic neutron populations in highly subcritical multiplying media containing weak spontaneous fission sources are unique indicators of the presence of SNM. For instance, in neutron multiplicity counting, an extended tail in the count number probability distribution is observed that is a characteristic of and sensitive to the amount of SNM present. Theoretical modeling and efficient computation of stochastic neutron distributions are complementary to experimental measurements and moreover shed light on the fundamental interactions and transport processes that underlie nuclear signatures. Modeling approaches that are intermediate between gross-system level models and high-fidelity but computationally demanding Monte Carlo simulations are of particular interest in this regard. Furthermore we present three advances on existing work in point kinetic or lumped geometry: (i) implementation of the Stochastic Simulation Algorithm (SSA), a system state-updating Monte Carlo method that is more e cient than single-event Monte Carlo in lumped geometries, (ii) application of the backward Master equation to obtain time-gated count moments, and (iii) reconstructing the count number distribution from the deterministically computed moments using a generalized Laguerre polynomial expansion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗