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 217 records · Page 12

Wave tank and bench-top control testing of a wave energy converter

An increasing number of experiments are being conducted to study the design and performance of wave energy converters. Often in these tests, a real-time realization of prospective control algorithms is applied in order to assess and optimize energy absorption as well as other factors. This paper details the design and execution of an experiment for evaluating the capability of a model-scale WEC to execute basic control algorithms. Model-scale hardware, system, and experimental design are considered, with a focus on providing an experimental setup capable of meeting the dynamic requirements of a control system. To more efficiently execute such tests, a dry bench testing method is proposed and utilized to allow for controller tuning and to give an initial assessment of controller performance; this is followed by wave tank testing. The trends from the dry bench test and wave tank test results show good agreement with theory and confirm the ability of a relatively simple feedback controller to substantially improve energy absorption. Additionally, the dry bench testing approach is shown to be an effective and efficient means of designing and testing both controllers and actuator systems for wave energy converters.

16 TIDAL AND WAVE POWER↗

NEAMS Workbench and Bison Fuel Performance Remote Application Configuration

The mission of the US Department of Energy (DOE) Nuclear Energy Advanced Modeling and Simulation (NEAMS) Program is to develop, apply, deploy, and support state-of-the-art predictive modeling and simulation tools for the design and analysis of current and future nuclear energy systems. This is accomplished using computing architectures that range from laptops to leadership class facilities. The NEAMS Workbench [1,2,3] initiative will facilitate the transition from conventional computer codes to high-fidelity ones by providing a common analysis environment and interface for model creation, review, execution, output review, and visualization for integrated codes. The BISON fuel performance code [4] is a finite element method (FEM)-based software being developed by multiple organizations led by the Idaho National Laboratory for the US Department of Energy Office of Nuclear Energy. BISON can simulate a variety of fuel and cladding compositions and geometries in varying dimensionalities, depending upon the problem type and complexity, including one-dimensional (1D), 1.5D, 2D axially symmetric (2D-rz), 2D radial-azimuthal (2D-rθ), or 3D models. The NEAMS Workbench allows execution of the BISON fuel performance code on local and remote compute resources. In this report, the detailed instructions of configuring the NEAMS Workbench for remote execution of the BISON fuel performance code on a portable batch system (PBS)-scheduled compute resource, as well the transfer of associated Bison files, is illustrated.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

An introduction to TR-X: a simplified tool for standardized analysis

TR-X is a multi-platform program that provides a graphical interface to Monte Carlo N-Particle transport (MCNP) and Monte Carlo N-Particle transport eXtended (MCNPX) codes. Included in this interface are tools to reduce the tedium of input file creation, provide standardization of model creation and analysis, and expedite the execution of the created models. TR-X provides tools to make the rapid testing of multiple permutations of these models easier, while also building in standardization that allows multiple solutions to be compared.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

A Global View Programming Abstraction for Transitioning MPI Codes to PGAS Languages

The multicore generation of scientific high performance computing has provided a platform for the realization of Exascale computing, and has also underscored the need for new paradigms in coding parallel applications. The current standard for writing parallel applications requires programmers to use languages designed for sequential execution. These languages have abstractions that only allow programmers to operate on the process centric local view of data. To provide suitable languages for parallel execution, many research efforts have designed languages based on the Partitioned Global Address Space (PGAS) programming model. Chapel is one of the more recent languages to be developed using this model. Chapel supports multithreaded execution with high-level abstractions for parallelism. With Chapel in mind, we have developed a set of directives that serve as intermediate expressions for transitioning scientific applications from languages designed for sequential execution to PGAS languages like Chapel that are being developed with parallelism in mind.

Global Domain↗

Scalable Replay with Partial-Order Dependencies for Message-Logging Fault Tolerance

