Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “execution model”

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 1,099 records · Page 61

Bridging the gap: Deploying AI-based Models in Real-Time Fusion Plasma Control Systems

Achieving reliable real-time control in fusion plasma experiments requires strict timing guarantees across entire control algorithms. In earlier work by Abbate et al. (2023), we demonstrated the feasibility of neural-network-based control algorithms on the DIII-D tokamak using the internally developed open-source Keras2C library for model conversion into C (Conlin et al. (2021)). However, the initial implementations relied on data buffering and branching logic outside the neural network code, causing variability in execution times. Subsequent deployments on DIII-D and KSTAR—including the RTCAKENN algorithm for kinetic profile reconstruction—proved that minimizing branching and buffering throughout the pipeline yields consistent millisecond-level cycle times under real experimental conditions (Shousha et al. (2023)). However, keeping pace with rapidly evolving AI frameworks (e.g. PyTorch) is challenging. Finally, we, therefore, propose a community-driven open-source effort to expand the tool, enabling real-time deployment across diverse systems that require strictly bounded execution times.

AI-based models↗

Pulse-level noisy quantum circuits with QuTiP

The study of the impact of noise on quantum circuits is especially relevant to guide the progress of Noisy Intermediate-Scale Quantum (NISQ) computing. In this paper, we address the pulse-level simulation of noisy quantum circuits with the Quantum Toolbox in Python (QuTiP). We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian that describes the unitary evolution of the physical qubits. Various types of noise can be introduced based on the physical model, e.g., by simulating the Lindblad density-matrix dynamics or Monte Carlo quantum trajectories. In particular, the user can define environment-induced decoherence at the processor level and include noise simulation at the level of control pulses. We illustrate how the Deutsch-Jozsa algorithm is compiled and executed on a superconducting-qubit-based processor, on a spin-chain-based processor and using control optimization algorithms. We also show how to easily reproduce experimental results on cross-talk noise in an ion-based processor, and how a Ramsey experiment can be modeled with Lindblad dynamics. Finally, we illustrate how to integrate these features with other software frameworks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sirepo - Warp

Sirepo is an open source framework for cloud computing. The graphical user interface (GUI) for Sirepo, also known as the client, executes in any HTML5 compliant web browser on any computing platform, including tablets. The client is built in JavaScript, making use of the following open source libraries: Bootstrap, which is fundamental for cross-platform web applications; AngularJS, which provides a model–view–controller (MVC) architecture and GUI components; and D3.js, which provides interactive plots and data-driven transformations. The Sirepo server is built on the following Python technologies: Flask, which is a lightweight framework for web development; Jin-ja, which is a secure and widely used templating language; and Werkzeug, a utility library that is compliant with the WSGI standard. We use Nginx as the HTTP server and proxy, which provides a scalable event-driven architecture. The physics codes supported by Sirepo execute inside a Docker container. One of the codes supported by Sirepo is Warp. Warp is a particle-in-cell (PIC) code de-signed to simulate high-intensity charged particle beams and plasmas in both the electrostatic and electromagnetic regimes, with a wide variety of integrated physics models and diagnostics. At pre-sent, Sirepo supports a small subset of Warp’s capabilities. Warp is open source and is part of the Berkeley Lab Accelerator Simulation Toolkit.

Nagler, Robert↗

Sirepo - Warp

Sirepo is an open source framework for cloud computing. The graphical user interface (GUI) for Sirepo, also known as the client, executes in any HTML5 compliant web browser on any computing platform, including tablets. The client is built in JavaScript, making use of the following open source libraries: Bootstrap, which is fundamental for cross-platform web applications; AngularJS, which provides a model–view–controller (MVC) architecture and GUI components; and D3.js, which provides interactive plots and data-driven transformations. The Sirepo server is built on the following Python technologies: Flask, which is a lightweight framework for web development; Jin-ja, which is a secure and widely used templating language; and Werkzeug, a utility library that is compliant with the WSGI standard. We use Nginx as the HTTP server and proxy, which provides a scalable event-driven architecture. The physics codes supported by Sirepo execute inside a Docker container. One of the codes supported by Sirepo is Warp. Warp is a particle-in-cell (PIC) code de-signed to simulate high-intensity charged particle beams and plasmas in both the electrostatic and electromagnetic regimes, with a wide variety of integrated physics models and diagnostics. At pre-sent, Sirepo supports a small subset of Warp’s capabilities. Warp is open source and is part of the Berkeley Lab Accelerator Simulation Toolkit.

