Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “execution”

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 163 records · Page 9

Implementation of and Ada real-time executive: A case study

Current Ada language implementations and runtime environments are immature, unproven and are a key risk area for real-time embedded computer system (ECS). A test-case environment is provided in which the concerns of the real-time, ECS community are addressed. A priority driven executive is selected to be implemented in the Ada programming language. The model selected is representative of real-time executives tailored for embedded systems used missile, spacecraft, and avionics applications. An Ada-based design methodology is utilized, and two designs are considered. The first of these designs requires the use of vendor supplied runtime and tasking support. An alternative high-level design is also considered for an implementation requiring no vendor supplied runtime or tasking support. The former approach is carried through to implementation.

Laird, James D.↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Parallel plan execution with self-processing networks

A critical issue for space operations is how to develop and apply advanced automation techniques to reduce the cost and complexity of working in space. In this context, it is important to examine how recent advances in self-processing networks can be applied for planning and scheduling tasks. For this reason, the feasibility of applying self-processing network models to a variety of planning and control problems relevant to spacecraft activities is being explored. Goals are to demonstrate that self-processing methods are applicable to these problems, and that MIRRORS/II, a general purpose software environment for implementing self-processing models, is sufficiently robust to support development of a wide range of application prototypes. Using MIRRORS/II and marker passing modelling techniques, a model of the execution of a Spaceworld plan was implemented. This is a simplified model of the Voyager spacecraft which photographed Jupiter, Saturn, and their satellites. It is shown that plan execution, a task usually solved using traditional artificial intelligence (AI) techniques, can be accomplished using a self-processing network. The fact that self-processing networks were applied to other space-related tasks, in addition to the one discussed here, demonstrates the general applicability of this approach to planning and control problems relevant to spacecraft activities. It is also demonstrated that MIRRORS/II is a powerful environment for the development and evaluation of self-processing systems.

Dautrechy, C. Lynne↗

Performance analysis of fault-tolerant systems in parallel execution of conversations

The execution overhead inherent in the conversation scheme, which is a scheme for realizing fault-tolerant cooperating processes free of the domino effect, is analyzed. Multiprocessor/multicomputer systems capable of parallel execution of conversation components are considered and a queuing network model of such systems is adopted. Based on the queuing model, various performance indicators, including system throughput, average number of processors idling inside a conversation due to the synchronization required, and average time spent in the conversation, have been evaluated numerically for several application environments. The numeric results are discussed and several essential performance characteristics of the conversation scheme are derived. For example, when the number of participant processes is not large, say less than six, the system performance is highly affected by the synchronization required on the processes in a conversation, and not so much by the probability of acceptance-test failure.

Kim, K. H.↗

Execution time supports for adaptive scientific algorithms on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Parallel plan execution with self-processing networks

A critical issue for space operations is how to develop and apply advanced automation techniques to reduce the cost and complexity of working in space. In this context, it is important to examine how recent advances in self-processing networks can be applied for planning and scheduling tasks. For this reason, the feasibility of applying self-processing network models to a variety of planning and control problems relevant to spacecraft activities is being explored. Goals are to demonstrate that self-processing methods are applicable to these problems, and that MIRRORS/II, a general purpose software environment for implementing self-processing models, is sufficiently robust to support development of a wide range of application prototypes. Using MIRRORS/II and marker passing modelling techniques, a model of the execution of a Spaceworld plan was implemented. This is a simplified model of the Voyager spacecraft which photographed Jupiter, Saturn, and their satellites. It is shown that plan execution, a task usually solved using traditional artificial intelligence (AI) techniques, can be accomplished using a self-processing network. The fact that self-processing networks were applied to other space-related tasks, in addition to the one discussed here, demonstrates the general applicability of this approach to planning and control problems relevant to spacecraft activities. It is also demonstrated that MIRRORS/II is a powerful environment for the development and evaluation of self-processing systems.

D'Autrechy, C. Lynne↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

Research into software executives for space operations support

Research concepts pertaining to a software (workstation) executive which will support a distributed processing command and control system characterized by high-performance graphics workstations used as computing nodes are presented. Although a workstation-based distributed processing environment offers many advantages, it also introduces a number of new concerns. In order to solve these problems, allow the environment to function as an integrated system, and present a functional development environment to application programmers, it is necessary to develop an additional layer of software. This 'executive' software integrates the system, provides real-time capabilities, and provides the tools necessary to support the application requirements.

