Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “execution time”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Derivation of Formulations 1 and 1A of Farassat

Formulations 1 and 1A are the solutions of the Ffowcs Williams-Hawkings (FW-H) equation with surface sources only when the surface moves at subsonic speed. Both formulations have been successfully used for helicopter rotor and propeller noise prediction for many years although we now recommend using Formulation 1A for this purpose. Formulation 1 has an observer time derivative that is taken numerically, and thus, increasing execution time on a computer and reducing the accuracy of the results. After some discussion of the Green's function of the wave equation, we derive Formulation 1 which is the basis of deriving Formulation 1A. We will then show how to take this observer time derivative analytically to get Formulation 1A. We give here the most detailed derivation of these formulations. Once you see the whole derivation, you will ask yourself why you did not do it yourself!

Farassat, F.↗
NASA NTRS2020

Using a Model of Scheduler Runtime to Improve the Effectiveness of Scheduling Embedded in Execution

Scheduling often interacts with execution. When the scheduler is developing a schedule, real time (execution) proceeds. Usually a scheduler cannot modify portions of the schedule expected to start execution prior to the scheduler's expected completion. In deployed systems, often little effort is spent on predicting scheduler runtime and instead an extremely conservative, simple model is used, resulting in loss of performance as less of the schedule can be updated. We develop predictive model(s) of scheduler runtime and use these models to improve scheduler and execution performance. We present several models of scheduler runtime based on a scheduler being deployed onboard NASA's next Mars rover, the M2020 rover Perseverance. The models consider algorithmic complexity, characteristics of the input plan, and prior runtime data. First, we show how these still relatively unsophisticated models can more accurately predict scheduler runtime compared to the static conservative baseline being used for the actual M2020 onboard scheduler. Second, we show how the more accurate scheduler runtime models' tighter (shorter) runtime predictions enable better scheduler performance as measured by makespan and percentage of activities executed. Finally, we discuss a number of future steps to further advance this line of work.

Chi, Wayne↗
DOE OSTI2025

A real-time distributed solid oxide electrolysis cell (SOEC) model for cyber-physical simulation

System integration and dynamic operability between SOEC and balance-of-plant (BoP) components are major technical challenges before realizing rapid load following of SOEC systems. Cyber-physical simulation (CPS) is a leading-edge digital engineering approach and is regarded as the next step beyond Digital Twins. CPS approach can be used to research SOEC system integration and develop dynamic controls prior to actual pilot testing without using a real SOEC. To seamlessly couple with BoP hardware and access non-observable operational parameters (e.g., local temperature gradient) during transients, a distributed one-dimensional (1D) real-time SOEC model was developed. Its real-time execution was demonstrated for 20 to 640 nodes at the fixed time step of 5 ms. A higher excess air ratio enabled smaller local temperature gradients on SOEC solid materials and faster transients upon current density step change from 0.15 to 0.55 A cm -2 . During the transients, the magnitude of the peak temperature gradient nearly doubled in 10 s from -3.5 to -5.9 °C cm -1 . This represents a significant operating risk that can impact the dynamic operability of SOEC systems. In addition, the local temperature gradient was found to change directions on all nodes in SOEC solid materials, with the greatest impact on the upstream nodes. The SOEC model was also tested at the thermal neutral voltage using actual process air flow parameters as variable model inputs. Variable process air temperatures were found to induce alternating local temperature gradients on SOEC solid materials. These are new operational mechanisms for SOEC degradation relevant for load following operational modes yet distinct from previous reports. To mitigate these unfavorable features, the SOEC can be operated at voltages that are slightly (±20 mV) deviated from the thermal neutral voltage. Here, the corresponding net thermal energy change was less than 1.6% of the electric power consumption. This 1D real-time SOEC model established the basis of cyber-physical simulation of SOEC hybrid systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRSDate not supplied

The Satellite Flythrough and Reconstruction Softwares at CCMC

The next-generation of model data visualization to be offered at the Community Coordinated Modeling Center (CCMC) will be based on Kamodo, an open source python package. To increase the usefulness of our services, we are also developing new capabilities based on this software, called the satellite flythrough and the reconstruction tools, to be offered both as packages for offline analysis and through an online interface (coming soon). The satellite flythrough software ‘flies’ a satellite trajectory, whether real or imaginary, through either model data hosted at CCMC or on a personal machine. This service greatly simplifies the complexity of users’ access to model data, abstracting away the time-consuming details of model data formats and interpolation. We demonstrate execution times of a few seconds to a few minutes for several example flythroughs of a trajectory stretching over a few days, depending on the parameters chosen. We also demonstrate a reconstruction tool built on top of the satellite flythrough software, for use with mission planning and model-data comparisons. This tool, based on reconstructions provided for the GDC Science and Technology Definition Team, converts multiple, simultaneous satellite flythroughs into two-dimensional reconstructions. The reconstruction tool provides a software capability for satellite constellations to determine how many satellites are needed and in what configuration to resolve the desired features in the model data. Both tools are currently available through GitHub for a selection of CCMC-hosted ITM models. Finally, we present initial results from work in progress and plans for future work, including an expansion of the reconstruction tool to provide 3D reconstruction capabilities and a line-of-sight calculation tool.