Nagler, Robert↗

Synthetic Proxy Infrastructure for Task Evaluation

The Synthetic Proxy Infrastructure for Task Evaluation is a proxy application designed to support application developers in gauging the performance of various task granularities when determining how best to utilize task based programming models.The infrastructure is designed to provide examples of common communication patterns with a synthetic workload intended to provide performance data to evaluate programming model and platform overheads for the purpose of determining task granularity for task decomposition purposes. This is presented as a reference implementation of a proxy application with run-time configurable input and output task dependencies ranging from an embarrassingly parallel scenario to patterns with stencil-like dependencies upon their nearest neighbors. Once all, if any, inputs are satisfied each task will execute a synthetic workload (a simple DGEMM of in this case) of varying size and output all, if any, outputs to the next tasks.The intent is for this reference implementation to be implemented as a proxy app in different programming models so as to provide the same infrastructure and to allow for application developers to simulate their own communication needs to assist in task decomposition under various models on a given platform.

Junghans, Christoph↗

Synthetic Proxy Infrastructure for Task Evaluation

The Synthetic Proxy Infrastructure for Task Evaluation is a proxy application designed to support application developers in gauging the performance of various task granularities when determining how best to utilize task based programming models.The infrastructure is designed to provide examples of common communication patterns with a synthetic workload intended to provide performance data to evaluate programming model and platform overheads for the purpose of determining task granularity for task decomposition purposes. This is presented as a reference implementation of a proxy application with run-time configurable input and output task dependencies ranging from an embarrassingly parallel scenario to patterns with stencil-like dependencies upon their nearest neighbors. Once all, if any, inputs are satisfied each task will execute a synthetic workload (a simple DGEMM of in this case) of varying size and output all, if any, outputs to the next tasks.The intent is for this reference implementation to be implemented as a proxy app in different programming models so as to provide the same infrastructure and to allow for application developers to simulate their own communication needs to assist in task decomposition under various models on a given platform.

Junghans, Christoph↗

Panda: A Compiler Framework for Concurrent CPU $+$ GPU Execution of 3D Stencil Computations on GPU-accelerated Supercomputers

We present a new compiler framework for truly heterogeneous 3D stencil computation on GPU clusters. Our framework consists of a simple directive-based programming model and a tightly integrated source-to-source compiler. Annotated with a small number of directives, sequential stencil C codes can be automatically parallelized for large-scale GPU clusters. The most distinctive feature of the compiler is its capability to generate hybrid MPI$+$ CUDA$+$ OpenMP code that uses concurrent CPU$+$ GPU computing to unleash the full potential of powerful GPU clusters. The auto-generated hybrid codes hide the overhead of various data motion by overlapping them with computation. Test results on the Titan supercomputer and the Wilkes cluster show that auto-translated codes can achieve about 90 % of the performance of highly optimized handwritten codes, for both a simple stencil benchmark and a real-world application in cardiac modeling. The user-friendliness and performance of our domain-specific compiler framework allow harnessing the full power of GPU-accelerated supercomputing without painstaking coding effort.

97 MATHEMATICS AND COMPUTING↗

Patterns, drivers, and a predictive model of dam removal cost in the United States