Collier, Mark D.↗

Planning and executing motions for multibody systems in free-fall

The purpose of this research is to develop an end-to-end system that can be applied to a multibody system in free-fall to analyze its possible motions, save those motions in a database, and design a controller that can execute those motions. A goal is for the process to be highly automated and involve little human intervention. Ideally, the output of the system would be data and algorithms that could be put in ROM to control the multibody system in free-fall. The research applies to more than just robots in space. It applies to any multibody system in free-fall. Mathematical techniques from nonlinear control theory were used to study the nature of the system dynamics and its possible motions. Optimization techniques were applied to plan motions. Image compression techniques were proposed to compress the precomputed motion data for storage. A linearized controller was derived to control the system while it executes preplanned trajectories.

Cameron, Jonathan M.↗

Coverability graphs for a class of synchronously executed unbounded Petri net

After detailing a variant of the concurrent-execution rule for firing of maximal subsets, in which the simultaneous firing of conflicting transitions is prohibited, an algorithm is constructed for generating the coverability graph of a net executed under this synchronous firing rule. The omega insertion criteria in the algorithm are shown to be valid for any net on which the algorithm terminates. It is accordingly shown that the set of nets on which the algorithm terminates includes the 'conflict-free' class.

Stotts, P. David↗

Execution time support for scientific programs on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Generalized compliant motion task description and execution within a complete telerobotic system

A motion primitive for use in compliant motion robot task execution is described. The primitive has a rich input parameter set to provide for execution of a variety of specific tasks such as door opening, crank turning, bolt seating and turning, pushing, sliding, pin insertion/removal, and leveling, as well as termination conditions which specify conditions for ending the motion, such as allowable position and force error bounds. A split rate force control technique is used for force control. Force and torque data from a six-axis force sensor are read, and gravity compensation using load mass properties is done to determine contact forces.

Backes, Paul G.↗

Two criteria for the selection of assembly plans - Maximizing the flexibility of sequencing the assembly tasks and minimizing the assembly time through parallel execution of assembly tasks

The authors introduce two criteria for the evaluation and selection of assembly plans. The first criterion is to maximize the number of different sequences in which the assembly tasks can be executed. The second criterion is to minimize the total assembly time through simultaneous execution of assembly tasks. An algorithm that performs a heuristic search for the best assembly plan over the AND/OR graph representation of assembly plans is discussed. Admissible heuristics for each of the two criteria introduced are presented. Some implementation issues that affect the computational efficiency are addressed.

Homem De Mello, Luiz S.↗

Structural tailoring/analysis for hypersonic components - Executive system development

No direct analytical or integrated numerical tool exists today for the optimal design of a generic class of built-up actively cooled composite structure for applications in hypersonic propulsion ducts. The need exists for a numerical tool to perform the comprehensive design/analysis of a panel on the inlet wall under hypersonic flight conditions. Such a tool requires relatively complex multi-disciplinary analysis. One such numerical tool controlled by an executive system has been developed and is named as STAHYC (Structural Tailoring/Analysis for HYpersonic Components). A detailed account of the executive system development of STAHYC along with the results of one example inlet panel design problem is given in this paper.

Narayanan, G. V.↗

Solar System Exploration Division Strategic Plan, volume 1. Executive summary and overview

This first document is the first of a six-volume series presenting the Solar System Exploration Division's Strategic Plan for the 10-year period FY 1994 to FY 2003. The overall strategy is characterized by five fundamental precepts: (1) execute the current program; (2) improve the vitality of the program and the planetary science community; (3) initiate innovative, small, low-cost planetary missions; (4) initiate new major and moderate missions; and (5) prepare for the next generation of missions. This Strategic Plan describes in detail our proposed approach to accomplish these goals. Volume 1 provides first an Executive Summary of highlights of each of the six volumes, and then goes on to present an overview of the plan, including a discussion of the planning context and strategic approach. Volumes 2, 3, 4, and 5 describe in detail the initiatives proposed. An integral part of each of these volumes is a set of responses to the mission selection criteria questions developed by the Space and Earth Science Advisory Committee. Volume 2, Mission From Planet Earth, describes a strategy for exploring the Moon and Mars and sets forth proposed moderate missions--Lunar Observer and a Mars lander network. Volume 3, Pluto Flyby/Neptune Orbiter, discusses our proposed major new start candidate for the FY 1994 to FY 1998 time frame. Volume 4, Discovery, describes the Near-Earth Asteroid Rendezvous, as well as other candidates for this program of low-cost planetary missions. Volume 5, Toward Other Planetary Systems, describes a major research and analysis augmentation that focuses on extrasolar planet detection and the study of planetary system processes. Finally, Volume 6 summarizes the technology program that the division has structured around these four initiatives.

