A dynamic programing analysis of multiple guidance corrections of a trajectory.
Adaptive guidance correction policy developed from dynamic programming point of view for perturbed trajectory of spacecraft
SPACECRAFT TRAJECTORY↗
SEARCH · Search NASA
Results for “Multiple program”
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.
Lowering and Runtime Support for Fortran’s Multi-Image Parallel Features using LLVM Flang, PRIF, and Caffeine
This paper provides an overview of the multi-image parallel features in Fortran 2023 and their implementation in the LLVM flang compiler and the Caffeine parallel runtime library. The features of interest support a Single-Program, Multiple-Data (SPMD) programming model based on executing multiple “images”, each of which is a program instance. The features also support a Partitioned Global Address Space (PGAS) in the form of “coarray” distributed data structures. The paper discusses the lowering of multi-image features to the Parallel Runtime Interface for Fortran (PRIF) and the implementation of PRIF in the Caffeine parallel runtime library. This paper also provides an early view into the design of a new multi-image dialect of the LLVM Multi-Level Intermediate Representation (MLIR). We describe validation and testing of the resulting software stack, and demonstrate that performance compares favorably to another open-source compiler and runtime library: GNU Compiler Collection (GCC) gfortran and OpenCoarrays, respectively.
Bonachea, Dan↗
CHARM-SYCL: New Unified Programming Environment for Multiple Accelerator Types
Addressing performance portability across diverse accelerator architectures has emerged as a major challenge in the development of application and programming systems for high-performance computing environments. Although recent programming systems that focus on performance portability have significantly improved productivity in an effort to meet this challenge, the problem becomes notably more complex when compute nodes are equipped with multiple accelerator types—each with unique performance attributes, optimal data layout, and binary formats. To navigate the intricacies of multi-accelerator programming, we propose CHARM-SYCL as an extension of our CHARM multi-accelerator execution environment [27]. This environment will combine our SYCL-based performance-portability programming front end with a back end for extremely heterogeneous architectures as implemented with the IRIS runtime from Oak Ridge National Laboratory. Our preliminary evaluation indicates potential productivity boost and reasonable performance compared to vendor-specific programming system and runtimes.
Fujita, Norihisa↗
Program Aids Specification Of Multiple-Block Grids
3DPREP computer program aids specification of multiple-block computational grids. Highly interactive graphical preprocessing program designed for use on powerful graphical scientific computer workstation. Divided into three main parts, each corresponding to principal graphical-and-alphanumerical display. Relieves user of some burden of collecting and formatting many data needed to specify blocks and grids, and prepares input data for NASA's 3DGRAPE grid-generating computer program.
Sorenson, R. L.↗
Multiple-compartment venting program
Computer program solves time-dependent energy and state equations for gas reservoirs, using the solutions of conductor conservation equations as mass and energy rate changes to reservoirs.
Leblanc, L. P.↗
X-29A forward-swept-wing flight research program status
The X-29A aircraft is a fascinating combination of integrated technologies incorporated into a unique research aircraft. The X-29A program is a multiple agency program with management and other responsibilities divided among NASA, DARPA, the U.S. Air Force, and the Grumman Corporation. An overview of the recently completed X-29A flight research program, objectives achieved, and a discussion of its future is presented. Also discussed are the flight test approach expanding the envelope, typical flight maneuvers performed, X-29A program accomplishments, lessons learned for the Number One aircraft, and future plans with the Number Two aircraft. A schedule for both aircraft is presented. A description of the unique technologies incorporated into the X-29A aircraft is given, along with descriptions of the onboard instrumentation system. The X-29A aircraft research program has proven highly successful. Using high fly rates from a very reliable experimental aircraft, the program has consistently met or exceeded its design and research goals.
Trippensee, Gary A.↗
A generalized method for multiple robotic manipulator programming applied to vertical-up welding
The application is described of a weld programming algorithm for vertical-up welding, which is frequently desired for variable polarity plasma arc welding (VPPAW). The Basic algorithm performs three tasks simultaneously: control of the robotic mechanism so that proper torch motion is achieved while minimizing the sum-of-squares of joint displacement; control of the torch while the part is maintained in a desirable orientation; and control of the wire feed mechanism location with respect to the moving welding torch. Also presented is a modification of this algorithm which permits it to be used for vertical-up welding. The details of this modification are discussed and simulation examples are provided for illustration and verification.
Fernandez, Kenneth R.↗
Evaluating multiple coordinated windows for programming workstations
Programmers might benefit from larger screens with multiple windows or multiple screens, especially if convenient coordination among screens are arranged. Uses for multiple coordinated displays in a programmers workstation are explored. Initial efforts focus on the potential applications, a command language for coordinating the displays, and the psychological basis for effective utilization so as to avoid information overload. Subsequent efforts will be devoted to implementing the concepts and performing controlled psychologically oriented experiments to validate the hypotheses.
Shneiderman, B.↗
A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem
Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.
Montoya, Justin Vincent↗
Partitioning problems in parallel, pipelined and distributed computing
The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest.
Bokhari, S.↗
Statistical assessment of a unique time series analysis technique
Empirical tests of a particular least squares multiple prediction program were studied, as well as the relationship of this particular program to general least squares multiple prediction theory. Empirical evaluation and test of the program involved: (1) conversion of the program to run on an IBM 360/44 with replication of test results obtained on a Univac 1108; and (2) generation and analysis of Monte Carlo simulated data with the objective of comparison against results theoretically obtainable from spectrum analysis routines.
Benignus, V. A.↗
IRIS Reimagined: Advancements in Intelligent Runtime System for Task-Based Programming
Task-based programming models are gaining traction in scientific computing. IRIS is a portable runtime system that exploits multiple heterogeneous programming systems and can discover available resources and manage multiple diverse programming systems (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, and OpenMP) simultaneously. It accounts for the constraints of task dependencies and provides customizable scheduling policies to map those tasks to heterogeneous devices. In this paper, we present new capabilities added to IRIS to improve its portability for heterogeneous programming, build-friendliness, and performance efficiency. The new additions include vendor-specific kernel support, a runtime system with a foreign function interface to eliminate writing wrapper or boilerplate code for heterogeneous kernels, an easy-to-use and configurable CMake-based build environment, automatic and efficient data transfers and orchestration, and the Hunter and DAGGER toolchains to evaluate IRIS’s task scheduling algorithms.
Miniskar, Narasinga Rao↗
Estimating sorber capacity for multiple contaminants
Computer program estimates quantity of activated charcoal required to control multiple contaminants. Program scans all contaminants by potential parameter value and then orders them from lowest to highest values. It calculates quantity of sorbent required to remove most strongly adsorbed material; and then, using potential plot data, capacity of other materials is calculated on basis of corrected capacity.
Olcott, T. M.↗
Managing a Safe and Successful Multi-User Spaceport
Encouraged by the creation of the Office of Commercial Space Transportation within the U.S. Federal Aviation Administration (FAA) in 1984 and the Commercial Space Act of 1998, the National Aeronautics and Space Administration (NASA) now relies on an extensive network of support from commercial companies and organizations. At NASA's Kennedy Space Center (KSC), this collaboration opens competitive opportunities for launch providers, including repurposing underutilized Shuttle Program resources, constructing new facilities, and utilizing center services and laboratories. The resulting multi-user spaceport fosters diverse activity, though it engenders risk from hazards associated with various spaceflight processing activities. The KSC Safety & Mission Assurance (S&MA) Directorate, in coordination with the center's Spaceport Integration and Center Planning & Development organizations, has developed a novel approach to protect NASA's workforce, critical assets, and the public from hazardous, space-related activity associated with KSC's multi-user spaceport. For NASA KSC S&MA, the transformation to a multi-user spaceport required implementing methods to foster safe and successful commercial activity while resolving challenges involving: Retirement of the Space Shuttle program; Co-location of multiple NASA programs; Relationships between the NASA programs; Complex relationships between NASA programs and commercial partner operations in exclusive-use facilities; Complex relationships between NASA programs and commercial partner operations in shared-use facilities. NASA KSC S&MA challenges were met with long-term planning and solutions involving cooperation with the Spaceport Integration and Services Directorate. This directorate is responsible for managing active commercial partnerships with customer advocacy and services management, providing a dedicated and consistent level of support to a wide array of commercial operations. This paper explores these solutions, their relevance to the current commercial space industry, and the challenges that continue to drive improvement with a focus on areas of safety management and risk assessment that have been crucial in KSC's evolution into a multi-user spaceport. These solutions may be useful to government entities and private companies looking to partner with the commercial space industry.
Range↗
Markov chains for testing redundant software
A preliminary design for a validation experiment has been developed that addresses several problems unique to assuring the extremely high quality of multiple-version programs in process-control software. The procedure uses Markov chains to model the error states of the multiple version programs. The programs are observed during simulated process-control testing, and estimates are obtained for the transition probabilities between the states of the Markov chain. The experimental Markov chain model is then expanded into a reliability model that takes into account the inertia of the system being controlled. The reliability of the multiple version software is computed from this reliability model at a given confidence level using confidence intervals obtained for the transition probabilities during the experiment. An example demonstrating the method is provided.
White, Allan L.↗
Partitioning problems in parallel, pipelined, and distributed computing
The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.
Bokhari, Shahid H.↗
Integrating Engineering Data Systems for NASA Spaceflight Projects
NASA has a large range of custom-built and commercial data systems to support spaceflight programs. Some of the systems are re-used by many programs and projects over time. Management and systems engineering processes require integration of data across many of these systems, a difficult problem given the widely diverse nature of system interfaces and data models. This paper describes an ongoing project to use a central data model with a web services architecture to support the integration and access of linked data across engineering functions for multiple NASA programs. The work involves the implementation of a web service-based middleware system called Data Aggregator to bring together data from a variety of systems to support space exploration. Data Aggregator includes a central data model registry for storing and managing links between the data in disparate systems. Initially developed for NASA's Constellation Program needs, Data Aggregator is currently being repurposed to support the International Space Station Program and new NASA projects with processes that involve significant aggregating and linking of data. This change in user needs led to development of a more streamlined data model registry for Data Aggregator in order to simplify adding new project application data as well as standardization of the Data Aggregator query syntax to facilitate cross-application querying by client applications. This paper documents the approach from a set of stand-alone engineering systems from which data are manually retrieved and integrated, to a web of engineering data systems from which the latest data are automatically retrieved and more quickly and accurately integrated. This paper includes the lessons learned through these efforts, including the design and development of a service-oriented architecture and the evolution of the data model registry approaches as the effort continues to evolve and adapt to support multiple NASA programs and priorities.
Carvalho, Robert E.↗
Centralized Planning for Multiple Exploratory Robots
A computer program automatically generates plans for a group of robotic vehicles (rovers) engaged in geological exploration of terrain. The program rapidly generates multiple command sequences that can be executed simultaneously by the rovers. Starting from a set of high-level goals, the program creates a sequence of commands for each rover while respecting hardware constraints and limitations on resources of each rover and of hardware (e.g., a radio communication terminal) shared by all the rovers. First, a separate model of each rover is loaded into a centralized planning subprogram. The centralized planning software uses the models of the rovers plus an iterative repair algorithm to resolve conflicts posed by demands for resources and by constraints associated with the all the rovers and the shared hardware. During repair, heuristics are used to make planning decisions that will result in solutions that will be better and will be found faster than would otherwise be possible. In particular, techniques from prior solutions of the multiple-traveling- salesmen problem are used as heuristics to generate plans in which the paths taken by the rovers to assigned scientific targets are shorter than they would otherwise be.
Estlin, Tara↗