Given the burgeoning dam removal movement and the large number of dams approaching obsolescence in the United States, cost estimating data and tools are needed for dam removal prioritization, planning, and execution. We used the list of removed dams compiled by American Rivers to search for publicly available reported costs for dam removal projects. Total cost information could include component costs related to project planning, dam deconstruction, monitoring, and several categories of mitigation activities. We compiled reported costs from 455 unique sources for 668 dams removed in the United States from 1965 to 2020. The dam removals occurred within 571 unique projects involving 1–18 dams. When adjusted for inflation into 2020 USD, cost of these projects totaled $\$1.522$ billion, with per-dam costs ranging from $\$1$ thousand (k) to $\$268.8$ million (M). The median cost for dam removals was $\$157$k, $\$823$k, and $\$6.2$M for dams that were< 5 m, between 5–10 m, and > 10 m in height, respectively. Geographic differences in total costs showed that northern states in general, and the Pacific Northwest in particular, spent the most on dam removal. The Midwest and the Northeast spent proportionally more on removal of dams less than 5 m in height, whereas the Northwest and Southwest spent the most on larger dam removals > 10 m tall. We used stochastic gradient boosting with quantile regression to model dam removal cost against potential predictor variables including dam characteristics (dam height and material), hydrography (average annual discharge and drainage area), project complexity (inferred from construction and sediment management, mitigation, and post-removal cost drivers), and geographic region. Dam height, annual average discharge at the dam site, and project complexity were the predominant drivers of removal cost. The final model had an R 2 of 57% and when applied to a test dataset model predictions had a root mean squared error of $\$5.09$M and a mean absolute error of $\$1.45$M, indicating its potential utility to predict estimated costs of dam removal. We developed a R shiny application for estimating dam removal costs using customized model inputs for exploratory analyses and potential dam removal planning.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Impact of High Performance Computing on the Detailed Simulation of Subsurface Flow and Contaminant Transport Using eSTOMP - 16341

The ability to model subsurface processes at the field-scale is essential to site closure and remedial action decisions. Field-scale models often require high-performance computing to meet the computational demands associated with complex systems, model calibration, and uncertainty quantification. eSTOMP, a parallel version of STOMP, is an analytical tool that meets the need for investigating coupled processes in the subsurface involving regional multi-fluid flow and biogeochemistry. The scalability of eSTOMP makes it ideal for simulating contaminant and geochemical reactive transport when long run times result from execution of a serial code. To demonstrate the impact of high-performance computation on subsurface analyses, the application of eSTOMP is presented for two sites. The first site involves uranium surface complexation within a highly dynamic, variably saturated flow field. The use of this model in conjunction with continued field monitoring is expected to provide a rigorous basis for developing operational strategies for field remediation and for defining defensible remediation endpoints. The second site involves the long-term dissolution of low-level radioactive glass emplaced within a near-surface repository. The waste form release rate is evaluated by modeling the basic physical and chemical processes that are known to control the waste form dissolution behavior, including pH and composition of the fluid contacting the glass. Simulations demonstrate that glass dissolution rates vary both in time and as a function of position within the disposal system, and that a 'leach rate' or radionuclide release rate parameter can only be estimated after identifying these impacts in a dynamic system. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DeepClone: Lightweight State Replication of Deep Learning Models for Data Parallel Training

Training modern deep neural network (DNN) models involves complex workflows triggered by model exploration, sensitivity analysis, explainability, etc. A key primitive in this context is the ability to clone a model training instance, i.e. “fork” the training process in a potentially different direction, which enables comparisons of different evolution paths using variations of training data and model parameters. However, in a quest improve the training throughput, a mix of data parallel, model parallel, pipeline parallel and layer-wise parallel approaches are making the problem of cloning highly complex. In this paper, we explore the problem of efficient cloning under such circumstances. To this end, we leverage several properties of data-parallel training and layer-wise parallelism to design DeepClone, a cloning approach based on augmenting the execution graph to gain direct access to tensors, which are then sharded and reconstructed asynchronously in order to minimize runtime overhead, standby duration, readiness duration. Compared with state-of-art approaches, DeepClone shows orders of magnitude improvement for several classes of DNN models.