software, python↗
DOE OSTI2021

Coding the Computing Continuum: Fluid Function Execution in Heterogeneous Computing Environments

Advances in network technologies have greatly decreased barriers to accessing physically distributed computers. This newfound accessibility coincides with increasing hardware specialization, creating exciting new opportunities to dispatch workloads to the best resource for a specific purpose, rather than those that are closest or most easily accessible. We present Delta, a service designed to intelligently schedule function-based workloads across a distributed set of heterogeneous computing resources. Delta implements an extensible architecture in which different predictors and scheduling algorithms can be integrated to provide dynamically evolving estimates of function execution times on different resources-estimates that can be used to determine the most appropriate location for execution. We describe predictors for function runtime, data transfer time, and cold-start resource provisioning and configuration delay; dynamic learning methods that update predictor models over time; and scheduling strategies that take into account both function and endpoint information. We show that these methods can halve workload makespan when compared with a strategy that selects the fastest resource, and decrease makespan by a factor of five when compared to a round robin strategy, when deployed on a heterogeneous testbed with resources ranging from a Raspberry Pi to a GPU node in an academic cloud.

Computing continuum↗
NASA NTRS1982

Singular perturbation techniques for real time aircraft trajectory optimization and control

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Calise, A. J.↗
NASA NTRSDate not supplied

Comparison of Multivariate Time Series Prediction Techniques for Emulating Noah-LSM Soil Moisture Outputs

Land surface models are crucial tools for many earth science applications including numerical weather prediction, water resource and crop monitoring, and climatological analysis. Given a set of atmospheric forcings, seasonal data, and static parameters, models like Noah-LSM solve for land surface quantities including skin temperature, sensible heat flux, and soil moisture. While these calculations are theoretically robust, they are often computationally expensive. Since artificial neural networks (ANNs) are universal function approximators, they can learn to emulate the output of a deterministic numerical model given a time series of input forcings, with the learned ANN having substantially shorter execution time. The ANN could efficiently parameterize other models, generate ensembles, and provide first-guess inputs for retrievals. As such, with the goal of developing a model that efficiently mimics the output of Noah-LSM given NLDAS2 forcings on a region covering much of the central US, we examine and compare several neural network architectures for the multi-horizon multivariate time series forecasting problem. Recent literature includes a diverse set of approaches including autoregressive architectures like LSTM and GRU, parametric and non-parametric statistical predictors (ForecastNet and MQRNN), self-attention (LSTM-attention-LSTM), and temporal convovlution (DeepTCN). We implement several of these models for the Noah-LSM prediction task, highlighting the features and challenges for each and providing practical insight on the training process.

Mitchell Dodson↗
NASA NTRS1984

The vectorization of a ray tracing program for image generation

Ray tracing is a widely used method for producing realistic computer generated images. Ray tracing involves firing an imaginary ray from a view point, through a point on an image plane, into a three dimensional scene. The intersections of the ray with the objects in the scene determines what is visible at the point on the image plane. This process must be repeated many times, once for each point (commonly called a pixel) in the image plane. A typical image contains more than a million pixels making this process computationally expensive. A traditional ray tracing program processes one ray at a time. In such a serial approach, as much as ninety percent of the execution time is spent computing the intersection of a ray with the surface in the scene. With the CYBER 205, many rays can be intersected with all the bodies im the scene with a single series of vector operations. Vectorization of this intersection process results in large decreases in computation time. The CADLAB's interest in ray tracing stems from the need to produce realistic images of mechanical parts. A high quality image of a part during the design process can increase the productivity of the designer by helping him visualize the results of his work. To be useful in the design process, these images must be produced in a reasonable amount of time. This discussion will explain how the ray tracing process was vectorized and gives examples of the images obtained.

Plunkett, D. J.↗
NASA NTRS2019

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗
NASA NTRS2011

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗
DOE OSTI2023

A real-time multiphysics model of a pressurized solid oxide electrolysis cell (SOEC) for cyber-physical simulation