Deterministic replay of a parallel application is commonly used for discovering bugs or to recover from a hard fault with message-logging fault tolerance. For message passing programs, a major source of overhead during forward execution is recording the order in which messages are sent and received. During replay, this ordering must be used to deterministically reproduce the execution. Previous work in replay algorithms often makes minimal assumptions about the programming model and application in order to maintain generality. However, in many cases, only a partial order must be recorded due to determinism intrinsic in the code, ordering constraints imposed by the execution model, and events that are commutative (their relative execution order during replay does not need to be reproduced exactly). In this paper, we present a novel algebraic framework for reasoning about the minimum dependencies required to represent the partial order for different concurrent orderings and interleavings. By exploiting this theory, we improve on an existing scalable message-logging fault tolerance scheme. The improved scheme scales to 131,072 cores on an IBM BlueGene/P with up to 2x lower overhead than one that records a total order.

fault tolerance↗

Quantum Accelerators for High-performance Computing Systems

We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and conventional programs challenges the intersection of these computational models. Following a brief overview of the state of the art, we discuss recent advances in programming and execution models for hybrid quantum-classical computing. We discuss a novel quantum-accelerator framework that uses specialized kernels to offload select workloads while integrating with existing computing infrastructure. We elaborate on the role of the host operating system to manage these unique accelerator resources, the prospects for deploying quantum modules, and the requirements placed on the language hierarchy connecting these different system components. We draw on recent advances in the modeling and simulation of quantum computing systems with the development of architectures for hybrid high-performance computing systems and the realization of software stacks for controlling quantum devices. Finally, we present simulation results that describe the expected system-level behavior of high-performance computing systems composed from compute nodes with quantum processing units. We describe performance for these hybrid systems in terms of time-to-solution, accuracy, and energy consumption, and we use simple application examples to estimate the performance advantage of quantum acceleration.

Humble, Travis↗

Reversible Parallel Discrete Event Formulation of a TLM-based Radio Signal Propagation Model

Radio signal strength estimation is essential in many applications, including the design of military radio communications and industrial wireless installations. For scenarios with large or richly- featured geographical volumes, parallel processing is required to meet the memory and computa- tion time demands. Here, we present a scalable and efficient parallel execution of the sequential model for radio signal propagation recently developed by Nutaro et al. Starting with that model, we (a) provide a vector-based reformulation that has significantly lower computational overhead for event handling, (b) develop a parallel decomposition approach that is amenable to reversibility with minimal computational overheads, (c) present a framework for transparently mapping the conservative time-stepped model into an optimistic parallel discrete event execution, (d) present a new reversible method, along with its analysis and implementation, for inverting the vector-based event model to be executed in an optimistic parallel style of execution, and (e) present performance results from implementation on Cray XT platforms. We demonstrate scalability, with the largest runs tested on up to 127,500 cores of a Cray XT5, enabling simulation of larger scenarios and with faster execution than reported before on the radio propagation model. This also represents the first successful demonstration of the ability to efficiently map a conservative time-stepped model to an optimistic discrete-event execution.

99 GENERAL AND MISCELLANEOUS↗

Development and Testing of CTF to Support Modeling of BWR Operating Conditions

This milestone supports developing and assessing COBRA-TF (CTF) for the modeling of boiling water reactors (BWRs). This is achieved in three stages. First, a new preprocessor utility that is capable of handling BWR-specic design elements (e.g., channel boxes and large water rods) is developed. A previous milestone (L3:PHI.CTF.P12.01) led to the development of this preprocessor capability for single assembly models. This current milestone expands this utility so that it is applicable to multi-assembly BWR models that can be modeled in either serial or parallel. The second stage involves making necessary modications to CTF so that it can execute these new models. Specically, this means implementing an outer-iteration loop, specic to BWR models, that equalizes the pressure loss over all assemblies in the core (which are not connected due to the channel boxes) by adjusting inlet mass ow rate. A third stage involves assessing the standard convergence metrics that are used by CTF to determine when a simulation is steady-state. The nal stage has resulted in the implementation of new metrics in the code that give a better indication of how steady the solution is at convergence. This report summarizes these eorts and provides a demonstration of CTF's BWR-modeling capabilities. CASL-U-2016-1030-000

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