Source record↗

Executive summary

The Astrotech 21 Optical Systems Technology Workshop was held in Pasadena, California on March 6-8, 1991. The purpose of the workshop was to examine the state of Optical Systems Technology at the National Aeronautics Space Administration (NASA), and in industry and academia, in view of the potential Astrophysics mission set currently being considered for the late 1990's through the first quarter of the 21st century. The principal result of the workshop is this publication, which contains an assessment of the current state of the technology, and specific technology advances in six critical areas of optics, all necessary for the mission set. The workshop was divided into six panels, each of about a dozen experts in specific fields, representing NASA, industry, and academia. In addition, each panel contained expertise that spanned the spectrum from x-ray to submillimeter wavelengths. This executive summary contains the principal recommendations of each panel. The six technology panels and their chairs were: (1) Wavefront Sensing, Control, and Pointing, Thomas Pitts, Itek Optical Systems, A Division of Litton; (2) Fabrication, Roger Angel, Steward Observatory, University of Arizona; (3) Materials and Structures, Theodore Saito, Lawrence Livermore National Laboratory; (4) Optical Testing, James Wyant, WYKO Corporation; (5) Optical Systems Integrated Modeling, Robert R. Shannon, Optical Sciences Center, University of Arizona; and (6) Advanced Optical Instruments Technology, Michael Shao, Jet Propulsion Laboratory, California Institute of Technology. This Executive Summary contains the principal recommendations of each panel.

Ayon, Juan A.↗

Autonomous spacecraft executive and its application to rendezvous and docking

Autonomy is needed for future spacecraft to solve the problems of human operator overload and transmission delay. This paper describes the autonomous spacecraft executive for rendezvous and docking. It is an onboard expert system and has decision making capability for mission planning of nominal and contingency cases. The executive has been developed and verified using a hardware motion based simulator.

Komura, Fuminobu↗

Conversion-Integration of MSFC Nonlinear Signal Diagnostic Analysis Algorithms for Realtime Execution of MSFC's MPP Prototype System

NASA's advanced propulsion system Small Scale Magnetic Disturbances/Advanced Technology Development (SSME/ATD) has been undergoing extensive flight certification and developmental testing, which involves large numbers of health monitoring measurements. To enhance engine safety and reliability, detailed analysis and evaluation of the measurement signals are mandatory to assess its dynamic characteristics and operational condition. Efficient and reliable signal detection techniques will reduce the risk of catastrophic system failures and expedite the evaluation of both flight and ground test data, and thereby reduce launch turn-around time. During the development of SSME, ASRI participated in the research and development of several advanced non- linear signal diagnostic methods for health monitoring and failure prediction in turbomachinery components. However, due to the intensive computational requirement associated with such advanced analysis tasks, current SSME dynamic data analysis and diagnostic evaluation is performed off-line following flight or ground test with a typical diagnostic turnaround time of one to two days. The objective of MSFC's MPP Prototype System is to eliminate such 'diagnostic lag time' by achieving signal processing and analysis in real-time. Such an on-line diagnostic system can provide sufficient lead time to initiate corrective action and also to enable efficient scheduling of inspection, maintenance and repair activities. The major objective of this project was to convert and implement a number of advanced nonlinear diagnostic DSP algorithms in a format consistent with that required for integration into the Vanderbilt Multigraph Architecture (MGA) Model Based Programming environment. This effort will allow the real-time execution of these algorithms using the MSFC MPP Prototype System. ASRI has completed the software conversion and integration of a sequence of nonlinear signal analysis techniques specified in the SOW for real-time execution on MSFC's MPP Prototype. This report documents and summarizes the results of the contract tasks; provides the complete computer source code; including all FORTRAN/C Utilities; and all other utilities/supporting software libraries that are required for operation.

Jong, Jen-Yi↗