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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 595 records · Page 33

All sources NASA NTRS DOE OSTI

NASA NTRS1997

OPAD-EDIFIS Real-Time Processing

The Optical Plume Anomaly Detection (OPAD) detects engine hardware degradation of flight vehicles through identification and quantification of elemental species found in the plume by analyzing the plume emission spectra in a real-time mode. Real-time performance of OPAD relies on extensive software which must report metal amounts in the plume faster than once every 0.5 sec. OPAD software previously written by NASA scientists performed most necessary functions at speeds which were far below what is needed for real-time operation. The research presented in this report improved the execution speed of the software by optimizing the code without changing the algorithms and converting it into a parallelized form which is executed in a shared-memory multiprocessor system. The resulting code was subjected to extensive timing analysis. The report also provides suggestions for further performance improvement by (1) identifying areas of algorithm optimization, (2) recommending commercially available multiprocessor architectures and operating systems to support real-time execution and (3) presenting an initial study of fault-tolerance requirements.

Katsinis, Constantine↗

NASA NTRS2012

Effects of Staggering Formation Maneuvers on the Magnetospheric Multi-Scale Mission Trajectories

Formation maneuvering for the MMS mission is accomplished by executing a two-burn transfer for each spacecraft to achieve a set of desired states. Because the same radio frequency is shared by all four spacecraft, only one spacecraft can execute a maneuver at any given time. Therefore, the maneuver execution epochs for the MMS spacecraft must be staggered. The selection of the staggered maneuver sequence has a significant effect on the propellant usage and the spacecraft close-approach profile. A method for selecting a favorable maneuver sequence is proposed and measured in terms of propellant and safety.

Parsay, Khashayar↗

NASA NTRS1991

Validating system-level error recovery for spacecraft

The system-level software onboard a spacecraft is responsible for recovery from communication, thermal, power, and computer-health anomalies that may occur. The recovery must occur without disrupting any critical scientific or engineering activity that is executing at the time of the error. Thus, the error-recovery software may have to execute concurrently with the ongoing acquisition of scientific data or with spacecraft maneuvers. This paper provides a technique by which the rules that constrain the concurrent execution of these processes can be modeled in a graph. An algorithm is described that uses this model to validate that the constraints hold for all concurrent executions of the error-recovery softwave with the softwave that controls the science and engineering events on the spacecraft.

Lutz, Robyn R.↗

DOE OSTI2021

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↗

NASA NTRS2004

Simulation Testing of Embedded Flight Software

Virtual Real Time (VRT) is a computer program for testing embedded flight software by computational simulation in a workstation, in contradistinction to testing it in its target central processing unit (CPU). The disadvantages of testing in the target CPU include the need for an expensive test bed, the necessity for testers and programmers to take turns using the test bed, and the lack of software tools for debugging in a real-time environment. By virtue of its architecture, most of the flight software of the type in question is amenable to development and testing on workstations, for which there is an abundance of commercially available debugging and analysis software tools. Unfortunately, the timing of a workstation differs from that of a target CPU in a test bed. VRT, in conjunction with closed-loop simulation software, provides a capability for executing embedded flight software on a workstation in a close-to-real-time environment. A scale factor is used to convert between execution time in VRT on a workstation and execution on a target CPU. VRT includes high-resolution operating- system timers that enable the synchronization of flight software with simulation software and ground software, all running on different workstations.

Shahabuddin, Mohammad↗

NASA NTRS2012

Real-Time Projection to Verify Plan Success During Execution

The Mission Data System provides a framework for modeling complex systems in terms of system behaviors and goals that express intent. Complex activity plans can be represented as goal networks that express the coordination of goals on different state variables of the system. Real-time projection extends the ability of this system to verify plan achievability (all goals can be satisfied over the entire plan) into the execution domain so that the system is able to continuously re-verify a plan as it is executed, and as the states of the system change in response to goals and the environment. Previous versions were able to detect and respond to goal violations when they actually occur during execution. This new capability enables the prediction of future goal failures; specifically, goals that were previously found to be achievable but are no longer achievable due to unanticipated faults or environmental conditions. Early detection of such situations enables operators or an autonomous fault response capability to deal with the problem at a point that maximizes the available options. For example, this system has been applied to the problem of managing battery energy on a lunar rover as it is used to explore the Moon. Astronauts drive the rover to waypoints and conduct science observations according to a plan that is scheduled and verified to be achievable with the energy resources available. As the astronauts execute this plan, the system uses this new capability to continuously re-verify the plan as energy is consumed to ensure that the battery will never be depleted below safe levels across the entire plan.

Wagner, David A.↗

NASA NTRS1995

elVis: An Interactive System For Visualization of Unsteady Fluid Flow

ElVis is a prototype system with allows for the interactive visualization of unsteady fluid flow. The increasing computational power applied to fluid dynamics simulations presents the enormous challenge to the visualization system designer to apply a wide range of technologies to the analysis process with ever increasing demands on performance. Visualization of the results of unsteady fluid flow simulations presents the challenge of exploring very large and complex data sets. Since exploration is a trial and error process, it is of utmost importance that the time required to execute a trial (i.e., create a visualization) be at a minimum in order to provide real time interaction.