ATDM LANL FleCSI: Topology and Execution Framework

FleCSI is a compile-time configurable C++ framework designed to support multi-physics application development. As such, FleCSI attempts to provide a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. This means that FleCSI is potentially useful to many different ECP projects. Current support includes multidimensional mesh topology, mesh geometry, and mesh adjacency information, n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures (to identify data dependencies between distributed-memory address spaces). FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent with state-of-the-art task-based runtimes such as Legion and Charm++. The model also provides support for fine-grained, data-parallel execution with backend support for runtimes such as OpenMP and C++17. The FleCSI abstraction layer provides the developer with insulation from the underlying runtimes, while allowing support for multiple runtime systems, including conventional models like asynchronous MPI. The intent is to give developers a concrete set of user-friendly programming tools that can be used now, while allowing flexibility in choosing runtime implementations and optimizations that can be applied to architectures and runtimes that arise in the future. This project is essential to the ECP Ristra Next-Generation Code project, part of ASC ATDM, because it provides a hierarchically parallel programming model that is consistent with the design of modern system architectures, but which allows for the straightforward expression of algorithmic parallelism in a portably performant manner.

97 MATHEMATICS AND COMPUTING↗

Embedded, Real-Time, and Distributed Traveling Wave Fault Location Method Using Graph Convolutional Neural Networks

This work proposes and develops an implementation of a fault location method to provide a fast and resilient protection scheme for power distribution systems. The method analyzes the transient dynamics of traveling waves (TWs) to generate features using the discrete wavelet transform (DWT), which are then used to train several graph convolutional network (GCN) models. Faults are simulated in the IEEE 34-node system, which is divided into three protection zones (PZs). The goal is to identify the PZ in which the fault occurs. The GCN models create a distributed protection scheme, as all nodes are able to retrieve a prediction. Given that message-passing between nodes occurs both during training and in the execution of the model, the resiliency of such schemes to communication losses was analyzed and demonstrated. One of the models, which only uses voltage measurements, was implemented on a Texas Instruments F28379D development board. The execution times were monitored to assess the speed of the protection scheme. It is shown that the proposed method can be executed in approximately a millisecond, which is comparable to existing TW protection in the transmission system. For experimental purposes, a DWT-based detection method is employed. A design of a setup to playback TWs using two development boards is also addressed.

Jiménez-Aparicio, Miguel (ORCID:000000016864461X)↗

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS↗

Scalable Parallel Execution of an Event-based Radio Signal Propagation Model for Cluttered 3D Terrains

Radio signal strength estimation is essential in many applications, including the design of military radio communications and industrial wireless installations. While classical approaches such as finite difference methods are well-known, new event-based models of radio signal propagation have been recently shown to deliver such estimates faster (via serial execution) than other methods. For scenarios with large or richly-featured geographical volumes, however, parallel processing is required to meet the memory and computation time demands. Here, we present a scalable and efficient parallel execution of a recently-developed event-based radio signal propagation model. We demonstrate its scalability to thousands of processors, with parallel speedups over 1000x. The speed and scale achieved by our parallel execution enable larger scenarios and faster execution than has ever been reported before.

99 GENERAL AND MISCELLANEOUS↗

Elements of complexity in subsurface modeling, exemplified with three case studies

There are complexity elements to consider when applying subsurface flow and transport models to support environmental analyses. Modelers balance the benefits and costs of modeling along the spectrum of complexity, taking into account the attributes of more simple models (e.g., lower cost, faster execution, easier to explain, less mechanistic) and the attributes of more complex models (higher cost, slower execution, harder to explain, more mechanistic and technically defensible). In this paper, modeling complexity is examined with respect to considering this balance. The discussion of modeling complexity is organized into three primary elements: 1) modeling approach, 2) description of process, and 3) description of heterogeneity. Three examples are used to examine these complexity elements. Two of the examples use simulations generated from a complex model to develop simpler models for efficient use in model applications. The first example is designed to support performance evaluation of soil vapor extraction remediation in terms of groundwater protection. The second example investigates the importance of simulating different categories of geochemical reactions for carbon sequestration and selecting appropriate simplifications for use in evaluating sequestration scenarios. In the third example, the modeling history for a uranium-contaminated site demonstrates that conservative parameter estimates were inadequate surrogates for complex, critical processes and there is discussion on the selection of more appropriate model complexity for this application. All three examples highlight how complexity considerations are essential to create scientifically defensible models that achieve a balance between model simplification and complexity.

