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 1,747 records · Page 97
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

PV Validation Hub

The Validation Hub will be a clearinghouse for the transfer of novel algorithms and software from the PV research community to industry. Potential algorithms tested in the Hub could include the estimation of various PV loss factors and the detection of various operational issues. The primary function of the Hub will be for developers to submit executable code which will run on hosted data sets. Developers will receive private reports on the accuracy and performance (e.g., run-time) of the submitted algorithms, and public high level summaries will be hosted. These summaries will indicate the organization who submitted the algorithm (e.g., links to GitHub pages, documentation websites, etc.), high-level accuracy metrics, and standardized performance metrics. These results will be stored in a publicly available database, accessible through the Hub, with the ability for users to sort and filter the results. In short, the Hub will be presented to public users as a collection of interactive leaderboards, organized around specific analysis tasks pertinent to the PV data science community. These tasks include things such as the estimation of various PV loss factors and the detection of various operational issues. We will present progress on the development of this hub, including preliminary results of comparative validation of PV data science algorithms and progress towards building the platform itself.

algorithm↗
DOE OSTI2017

The problem analysis of data processing performance in nuclear power plant computerized information and control system - 288

This paper is based on the data processing performance problems of operating command delay and system display not updating real-time for nuclear power plant computerized information and control system. The plant computerized information and control system is responsible for monitoring and controlling the plant operation, and it is a key part in the plant DCS system. Its data processing performance will affect the operation stability of nuclear power plant. The architecture, hardware configuration and data communication for plant computerized information and control system among the different levels in DCS are described. The main reasons affecting data processing performance in different signal channels are analyzed according to the plant load test results. The CPU load curves for real time server and central processing server are displayed, although the detailed cause for operating command delay and system display not updating realtime are not found, central processing server load is heavier than real time server which remind us to analyze the data processing of software resource scheduling deeply. So the resource distribution problem of software execution task is also analyzed according to CPU load test results. This paper provides the optimization analysis for data processing performance, and it is available and effective according to the latest test results. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

National technical nuclear forensics: U.S. approach to capability sustainment

In the event of a nuclear detonation in the United States (U.S.), the interdiction of a nuclear device, or the seizure of nuclear materials, there will be tremendous pressure to attribute the source of the material, establish responsibility, and ensure the prevention of another incident. Along with intelligence and law enforcement investigations, nuclear forensics is one of the three pillars supporting attribution. The field of nuclear forensics includes the collection, analysis, and evaluation of radiological or nuclear materials, devices, and debris after an event or interdiction. The nuclear forensics scientific workforce is situated primarily in national and defense laboratories, but in recent decades has experienced a decline in numbers. The Domestic Nuclear Detection Office has implemented an expertise development program in order to off-set these declines and sustain a workforce of educated and trained scientists skilled in areas needed for nuclear forensics. Since its inception in 2008, the National Nuclear Forensics Expertise Development Program (NNFEDP) addresses this challenge holistically, through support to undergraduate and graduate students, university faculty and programs, as well as post-doctoral researchers at national laboratories in fields which are directly relevant to nuclear forensics. In that time, the program has placed 44 Ph.D.'s directly into national laboratories and U.S. federal agencies, maintaining the technical expertise required to execute the Nation's nuclear forensics mission. In 2017, the NNFEDP will institute the new Nuclear Forensics Research Award that will foster collaborations between university students and faculty with national laboratory researchers to further support and reinforce the advancement of nuclear forensic science through joint efforts. This opportunity will increase participation in this exciting and critically important national security mission space and contribute to the sustained development of the nuclear forensics workforce. (authors)

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
NASA NTRS2021

An Evaluation of Timely Communications Access Methods Using NASA Space Network

There is a growing interest among scientists to coordinate diverse and temporally responsive measurements from multiple space and ground-based observatories in order to obtain greater insights into transient scientific events than would otherwise be possible. Many transient scientific events of interest occur randomly and the scientific value of follow-up observations decays with time. As a result, transient science operations among distributed observatories require timely access to communications network services. This paper develops two complimentary methods to improve users’ network access timeliness using the NASA Space Network (SN). Descriptive models of each method are developed using Systems Modeling Language. Pathfinder experiments are designed and executed. Suitability of the methods is discussed in light of the experimental results. Innovative applications of the methods are presented. This research establishes that the as-built SN systems have adequate capabilities and capacity to support infusion of the methods to current and future users with emergent time-sensitive service needs. The minimum service access wait time was determined to be approximately 10 min and is achievable 84% of the time. An average access wait time of approximately 14 min is expected when SN resource blocking occurs. A roadmap to improve SN access timeliness is presented.