Gerald-Yamasaki, Michael↗

NASA NTRS2021

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

NASA NTRS1987

Time-partitioning simulation models for calculation on parallel computers

A technique allowing time-staggered solution of partial differential equations is presented in this report. Using this technique, called time-partitioning, simulation execution speedup is proportional to the number of processors used because all processors operate simultaneously, with each updating of the solution grid at a different time point. The technique is limited by neither the number of processors available nor by the dimension of the solution grid. Time-partitioning was used to obtain the flow pattern through a cascade of airfoils, modeled by the Euler partial differential equations. An execution speedup factor of 1.77 was achieved using a two processor Cray X-MP/24 computer.

Milner, Edward J.↗

NASA NTRS1987

Time-partitioning simulation models for calculation of parallel computers

Milner, Edward J.↗

NASA NTRS2016

International Space Station (ISS) Payload Autonomous Operations Past, Present and Future

Draper Laboratorys Timeliner is a scripting and automation system that runs onboard computers in the International Space Station (ISS). Timeliner is fully integrated with ISS and can be used to automate ISS operations tasks. Some of the most challenging aspects of operating a payload in low earth orbit are communication delays, ground equipment failures, and human errors. How does a Payload Developer (PD) know their equipment is operating nominally and collecting science in the most efficient way possible or even powered at any given time? During a ground Loss of Signal (LOS) data outage, PDs have no insight into their experiments state, and benefit greatly from Timeliner scripts executing on ISS to perform telemetry monitoring and commanding operations. This paper will discuss current software designs, and new operational uses for Timeliner. Existing Timeliner capabilities discussed will include: autonomous EXPRESS Rack activation and deactivation; autonomous science data downlinks; Minus Eighty Degree Freezer (MELFI) Dewar autonomous safing; JAXA and ESA module autonomous payload facility safing; as well as many others. New operational concepts discussed will include allowing Timeliner on the payload computer to issue core commands (Thermal, Power, Fire Detection), creation of new ground tools that will monitor the current status of Payload Racks as well as all the messaging from autonomous scripts executing, decreasing approval time for Timeliner bundles, and opening up the Payload MDM Enhanced Processor Integrated Communications Card (EPIC) interface. The EPIC interface could provide a new crew interface for PL Timeliner execution. The new interface could operate on either a Payload Computer System (PCS) or a Station Support Computer (SSC) that is plugged into either the Payload LAN or the Operations LAN which will make communicating to the PL MDM more flexible and greatly increase band width for communication.

Space Mission Automation↗

NASA NTRS2010

Algorithm That Synthesizes Other Algorithms for Hashing

An algorithm that includes a collection of several subalgorithms has been devised as a means of synthesizing still other algorithms (which could include computer code) that utilize hashing to determine whether an element (typically, a number or other datum) is a member of a set (typically, a list of numbers). Each subalgorithm synthesizes an algorithm (e.g., a block of code) that maps a static set of key hashes to a somewhat linear monotonically increasing sequence of integers. The goal in formulating this mapping is to cause the length of the sequence thus generated to be as close as practicable to the original length of the set and thus to minimize gaps between the elements. The advantage of the approach embodied in this algorithm is that it completely avoids the traditional approach of hash-key look-ups that involve either secondary hash generation and look-up or further searching of a hash table for a desired key in the event of collisions. This algorithm guarantees that it will never be necessary to perform a search or to generate a secondary key in order to determine whether an element is a member of a set. This algorithm further guarantees that any algorithm that it synthesizes can be executed in constant time. To enforce these guarantees, the subalgorithms are formulated to employ a set of techniques, each of which works very effectively covering a certain class of hash-key values. These subalgorithms are of two types, summarized as follows: Given a list of numbers, try to find one or more solutions in which, if each number is shifted to the right by a constant number of bits and then masked with a rotating mask that isolates a set of bits, a unique number is thereby generated. In a variant of the foregoing procedure, omit the masking. Try various combinations of shifting, masking, and/or offsets until the solutions are found. From the set of solutions, select the one that provides the greatest compression for the representation and is executable in the minimum amount of time. Given a list of numbers, try to find one or more solutions in which, if each number is compressed by use of the modulo function by some value, then a unique value is generated.

James, Mark↗

NASA NTRS1983

Time-critical multirate scheduling using contemporary real-time operating system services

Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.

Eckhardt, D. E., Jr.↗

NASA NTRS1993

Space Shuttle Main Engine real time stability analysis

The Space Shuttle Main Engine (SSME) is a reusable, high performance, liquid rocket engine with variable thrust. The engine control system continuously monitors the engine parameters and issues propellant valve control signals in accordance with the thrust and mixture ratio commands. A real time engine simulation lab was installed at MSFC to verify flight software and to perform engine dynamic analysis. A real time engine model was developed on the AD100 computer system. This model provides sufficient fidelity on the dynamics of major engine components and yet simplified enough to be executed in real time. The hardware-in-the-loop type simulation and analysis becomes necessary as NASA is continuously improving the SSME technology, some with significant changes in the dynamics of the engine. The many issues of interfaces between new components and the engine can be better understood and be resolved prior to the firing of the engine. In this paper, the SSME real time simulation Lab at the MSFC, the SSME real time model, SSME engine and control system stability analysis, both in real time and non-real time is presented.