Solid oxide electrolysis cells (SOEC) can play important roles in integrated energy systems (IES) as the hydrogen production hub and the resilience energy hub. When tied to a microgrid with high renewable penetration, the SOEC is subjected to rapid load transitions in response to the intermittent renewable generations that occur not only in diurnal cycles but also in short timeframes (e.g., sub-minute). The cyber-physical simulation approach can derisk operability research but requires a real-time dynamic SOEC model. In the present work, a real-time multiphysics model for pressurized SOEC is developed and validated in the pressure range from 1.4 to 8bar. Further, the accuracy of the single repeating unit (SRU) assumption in SOEC stack simulation is quantified. A guidance of more than 45 cells in one SOEC stack is recommended to safely apply the SRU assumption. Modeling results suggest that at a given current density, more power is consumed by SOEC at elevated operating pressures. The anode air and cathode stream have major impacts on thermal management, highlighting the potential benefit of integrating SOEC with other thermal processes in IES. To achieve high hydrogen production efficiency, the SOEC could operate at the maximum endothermic point to maximize the use of thermal energy. The real-time execution of the developed SOEC model is also demonstrated, which only takes 0.1% of the fixed time step of 5ms. The developed model establishes the basis for cyber-physical simulation of SOEC hybrid systems.

25 ENERGY STORAGE↗
DOE OSTI2021

A particle-in-cell code comparison for ion acceleration: EPOCH, LSP, and WarpX

There are now more Particle-in-Cell (PIC) codes than ever before that researchers use to simulate intense laser-plasma interactions. To date, there have been relatively few direct comparisons of these codes in the literature, especially for relativistic intensity lasers interacting with thin overdense targets. To address this we perform a code comparison of three PIC codes: EPOCH, LSP, and WarpX for the problem of laser-driven ion acceleration in a 2D(3v) geometry for a 10 20 W cm -2 intensity laser. We examine the plasma density, ion energy spectra, and laser-plasma coupling of the three codes and find strong agreement. We also run the same simulation 20 times with different random seeds to explore statistical fluctuations of the outputs. We then compare the execution times and memory usage of the codes (without “tuning” to improve performance) using between 1 and 48 processors on one node. We provide input files to encourage larger and more frequent code comparisons in this field.

36 MATERIALS SCIENCE↗
NASA NTRS1993

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.↗
NASA NTRS2022

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and evaluate a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to estimate gains from these techniques, and we compare these predictions to empirical results generated in simulation. These results indicate that an integrated approach to planning and execution leveraging flexible execution, replanning, and utility maximization shows significant promise for future tightly-constrained space missions that must address significant uncertainty.

Chien, Steve↗
NASA NTRS2021

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and propose a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to predict the value of each of these techniques, and we compare these predictions to empirical results generated in simulation. We demonstrate that an integrated approach to planning and execution that is grounded in flexible execution, replanning, and utility maximization will be an enabling technology for future tightly-constrained planetary surface missions.

Chien, Steve↗
NASA NTRS2022

Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander

Plan execution in unknown environments poses a number of challenges: uncertainty in domain modeling, stochasticity at execution time, and the presence of exogenous events. These challenges motivate an integrated approach to planning and execution that is able to respond intelligently to variation. We examine this problem in the context of the Europa Lander mission concept, and propose a planning and execution framework that responds to feedback and task failure using two techniques: flexible execution and replanning with plan optimization. We develop a theoretical framework to predict the value of each of these techniques, and we compare these predictions to empirical results generated in simulation. We demonstrate that an integrated approach to planning and execution that is grounded in flexible execution, replanning, and utility maximization will be an enabling technology for future tightly-constrained planetary surface missions.

Basich, Connor↗
DOE OSTI2018

A Visual Analytics Framework for the Detection of Anomalous Call Stack Trees in High Performance Computing Applications

Anomalous runtime behavior detection is one of the most important tasks for performance diagnosis in High Performance Computing (HPC). Most of the existing methods find anomalous executions based on the properties of individual functions, such as execution time. However, it is insufficient to identify abnormal behavior without taking into account the context of the executions, such as the invocations of children functions and the communications with other HPC nodes. We improve upon the existing anomaly detection approaches by utilizing the call stack structures of the executions, which record rich temporal and contextual information. With our call stack tree (CSTree) representation of the executions, we formulate the anomaly detection problem as finding anomalous tree structures in a call stack forest. The CSTrees are converted to vector representations using our proposed stack2vec embedding. Structural and temporal visualizations of CSTrees are provided to support users in the identification and verification of the anomalies during an active anomaly detection process. Furthermore, three case studies of real-world HPC applications demonstrate the capabilities of our approach.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Modeling material failure with a vectorized routine

The computational aspects of modelling material failure in structural wood members are presented with particular reference to vector processing aspects. Wood members are considered to be highly orthotropic, inhomogeneous, and discontinuous due to the complex microstructure of wood material and the presence of natural growth characteristics such as knots, cracks and cross grain in wood members. The simulation of strength behavior of wood members is accomplished through the use of a special purpose finite element/fracture mechanics routine, program STARW (Strength Analysis Routine for Wood). Program STARW employs quadratic finite elements combined with singular crack tip elements in a finite element mesh. Vector processing techniques are employed in mesh generation, stiffness matrix formation, simultaneous equation solution, and material failure calculations. The paper addresses these techniques along with the time and effort requirements needed to convert existing finite element code to a vectorized version. Comparisons in execution time between vectorized and nonvectorized routines are provided.

Cramer, S. M.↗