conceptual models↗

Seismic Waveform Inversion Capability on Resource-Constrained Edge Devices

Seismic full wave inversion (FWI) is a widely used non-linear seismic imaging method used to reconstruct subsurface velocity images, however it is time consuming, has high computational cost and depend heavily on human interaction. Recently, deep learning has accelerated it’s use in several data-driven techniques, however most deep learning techniques suffer from overfitting and stability issues. In this work, we propose an edge computing-based data-driven inversion technique based on supervised deep convolutional neural network to accurately reconstruct the subsurface velocities. Deep learning based data-driven technique depends mostly on bulk data training. In this work, we train our deep convolutional neural network (DCN) (UNet and InversionNet) on the raw seismic data and their corresponding velocity models during the training phase to learn the non-linear mapping between the seismic data and velocity models. The trained network is then used to estimate the velocity models from new input seismic data during the prediction phase. The prediction phase is performed on a resource-constrained edge device such as Raspberry Pi. Raspberry Pi provides real-time and on-device computational power to execute the inference process. In addition, we demonstrate robustness of our models to perform inversion in the presence on noise by performing both noise-aware and no-noise training and feeding the resulting trained models with noise at different signal-to-noise (SNR) ratio values. We make great efforts to achieve very feasible inference times on the Raspberry Pi for both models. Specifically, the inference times per prediction for UNet and InversionNet models on Raspberry Pi were 22 and 4 s respectively whilst inference times for both models on the GPU were 2 and 18 s which are very comparable. Finally, we have designed a user-friendly interactive graphical user interface (GUI) to automate the model execution and inversion process on the Raspberry Pi.

Manu, Daniel (ORCID:0000000154982677)↗

Update on Parallel Process Execution in the Next Generation System Analysis Model

As of the end of 2021, 88,880 metric tons of heavy metal (MTHM) (44,741 MTHM in dry storage; 44,139 MTHM in wet storage) of spent nuclear fuel (SNF) were stored at various reactor sites across the United States [1]. The Office of Storage and Transportation in the Department of Energy is planning for the transportation, storage, and eventual disposal of SNF and high-level radioactive waste (HLW). To aid in this effort and inform decision-makers about the backend of the spent fuel cycle, systems analysis tools capable of analyzing the various options with respect to SNF and HLW management are being used as well as continuously improved to meet the evolving needs of the program. System analysts typically use these tools to vary underlying assumptions (shipping rates, allocation priority, available facilities, start dates, etc.) and study the implications of these changes on site clearance schedules, campaign costs, transportation infrastructure acquisition, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

AIF for Vis (Active Inference for simulating human interpretation of data visualization) [SWR-26-084]

AIF for Vis contains the Active Inference models and analysis scripts used to study a simple visualization-interpretation task: estimating the average value of two bars in a bar chart. The work is a proof of concept for translating hypothesized cognitive strategies into executable, inspectable process models. We implement two idealized strategies inspired by dual-process accounts of visualization-aided decision making: *Fast model: a compressed, heuristic strategy that estimates the visual midpoint of the two bars and maintains a single belief over their average. *Slow model: a sequential, analytic strategy that estimates the two bar heights separately and maintains them in working memory before computing an average. Both models use a common Active-Inference-inspired framework for sequential perception, belief updating, action selection, and reporting. Their different internal representations produce distinct predicted vulnerabilities: *the Fast model is more susceptible to tick-salience bias; *the Slow model is more susceptible to working-memory decay. The repository includes the model implementations, scripts used for the experiments reported in the paper, precomputed trial-level results, and plotting scripts.