Space Communications and Navigation↗
DOE OSTI2017

Kriging-Based Inverse Uncertainty Quantification of BISON Fission Gas Release Model

Nuclear reactor fuel performance analysis studies the thermo-mechanical behavior of fuel rods and verify their compliance with safety criteria under both normal operation and accidental conditions. One of the major concerns in fuel performance analysis is the behavior of the fission gases xenon and krypton in uranium dioxide fuel, which significantly affect the thermo-mechanical performance of the nuclear fuel rods employed in current LWRs. Previously, the modeling of fission gas release (FGR) in nuclear fuel performance codes have been relying on empirical models which are not applicable beyond their range of calibration. Recently a more efficient and flexible physics-based FGR and swelling model that can describe a wider range of reactor operation conditions have been implemented in fuel performance code BISON. In this work, we performed Bayesian calibration to inversely quantify the uncertainties associated with the 5 tuning parameters in BISON FGR model, based on the time-dependent FGR measurement data from Riso-AN3 benchmark. It takes around 1 hour and 40 minutes for BISON to simulate the Riso-AN3 benchmark with a moderate mesh size using 32 processors. As hundreds of thousands of BISON simulations are needed during Markov Chain Monte Carlo (MCMC) sampling, running BISON directly is not a viable solution. Therefore we propose to use Kriging-based metamodels to replace BISON during MCMC sampling. Surrogate model is an approximation of the input/output relation of a computer code/model. It is also called metamodel, response surface, emulator. Surrogate models usually take much less computational time than the original model (like BISON) while maintaining the input/output relation of the original model to a desirable accuracy. Constructing the metamodels normally requires small number of executions of the original model. Once validated, metamodels can be used to perform uncertainty and sensitivity analysis, Bayesian calibration, optimization, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS2005

Enabling New Operations Concepts for Lunar and Mars Exploration

The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the operations concept that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a job jar of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically, and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.

Jaap, John↗
NASA NTRS2003

On-board autonomous attitude maneuver planning for planetary spacecraft using genetic algorithms

A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This paper presents an approach for attitude path planning that makes full use of a priori constraint knowledge and is computationally tractable enough to be executed on-board a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used 'as is' or as an initial solution to initialize additional deterministic optimization algorithms. A number of example simulations are presented including the case examples of a generic Europa Orbiter spacecraft in cruise as well as in orbit around Europa. The search times are typically on the order of minutes, thus demonstrating the viability of the presented approach. The results are applicable to all future deep space missions where greater spacecraft autonomy is required. In addition, onboard autonomous attitude planning greatly facilitates navigation and science observation planning, benefiting thus all missions to planet Earth as well.

genetic algorithm↗
NASA NTRS2016

Tapping the Brake for Entry, Descent, and Landing

A matrix of simulations of hypersonic flow over blunt entry vehicles with steady and pulsing retropropulsion jets is presented. Retropropulsion in the supersonic domain is primarily designed to reduce vehicle velocity directly with thrust. Retropropulsion in the hypersonic domain may enable significant pressure recovery through unsteady, oblique shocks while providing a buffer of reactant gases with relatively low total temperature. Improved pressure recovery, a function of Mach number squared and oblique shock angle, could potentially serve to increase aerodynamic drag in this domain. Pulsing jets are studied to include an additional degree of freedom to search for resonances in an already unsteady flow domain with an objective to maximize the time-averaged drag coefficient. In this paradigm, small jets with minimal footprints of the nozzle exit on the vehicle forebody may be capable of delivering the requisite perturbations to the flow. Simulations are executed assuming inviscid, symmetric flow of a perfect gas to enable a rapid assessment of the parameter space (nozzle geometry, plenum conditions, jet pulse frequency). The pulsed-jet configuration produces moderately larger drag than the constant jet configuration but smaller drag than the jet-off case in this preliminary examination of a single design point. The fundamentals of a new algorithm for this challenging application with time dependent, interacting discontinuities using the feature detection capabilities of Walsh functions are introduced.

Gnoffo, Peter A.↗
NASA NTRS2024

Discrete Event Simulation-Based Timeline Validation Using R2U2

