Search NASA⌕ Search

SEARCH · Search NASA

Results for “Programming Models”

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 433 records · Page 24

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗

Theoretical studies of solar lasers and converters

The research described consisted of developing and refining the continuous flow laser model program including the creation of a working model. The mathematical development of a two pass amplifier for an iodine laser is summarized. A computer program for the amplifier's simulation is included with output from the simulation model.

Heinbockel, John H.↗

Hyper-X Model Testing with Animation

Live footage shows the Hyper-X program modeling at NASA Langley Research Center. The Hyper-X craft is shown on top of a Pegasus booster in a 20" Mach 6 Wind Tunnel. Visualization data runs are performed in the wind tunnel. Also seen is a brief interview with Vincent Rausch the Hyper-X Program Manager. Animation includes the flight model of the Hyper-X vehicle.

Source record↗

Subscale Beryllium Mirrors Demonstrator (SBMD) Program Summary and Ball Modeling

The SBMD Program was to design, fabricate, and test a 0.5-m beryllium lightweighted mirror applicable to space deployable systems with demanding optical and areal density requirements. This presentation summarizes the program's objectives and the mirror's tested technical performance along with lessons learned. In addition, test results are compared to modeling predictions. The SBMD Program was funded by NASA MSFC.

Kendrick, Stephen↗

Isoparametric 3-D Finite Element Mesh Generation Using Interactive Computer Graphics

An isoparametric 3-D finite element mesh generator was developed with direct interface to an interactive geometric modeler program called POLYGON. POLYGON defines the model geometry in terms of boundaries and mesh regions for the mesh generator. The mesh generator controls the mesh flow through the 2-dimensional spans of regions by using the topological data and defines the connectivity between regions. The program is menu driven and the user has a control of element density and biasing through the spans and can also apply boundary conditions, loads interactively.

Kayrak, C.↗

Hard Real-Time: C++ Versus RTSJ

In the domain of hard real-time systems, which language is better: C++ or the Real-Time Specification for Java (RTSJ)? Although ordinary Java provides a more productive programming environment than C++ due to its automatic memory management, that benefit does not apply to RTSJ when using NoHeapRealtimeThread and non-heap memory areas. As a result, RTSJ programmers must manage non-heap memory explicitly. While that's not a deterrent for veteran real-time programmers-where explicit memory management is common-the lack of certain language features in RTSJ (and Java) makes that manual memory management harder to accomplish safely than in C++. This paper illustrates the problem for practitioners in the context of moving data and managing memory in a real-time producer/consumer pattern. The relative ease of implementation and safety of the C++ programming model suggests that RTSJ has a struggle ahead in the domain of hard real-time applications, despite its other attractive features.

programming model↗

A NASTRAN/TREETOPS solution to a flexible, multi-body dynamics and controls problem on a UNIX workstation

Demands for nonlinear time history simulations of large, flexible multibody dynamic systems has created a need for efficient interfaces between finite-element modeling programs and time-history simulations. One such interface, TREEFLX, an interface between NASTRAN and TREETOPS, a nonlinear dynamics and controls time history simulation for multibody structures, is presented and demonstrated via example using the proposed Space Station Mobile Remote Manipulator System (MRMS). The ability to run all three programs (NASTRAN, TREEFLX and TREETOPS), in addition to other programs used for controller design and model reduction (such as DMATLAB and TREESEL, both described), under a UNIX Workstation environment demonstrates the flexibility engineers now have in designing, developing and testing control systems for dynamically complex systems.

Benavente, Javier E.↗

A status report on a model for Benchmark active controls testing

This 'work-in-progress' paper presents a status report on an active controls flutter model which is currently in the design and fabrication phase. This model is a part of the Benchmark Models Program (BMP). The BMP is a NASA LaRC program that includes a series of models which will be used to study different aeroelastic phenomena and to validate aeroelastic methods. The objective of Benchmark Active Controls testing is to validate active control design tools. Flutter testing will be conducted with a pressure-instrumented rigid model attached to a flexible pitch and plunge mount system. Unsteady pressure distributions and transonic flutter boundaries will be measured with and without active control system engaged.