Kuo, F. Y.↗

NASA NTRS1978

Vision-based guidance for an automated roving vehicle

A controller designed to guide an automated vehicle to a specified target without external intervention is described. The intended application is to the requirements of planetary exploration, where substantial autonomy is required because of the prohibitive time lags associated with closed-loop ground control. The guidance algorithm consists of a set of piecewise-linear control laws for velocity and steering commands, and is executable in real time with fixed-point arithmetic. The use of a previously-reported object tracking algorithm for the vision system to provide position feedback data is described. Test results of the control system on a breadboard rover at the Jet Propulsion Laboratory are included.

Griffin, M. D.↗

NASA NTRS2000

Integration of multiple research disciplines on the International Space Station

The International Space Station will provide an extremely high-quality, long-duration microgravity environment for the conduct of research. In addition, the ISS offers a platform for performing observations of Earth and Space from a high-inclination orbit, outside of the Earth's atmosphere. This unique environment and observational capability offers the opportunity for advancement in a diverse set of research fields. Many of these disciplines do not relate to one another, and present widely differing approaches to study, as well as different resource and operational requirements. Significant challenges exist to ensure the highest quality research return for each investigation. Requirements from different investigations must be identified, clarified, integrated and communicated to ISS personnel in a consistent manner. Resources such as power, crew time, etc. must be apportioned to allow the conduct of each investigation. Decisions affecting research must be made at the strategic level as well as at a very detailed execution level. The timing of the decisions can range from years before an investigation to real-time operations. The international nature of the Space Station program adds to the complexity. Each participating country must be assured that their interests are represented during the entire planning and operations process. A process for making decisions regarding research planning, operations, and real-time replanning is discussed. This process ensures adequate representation of all research investigators. It provides a means for timely decisions, and it includes a means to ensure that all ISS International Partners have their programmatic interests represented. c 2000 Published by Elsevier Science Ltd. All rights reserved.

Research/organization & administration↗

DOE OSTI2022

Constant-depth circuits for dynamic simulations of materials on quantum computers

Abstract Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible simulations to short-time dynamics. Here, we present a method for generating circuits that are constant in depth with increasing simulation time for a specific subset of one-dimensional (1D) materials Hamiltonians, thereby enabling simulations out to arbitrarily long times. Furthermore, by removing the effective limit on the number of feasibly simulatable time-steps, the constant-depth circuits enable Trotter error to be made negligibly small by allowing simulations to be broken into arbitrarily many time-steps. For an N -spin system, the constant-depth circuit contains only $\mathcal {O}(N^{2})$ O ( N 2 ) CNOT gates. Such compact circuits enable us to successfully execute long-time dynamic simulation of ubiquitous models, such as the transverse field Ising and XY models, on current quantum hardware for systems of up to 5 qubits without the need for complex error mitigation techniques. Aside from enabling long-time dynamic simulations with minimal Trotter error for a specific subset of 1D Hamiltonians, our constant-depth circuits can advance materials simulations on quantum computers more broadly in a number of indirect ways.

Materials simulation↗

NASA NTRSDate not supplied

Plume Impingement Software Module for Real-Time Proximity Operations

Successfully executing proximity operations in space, such as docking or in-orbit servicing, requires sophisticated spacecraft design that accounts for induced environments. As a chaser vehicle’s attitude control thrusters fire, they create rarefied plumes that can impact the target vehicle, with the potential to overload components, exceed thermal limits, and spin the target vehicle out of control. High-fidelity simulations of the thruster plume impingement environment require the direct simulation Monte Carlo (DSMC) method, but DSMC is too computationally expensive to simulate proximity operations that involve thousands of thruster firings. For this analysis to be tractable, engineering models of the plume flowfield and impingement events are used to simulate these trajectories [1]. Currently, on-orbit plume impingement environments are modeled through an inefficient open-loop analysis cycle where the vehicle’s flight controller and plume impingement teams iterate on the trajectories until they pass the target vehicle’s plume requirements. As complex on-orbit missions evolve and become more frequent, lengthy design cycles will become operational bottlenecks. To address this gap, this work develops an advanced plume impingement module capable of operating at real-time scale that can be integrated with existing mission planning tools and onboard flight systems. The plume module leverages state-of-the-art plume simulation techniques [2] to deliver fast, physics-based impingement predictions in a software architecture that can be tailored to diverse proximity operations scenarios. A prototype of this plume impingement module is built to demonstrate the feasibility of real-time performance. This prototype completes plume impingement calculations in microseconds per target geometry mesh point. The software serves as a foundational capability for plume-aware trajectory design, operational risk assessment, and future autonomous decision-making systems.

Plume Impingement↗