The Gateway Vehicle Systems Manager (VSM), the top-level software control system in a distributed, hierarchical Autonomous System Management Architecture is, like most modern spacecraft software control systems, heavily data-driven. For example, schedules (timelines) will be developed on the ground and, due to the high degree of autonomy, contain complex procedures involving conditional branching, variable timing, and resource contention resolution. In order to verify that an uploaded timeline will function correctly, it is necessary to explore the feasible set of possible executions. While it is possible to test a timeline using a mission simulation, the complexity of the system and duration of a timeline limits the number of trials and therefore the test coverage. To address this problem, the VSM team is using a discrete event system model that can rapidly generate from a timeline sets of event sequences using Monte Carlo techniques. To achieve rapid and trustworthy checking of the event sequences, we use an offline version of the runtime model checking tool R2U2. This presentation describes the approach the VSM team is using to implement the discrete event simulation and evaluate event sequences using R2U2. The presentation will discuss: 1. Description of the timelines by VSM in the context of VSM operations 2. Expansion of a timeline into a sequence of atomic events 3. Adjustment, in the Monte Carlo environment, of an event sequence to account for uncertainty, external events, and failures 4. Definition of R2U2 input and mission-time linear temporal logic files 5. Generation and use of R2U2 verdict sequences 6. Lessons learned and future work

Verification↗
NASA NTRS1993

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗
DOE OSTI2023

Do people spend travel time the way they think they would? a comparative study of generic and trip-specific travel time allocation using hybrid multiple discrete continuous (MDC) framework

Unlike driving alone, public transportation allows one to engage in extraneous activities while traveling – often referred to as travel-based multitasking. Research involving travel-based multitasking often relies on either generic (i.e. not related to an actual trip) or revealed (i.e. related to an executed trip) data. The data collected for this study provided a unique opportunity to compare the generic and trip-specific preferences while traveling on public transportation. To this end, the study develops two integrated choice and latent variable models with multiple discrete-continuous (MDC) kernels to simultaneously model the activity selection and the time allocation for generic and trip-specific data, respectively. According to the results the trip-specific data could identify more nuances in the travel-based multitasking behavior than the generic data. Finally, the heterogeneity identified by the developed models will be helpful for the transit operators in providing appropriate facilities (e.g. internet access, reading lights) along various transit corridors.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1988

An intelligent processing environment for real-time simulation

The development of a highly efficient and thus truly intelligent processing environment for real-time general purpose simulation of continuous systems is described. Such an environment can be created by mapping the simulation process directly onto the University of Alamba's OPERA architecture. To facilitate this effort, the field of continuous simulation is explored, highlighting areas in which efficiency can be improved. Areas in which parallel processing can be applied are also identified, and several general OPERA type hardware configurations that support improved simulation are investigated. Three direct execution parallel processing environments are introduced, each of which greatly improves efficiency by exploiting distinct areas of the simulation process. These suggested environments are candidate architectures around which a highly intelligent real-time simulation configuration can be developed.

Carroll, Chester C.↗
DOE OSTI2023

Use of Convolutional Neural Network Image Classification and High-Speed Ion Probe Data Toward Real-Time Detonation Characterization in a Water-Cooled Rotating Detonation Engine

As rotating detonation engines (RDEs) progress in maturity, the importance of monitoring advancements toward development of active control becomes more critical. Experimental RDE data processing at time scales which satisfy real-time diagnostics will likely require the use of machine learning. This study aims to develop and deploy a novel real-time monitoring technique capable of determining detonation wave number, direction, frequency, and individual wave speeds throughout experimental RDE operational windows. To do so, the diagnostic integrates image classification by a convolutional neural network (CNN) and ionization current signal analysis. Wave mode identification through single-image CNN classification bypasses the need to evaluate sequential images and offers instantaneous identification of the wave mode present in the RDE annulus. Here, real-time processing speeds are achieved due to low data volumes required by the methodology, namely one short-exposure image and a short window of sensor data to generate each diagnostic output. The diagnostic acquires live data using a modified experimental setup alongside Pylon and PyDAQmx libraries within a python data acquisition environment. Lab-deployed diagnostic results are presented across varying wave modes, operating conditions, and data quality, currently executed at 3–4 Hz with a variety of iteration speed optimization options to be considered as future work. These speeds exceed that of conventional techniques and offer a proven structure for real-time RDE monitoring. The demonstrated ability to analyze detonation wave presence and behavior during RDE operation will certainly play a vital role in the development of RDE active control, necessary for RDE technology maturation toward industrial integration.