Goldwyn, Harrison [National Laboratory of the Rock↗

Update on Parallel Process Execution in the Next Generation System Analysis Model (NGSAM)

As of the end of 2022, it is estimated that over 90,000 metric tons of heavy metal (MTHM) of spent nuclear fuel (SNF) were stored at various commercial nuclear power reactor sites (both operating and shutdown) across the United States [1]. The Office of Storage and Transportation within the U.S. Department of Energy’s Office of Nuclear Energy is planning for the transportation, storage, and eventual disposal of SNF and high-level radioactive waste (HLW). To aid in this effort and inform decision-makers about the backend of the spent fuel cycle, systems analysis tools capable of analyzing the various options with respect to SNF and HLW management are being used as well as continuously improved to meet the evolving needs of the program. System analysts typically use these tools to vary underlying assumptions (shipping rates, available facilities, start dates, interim storage capacity, etc.) and study the associated system implications such as timing for clearing sites of SNF, various cost elements, transportation infrastructure acquisition needs, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

An optimization model for collection, haul, transfer, treatment and disposal of infectious medical waste: Application to a Greek region

Highlights: • We developed an optimization model to minimize cost of infectious waste management. •Two different software were used for model solution. • Model optimizes locations and capacities of treatment plants and transfer stations. • The higher percentage of total cost was due to construction of the treatment plant. • Sensitivity analysis with respect to fuel cost and waste production was conducted. - Abstract: The objective of this work was to develop an optimization model to minimize the cost of a collection, haul, transfer, treatment and disposal system for infectious medical waste (IMW). The model calculates the optimum locations of the treatment facilities and transfer stations, their design capacities (t/d), the number and capacities of all waste collection, transport and transfer vehicles and their optimum transport path and the minimum IMW management system cost. Waste production nodes (hospitals, healthcare centers, peripheral health offices, private clinics and physicians in private practice) and their IMW production rates were specified and used as model inputs. The candidate locations of the treatment facilities, transfer stations and sanitary landfills were designated, using a GIS-based methodology. Specifically, Mapinfo software with exclusion criteria for non-appropriate areas was used for siting candidate locations for the construction of the treatment plant and calculating the distance and travel time of all possible vehicle routes. The objective function was a non-linear equation, which minimized the total collection, transport, treatment and disposal cost. Total cost comprised capital and operation costs for: (1) treatment plant, (2) waste transfer stations, (3) waste transport and transfer vehicles and (4) waste collection bins and hospital boxes. Binary variables were used to decide whether a treatment plant and/or a transfer station should be constructed and whether a collection route between two or more nodes should be followed. Microsoft excel software was used as installation platform of the optimization model. For the execution of the optimization routine, two completely different software were used and the results were compared, thus, resulting in higher reliability and validity of the results. The first software was Evolver, which is based on the use of genetic algorithms. The second one was Crystal Ball, which is based on Monte Carlo simulation. The model was applied to the Region of East Macedonia – Thrace in Greece. The optimum solution resulted in one treatment plant located in the sanitary landfill area of Chrysoupolis, required no transfer stations and had a total management cost of 38,800 €/month or 809 €/t. If a treatment plant is sited in the most eastern part of the Region, i.e., the industrial area of Alexandroupolis, the optimum solution would result in a transfer station of 23 m{sup 3}, located near Kavala General Hospital, and a total cost of 39,800 €/month or 831 €/t. A sensitivity analysis was conducted and two alternative scenarios were optimized. In the first scenario, a 15% rise in fuel cost and in the second scenario a 25% rise in IMW production were considered. At the end, a cost calculation in €/t/km for every type of vehicle used for haul and transfer was conducted. Also, the cost of the whole system was itemized and calculated in €/t/km and €/t. The results showed that the higher percentage of the total cost was due to the construction of the treatment plant.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