Durham, Michael H.↗

Nanotechnology Infrared Optics for Astronomy Missions

The program "Nanotechnology Infrared Optics for Astronomy Missions" will design and develop new, nanotechnology techniques for infrared optical devices suitable for use in NASA space missions. The proposal combines expertise from the Smithsonian Astrophysical Observatory, the Naval Research Laboratory, the Goddard Space Flight Center, and the Physics Department at the Queen Mary and Westfield College in London, now relocated to the University of Cardiff, Cardiff, Wales. The method uses individually tailored metal grids, and layered stacks of metal mesh grids, both inductive (free-standing) and capacitive (substrate-mounted), to produce various kinds of filters. The program has the following goals: (1) Model FIR filter properties using electric-circuit analogs, and near-field, EM diffraction calculations; (2) Prototype fabrication of meshes on various substrates, with various materials, and of various dimensions; (3) Test of filter prototypes, and iterate with the modeling programs; (4) Travel to related sites, including trips to Washington, D.C. (location of NRL and GSFC), London (location of QMW), Cardiff, Wales, and Rome (location of ISO PMS project headquarters); (5) Produce ancillary science, including publication of both testing on mesh performance and infrared astronomical science.

Smith, Howard A.↗

Nanotechnology Infrared Optics for Astronomy Missions

The program "Nanotechnology Infrared Optics for Astronomy Missions" will design and develop new, nanotechnology techniques for infrared optical devices suitable for use in NASA space missions. The proposal combines expertise from the Smithsonian Astrophysical Observatory, the Naval Research Laboratory, the Goddard Space Flight Center, and the Physics Department at the Queen Mary and Westfield College in London, now relocated to the University of Cardiff, Cardiff, Wales. The method uses individually tailored metal grids and layered stacks of metal mesh grids, both inductive (freestanding) and capacitive (substrate-mounted), to produce various kinds of filters. The program has the following goals: 1) Model FIR filter properties using electric-circuit analogs and near-field, EM diffraction calculations. 2) Prototype fabrication of meshes on various substrates, with various materials, and of various dimensions. 3) Test filter prototypes and iterate with the modeling programs. 4) Travel to related sites, including trips to Washington, D.C. (location of NRL and GSFC), London (location of QMW), Cardiff, Wales, and Rome (location of ISO PMS project headquarters). 5) Produce ancillary science, including both publication of testing on mesh performance and infrared astronomical science.

Smith, Howard A.↗

The Benchmark Active Controls Technology Model Aerodynamic Data

The Benchmark Active Controls Technology (BACT) model is a part of the Benchmark Models Program (BMP). The BMP is a NASA Langley Research Center program that includes a series of models which were used to study different aeroelastic phenomena and to validate computational fluid dynamics codes. The primary objective of BACT testing was to obtain steady and unsteady loads, accelerations, and aerodynamic pressures due to control surface activity in order to calibrate unsteady CFD codes and active control design tools. Three wind-tunnel tests in the Transonic Dynamics Tunnel (TDT) have been completed. The first and parts of the second and third tests focused on collecting open-loop data to define the model's aeroservoelastic characteristics, including the flutter boundary across the Mach range. It is this data that is being presented in this paper. An extensive database of over 3000 data sets was obtained. This database includes steady and unsteady control surface effectiveness data, including pressure distributions, control surface hinge moments, and overall model loads due to deflections of a trailing edge control surface and upper and lower surface

Scott, Robert C.↗

A Perfect View of Vesta: Creating Pointing Observations for the Dawn Spacecraft on Asteroid 4 Vesta