42 ENGINEERING↗
DOE OSTI2016

Lightweight runtime checking of C programs with RTC

The C Programming Language is known for being an efficient language that can be compiled on almost any architecture and operating system. However the absence of dynamic safety checks and a relatively weak type system allows programmer oversights that are hard to spot. In this paper, we present RTC, a runtime monitoring tool that instruments unsafe code and monitors the program execution. RTC is built on top of the ROSE compiler infrastructure. RTC finds memory bugs and arithmetic overflows and underflows, and run-time type violations. Most of the instrumentations are directly added to the source file and only require a minimal runtime system. As a result, the instrumented code remains portable. In tests against known error detection benchmarks, RTC found 98% of all memory related bugs and had zero false positives. Finally, in performance tests conducted with well known algorithms, such as binary search and MD5, we determined that our tool has an average run-time overhead rate of 9.7× and memory overhead rate of 3.5×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Accelerating and Parallelizing Lagrangian Simulations of Mixing-Limited Reactive Transport

Recent advances in random walk particle tracking have enabled direct simulation of mixing and reactions by allowing the particles to interact with each other using a multipoint mass transfer scheme. The mass transfer scheme allows separation of mixing and spreading processes, among other advantages, but it is computationally expensive because its speed depends on the number of interacting particle pairs. This note explores methods for relieving the computational bottleneck caused by the mass transfer step, and we use these algorithms to develop a new parallel, interacting particle model. The new model is a combination of a sparse search algorithm and a novel domain decomposition scheme, both of which offer significant speedup relative to the reference case—even when they are executed serially. We combine the strengths of these methods to create a parallel particle scheme that is highly accurate and efficient with run times that scale as 1/P for a fixed number of particles, where P is the number of computational cores (equivalently, subdomains, in this work) being used. Here, the new parallel model is a significant advance because it enables efficient simulation of large particle ensembles that are needed for environmental simulations and also because it can naturally pair with parallel geochemical solvers to create a practical Lagrangian tool for simulating mixing and reactions in complex chemical systems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Online and Scalable Data Compression Pipeline with Guarantees on Quantities of Interest

Data compression is becoming critical for data-intensive scientific applications. Scientists require compression techniques that accurately preserve derived quantities of interest (QoIs). Prior work has shown that a pipeline can be built to guarantee error on the primary data (PD) within user-defined bounds and achieve near-floating point QoI errors. In this paper, we present novel computational approaches for accelerating the pipeline and demonstrate results that enable concurrent execution of compression in parallel with the simulation nodes. This allows compression, including the writing of the required compression data, for the previous time step to be completed while the simulation proceeds with the current time step. Overall, the approach presented in this paper results in a 6–8 times improvement in computational overhead compared to previous work. These results were obtained using data generated by a large-scale fusion code called XGC, which produces hundreds of terabytes of data in a single day.

Banerjee, Tania↗
DOE OSTI2019

BonVoision: Leveraging Spatial Data Smoothness For Recovery From Memory Soft Errors

The increasing soft error rates in memory systems raise an emerging concern for modern computing systems. As a result, detectable but uncorrectable errors (DUEs) become potentially more frequent and affect HPC applications. Today, upon encountering a DUE, HPC applications crash, incurring significant performance, storage, and energy overheads. In this paper, we propose a technique to continue application execution past a DUE through the repair of the corrupted memory data by leveraging spatial data smoothness. We present BonVoision, a run-time system that intercepts DUE events, analyzes the binary to identify data elements in the structural neighborhood of the event, and fixes the corrupted data elements by interpolating from the values in their neighborhood. Our evaluation demonstrates that BonVoision incurs negligible overhead and outperforms other recovery strategies by a factor of 2×, on average. We demonstrate that BonVoision also improves the efficiency of existing checkpointing/restart schemes by approximately increasing the optimal checkpoint interval by 23%.

Fang, Bo↗
DOE OSTI2021

SW4 Curvilinear Kernels

Five computationally expensive stencil evaluation routines from SW4(https://github.com/geodynamics/sw4 GPL license) have been extracted and packaged with a driver to create a mini-app for evaluating compiler and GPU performance. The kernels can executed on AMD and Nvidia GPUs with and without RAJA. The kernel driver generates synthetic inputs, checks for correctness and measures kernel run times.

Pankajakshan, Ramesh↗