data-parallel training↗

Generation of Reversible C++ Code for Optimistic Parallel Discrete Event Simulation

The reversible execution of C/C++ code has been a target of research and engineering for more than a decade as reversible computation has become a central notion in large-scale parallel discrete event simulation (PDES). The simulation models that are implemented for PDES are of increasing complexity and size and require various language features to support abstraction, encapsulation, and composition when building a simulation model. In this paper, we focus on parallel simulation models that are written with user-defined C++ abstractions and abstractions of the C++ Standard Library. We present an approach based on incremental state saving for establishing reversibility of C++ and an evaluation for a kinetic Monte-Carlo simulation implemented in C++. Although a significant runtime overhead is introduced with our technique, it is an enormous win that it allows using the entire C++ language, and has that code automatically transformed into reversible code to enable parallel execution with the Rensselaer’s optimistic simulation system (ROSS).

97 MATHEMATICS AND COMPUTING↗

SU-D-9A-03: STAMP: Simulator for Texture Analysis in MRI/PET

Purpose: To develop a convenient simulation platform to facilitate PET/MR image analysis with the prospect of gaining a better understanding of the influence of acquisition parameters on PET/MRI textural features. The simulation platform is demonstrated by showing textural variations of a representative case study using different image acquisition parameters. Methods: The simulation platform is composed of MRI simulators JEMRIS and SIMRI to achieve simulations of customized MRI sequences on sample tumor models. The PET simulator GATE is used to get 2D and 3D Monte Carlo acquisitions of voxelized PET sources using a phantom geometry and a customized scanner architecture. The platform incorporates a series of graphical user interfaces written in Matlab. Two GUIs are used to facilitate communication with the simulation executables installed on a computer cluster. A third GUI is used to collect and display the clinical and simulated images, as well as fused PET/MRI images, and perform computation of textural features.To illustrate the capabilities of this platform, one FDG-PET and T1-weighted (T1w) digitized tumor models were generated from clinical images of a soft-tissue sarcoma patient. Numerically simulated MR images were produced using 3 different echo times (TE) and 5 different repetition times (TR). PET 2D images were simulated using an OSEM algorithm with 1 to 32 iterations and a post-reconstruction Gaussian filter of 0, 2, 4 or 6 mm width. Results: STAMP was successfully used to produce numerically simulated FDG-PET and MRI images, and to calculate their corresponding textures. Three typical textures (GLCM-Contrast, GLSZM-ZSV and NGTDM-Coarseness) were found to vary by a range of 45% on average compared to reference scanning conditions in the case of FDG-PET, and by a range of 40% in the case of T1w MRI. Conclusion: We have successfully developed a Matlab-based simulation platform to facilitate PET/MRI texture image analysis for outcome prediction.

60 APPLIED LIFE SCIENCES↗

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient 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 and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗

Providing performance portable numerics for Intel GPUs

Summary With discrete Intel GPUs entering the high‐performance computing landscape, there is an urgent need for production‐ready software stacks for these platforms. In this article, we report how we enable the Ginkgo math library to execute on Intel GPUs by developing a kernel backed based on the DPC++ programming environment. We discuss conceptual differences between the CUDA and DPC++ programming models and describe workflows for simplified code conversion. We evaluate the performance of basic and advanced sparse linear algebra routines available in Ginkgo's DPC++ backend in the hardware‐specific performance bounds and compare against routines providing the same functionality that ship with Intel's oneMKL vendor library.

97 MATHEMATICS AND COMPUTING↗

A flow-through gamma detection system for sub-surface radioxenon tracer measurements in LYNM PE1