The Dawn spacecraft has a timely and clever assignment in store. It will take a close look at two intact survivors from the dawn of the solar system (asteroids 4 Vesta and 1 Ceres) to understand more about solar system origin and evolution. To optimize science return, Dawn must make carefully designed observations on approach and in survey orbit, high altitude mapping orbit, and low altitude mapping orbit at each body. In this report, observations outlined in the science plan are modeled using the science opportunity analyzer program for the Vesta encounter. Specifically, I encoded Dawn's flight rules into the program, modeled pointing profiles of the optical instruments (framing camera, visible infrared spectrometer) and mapped their fields of view onto Vesta's surface. Visualization of coverage will provide the science team with information necessary to assess feasibility of alternative observation plans. Dawn launches in summer 2006 and ends its journey in 2016. Instrument observations on Vesta in 2011 will supply detailed information about Vesta's surface and internal structure. These data will be used to analyze the formation and history of the protoplanet and, therefore, complete an important step in understanding the development of our solar system.

Hay, Katrina M.↗

Asynchronous Runtimes in Action: An Introspective Framework for a Next Gen Runtime

One of the most critical challenges that new high performance systems face is the lack of system software support for these large scale systems. Investment on system stack components is essential in the development, debugging and optimization of the new emerging programming models. These emerging models have the promise to better utilize the vast hardware resources available in current and future systems. To aid in the development of applications and new system stacks, runtimes, as instances of their respective execution models, need to produce facilities to introspect their inner workings and allow an indepth attribution of performance bottlenecks and computational patterns. In other words, the runtime systems need to reduce their opacity to observers so that users of a novel program execution model can adapt their designs to fit the intended model usage, regardless of the layer that they are working on. This design/development loop (akin to co-design) enables synergistic opportunities across the entire computational stack. This paper presents the design and implementation of a simple “gray” box performance attribution harness running inside a fine grain runtime system: the Open Community Runtime (OCR). We showcase what such a framework can indicate regarding the runtime behavior while running at scale. To this end, we have designed a set of synthetic scenarios aimed to test the runtime at their best and worst cases. We present an analysis of the most important runtime features, properties and idiosyncrasies that will affect the development of new runtime features, algorithmic selection, and application development.

high performance distributed runtimes↗

Cost estimation model for advanced planetary programs, fourth edition

The development of the planetary program cost model is discussed. The Model was updated to incorporate cost data from the most recent US planetary flight projects and extensively revised to more accurately capture the information in the historical cost data base. This data base is comprised of the historical cost data for 13 unmanned lunar and planetary flight programs. The revision was made with a two fold objective: to increase the flexibility of the model in its ability to deal with the broad scope of scenarios under consideration for future missions, and to maintain and possibly improve upon the confidence in the model's capabilities with an expected accuracy of 20%. The Model development included a labor/cost proxy analysis, selection of the functional forms of the estimating relationships, and test statistics. An analysis of the Model is discussed and two sample applications of the cost model are presented.

Spadoni, D. J.↗

Model Checking JAVA Programs Using Java Pathfinder

This paper describes a translator called JAVA PATHFINDER from JAVA to PROMELA, the "programming language" of the SPIN model checker. The purpose is to establish a framework for verification and debugging of JAVA programs based on model checking. This work should be seen in a broader attempt to make formal methods applicable "in the loop" of programming within NASA's areas such as space, aviation, and robotics. Our main goal is to create automated formal methods such that programmers themselves can apply these in their daily work (in the loop) without the need for specialists to manually reformulate a program into a different notation in order to analyze the program. This work is a continuation of an effort to formally verify, using SPIN, a multi-threaded operating system programmed in Lisp for the Deep-Space 1 spacecraft, and of previous work in applying existing model checkers and theorem provers to real applications.

Havelund, Klaus↗

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗

Manual of phosphoric acid fuel cell stack three-dimensional model and computer program

A detailed distributed mathematical model of phosphoric acid fuel cell stack have been developed, with the FORTRAN computer program, for analyzing the temperature distribution in the stack and the associated current density distribution on the cell plates. Energy, mass, and electrochemical analyses in the stack were combined to develop the model. Several reasonable assumptions were made to solve this mathematical model by means of the finite differences numerical method.

Lu, C. Y.↗

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