A continuous flow-through, real-time radioxenon sensor array has been designed to monitor either 127 Xe or 133 Xe tracer gas as part of a series of underground chemical explosions in the Low-Yield Nuclear Monitoring (LYNM) Physics Experiment 1 (PE1). The sensors are pairs of shielded thallium-doped sodium iodide gamma-ray detectors that surround a gas measurement chamber. Each measurement chamber is connected to a sampling location in the geology surrounding the chemical explosion or in the access tunnel. The first experiment in the series, PE1 A, occurred in 2023 and the system quantified the 127 Xe tracer gas in the gas sampling lines for four weeks following the experiment execution. The array generated a set of radioxenon concentration time series with a 15-minute resolution that will be used to refine subsurface gas transport models.

Gamma-ray coincidence detection↗

Discovering hidden geothermal signatures using non-negative matrix factorization with customized k-means clustering

Discovery of hidden geothermal resources is challenging. It requires the mining of large datasets with diverse data attributes representing subsurface hydrogeological and geothermal conditions. The commonly used play fairway analysis approach typically incorporates subject-matter expertise to analyze regional data to estimate geothermal characteristics and favorability. We demonstrate an alternative approach based on machine learning (ML) to process a geothermal dataset from southwest New Mexico (SWNM). The study region includes low- and medium-temperature hydrothermal systems. Several of these systems are not well characterized because of insufficient existing data and limited past explorative work. This study discovers hidden patterns and relations in the SWNM geothermal dataset to improve our understanding of the regional hydrothermal conditions and energy-production favorability. This understanding is obtained by applying an unsupervised ML algorithm based on non-negative matrix factorization coupled with customized k-means clustering (NMFk). NMFk can automatically identify (1) hidden signatures characterizing analyzed datasets, (2) the optimal number of these signatures, (3) the dominant data attributes associated with each signature, and (4) the spatial distribution of the extracted signatures. Here, in this study, NMFk is applied to analyze 18 geological, geophysical, hydrogeological, and geothermal attributes at 44 locations in SWNM. Using NMFk, we find data patterns and identify the spatial associations of hydrothermal signatures within two physiographic provinces (Colorado Plateau and Basin and Range) and two sub-regions of these provinces (the Mogollon-Datil volcanic field and the Rio Grande rift) in SWNM. The ML algorithm extracted five hydrothermal signatures in the SWNM datasets that differentiate between low (<90°C) and medium (90-150°C)-temperature hydrothermal systems. The algorithm also suggests that the Rio Grande rift and northern Mogollon-Datil volcanic field are the most favorable regions for future geothermal resource discovery. NMFk also identified critical attributes to identify medium-temperature hydrothermal systems in the study area. The resulting NMFk model can be applied to predict geothermal conditions and their uncertainties at new SWNM locations based on limited data from unexplored regions. The code to execute the performed analyses as well as the corresponding data can be found at https://github.com/SmartTensors/GeoThermalCloud.jl.

15 GEOTHERMAL ENERGY↗

Expressing Parallelism with ROOT

The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scaling the robustness of the solutions for quantum controllable problems

The major task in quantum control theory is to find an external field that transforms the system from one state to another or executes a predetermined unitary transformation. We investigate the difficulty of computing the control field as the size of the Hilbert space is increased. In the models studied the controls form a small closed subalgebra of operators. Complete controllability is obtained by the commutators of the controls with the stationary Hamiltonian. We investigate the scaling of the computation effort required to converge a solution for the quantum control task with respect to the size of the Hilbert space. The models studied include the double-well Bose Hubbard model with the SU(2) control subalgebra and the Morse oscillator with the Heisenberg-Weil algebra. We find that for initial and target states that are classified as generalized coherent states (GCSs) of the control subalgebra the control field is easily found independent of the size of the Hilbert space. For such problems, a control field generated for a small system can serve as a pilot for finding the field for larger systems. Attempting to employ pilot fields that generate superpositions of GCSs or cat states failed. No relation was found between control solutions of different Hilbert space sizes. In addition the task of finding such a field scales unfavorably with Hilbert space sizes. We demonstrate the use of symmetry to obtain quantum transitions between states without phase information. Implications to quantum computing are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