Search NASA⌕ Search

SEARCH · Search NASA

Results for “program ordering”

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 19 records

Implementation of a First-Order Quadratic Program Solver in C

This paper details a translation of a first order quadratic program (QP) solver from MATLAB to C. NASA could use this QP solver to generate online flight path trajectories for powered descent vehicles during landing. Over 12 weeks, the team designed, implemented, and tested two iterations of the QP solver for accuracy and runtime on 104 benchmark QP tests. The final iteration was 541.07% faster than the first, handling most tests in under one second. Additionally, it solved four more QP tests for N≥1383, and all outputs for cost and D_x matched the MATLAB reference values.

Optimization↗

A progress report on a NASA research program for embedded computer systems software

The paper presents the results of the second stage of the Multipurpose User-oriented Software Technology (MUST) program. Four primary areas of activities are discussed: programming environment, HAL/S higher-order programming language support, the Integrated Verification and Testing System (IVTS), and distributed system language research. The software development environment is provided by the interactive software invocation system. The higher-order programming language (HOL) support chosen for consideration is HAL/S mainly because at the time it was one of the few HOLs with flight computer experience and it is the language used on the Shuttle program. The overall purpose of IVTS is to provide a 'user-friendly' software testing system which is highly modular, user controlled, and cooperative in nature.

Foudriat, E. C.↗

Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems

Simulating the time evolution of a physical system at quantum mechanical levels of detail - known as Hamiltonian Simulation (HS) - is an important and interesting problem across physics and chemistry. For this task, algorithms that run on quantum computers are known to be exponentially faster than classical algorithms; in fact, this application motivated Feynman to propose the construction of quantum computers. Nonetheless, there are challenges in reaching this performance potential. Prior work has focused on compiling circuits (quantum programs) for HS with the goal of maximizing either accuracy or gate cancellation. Our work proposes a compilation strategy that simultaneously advances both goals. At a high level, we use classical optimizations such as graph coloring and travelling salesperson to order the execution of quantum programs. Specifically, we group together mutually commuting terms in the Hamiltonian (a matrix characterizing the quantum mechanical system) to improve the accuracy of the simulation. We then rearrange the terms within each group to maximize gate cancellation in the final quantum circuit. Furthermore, these optimizations work together to improve HS performance and result in an average 40% reduction in circuit depth. This work advances the frontier of HS which in turn can advance physical and chemical modeling in both basic and applied sciences.

97 MATHEMATICS AND COMPUTING↗

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Oliker, Leonid↗

The role of order in distributed programs

The role of order in building distributed systems is discussed. It is the belief that a principle of event ordering underlies the wide range of operating systems mechanisms that were put forward for building robust distributed software. Stated concisely, this principle achieves correct distributed behavior by ordering classes of distributed events that conflict with one another. By focusing on order, simplified descriptions can be obtained and convincingly correct solutions to problems that might otherwise have looked extremely complex. Moreover, it is observed that there are a limited number of ways to obtain order, and that the choice made impacts greatly on performance.

Birman, Kenneth P.↗

Real-Time Multiprocessor Programming Language (RTMPL) user's manual

A real-time multiprocessor programming language (RTMPL) has been developed to provide for high-order programming of real-time simulations on systems of distributed computers. RTMPL is a structured, engineering-oriented language. The RTMPL utility supports a variety of multiprocessor configurations and types by generating assembly language programs according to user-specified targeting information. Many programming functions are assumed by the utility (e.g., data transfer and scaling) to reduce the programming chore. This manual describes RTMPL from a user's viewpoint. Source generation, applications, utility operation, and utility output are detailed. An example simulation is generated to illustrate many RTMPL features.

Arpasi, D. J.↗

Control system software, simulation, and robotic applications

All essential existing capabilities needed to create a man-machine interaction dynamics and performance (MMIDAP) capability are reviewed. The multibody system dynamics software program Order N DISCOS will be used for machine and musculo-skeletal dynamics modeling. The program JACK will be used for estimating and animating whole body human response to given loading situations and motion constraints. The basic elements of performance (BEP) task decomposition methodologies associated with the Human Performance Institute database will be used for performance assessment. Techniques for resolving the statically indeterminant muscular load sharing problem will be used for a detailed understanding of potential musculotendon or ligamentous fatigue, pain, discomfort, and trauma. The envisioned capacity is to be used for mechanical system design, human performance assessment, extrapolation of man/machine interaction test data, biomedical engineering, and soft prototyping within a concurrent engineering (CE) system.

Frisch, Harold P.↗

Measuring the capabilities of quantum computers

Quantum computers can now run interesting programs, but each processor’s capability—the set of programs that it can run successfully—is limited by hardware errors. These errors can be complicated, making it difficult to accurately predict a processor’s capability. Benchmarks can be used to measure capability directly, but current benchmarks have limited flexibility and scale poorly to many-qubit processors. We show how to construct scalable, efficiently verifiable benchmarks based on any program by using a technique that we call circuit mirroring. With it, we construct two flexible, scalable volumetric benchmarks based on randomized and periodically ordered programs. We use these benchmarks to map out the capabilities of twelve publicly available processors, and to measure the impact of program structure on each one. We find that standard error metrics are poor predictors of whether a program will run successfully on today’s hardware, and that current processors vary widely in their sensitivity to program structure.

97 MATHEMATICS AND COMPUTING↗

Vector boson pair production at the LHC

We present phenomenological results for vector boson pair production at the LHC, obtained using the parton-level next-to-leading order program MCFM. We include the implementation of a new process in the code, pp {yields} {gamma}{gamma}, and important updates to existing processes. We incorporate fragmentation contributions in order to allow for the experimental isolation of photons in {gamma}{gamma}, W{gamma}, and Z{gamma} production and also account for gluon-gluon initial state contributions for all relevant processes. We present results for a variety of phenomenological scenarios, at the current operating energy of {radical}s = 7 TeV and for the ultimate machine goal, {radical}s = 14 TeV. We investigate the impact of our predictions on several important distributions that enter into searches for new physics at the LHC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Rigid Biopolymer Nanocrystal Systems for Controlling Multicomponent Nanoparticle Assembly and Orientation in Thin Film Solar Cells. Final Report

The focus of the proposed research is to direct the assembly of single or binary nanoparticles into meso- or macroscale three-dimensional crystals of any desired configuration and crystallographic orientation without using prohibitively expensive lithographic processes. The epitaxial nucleation of defect-free, surface-bound bulk single crystals will revolutionize technologies for energy to generate new types of solar cells that yield maximum conversion efficiencies. It has been proposed that having a nanostructured bulk hetero-interface will enable efficient charge-carrier separations, similar to organic based heterojunction cells but with potential improvements, including thermal and long-term stability, tunability of energy levels, large adsorption coefficients and carrier multiplication. However, engineering such devices requires nanoscale control and ordering in both 2- and 3-dimensions over macroscopic areas and this has yet to be achieved. In Nature, bulk organic and inorganic materials are arranged into precise and ordered programmed assemblies through the sequestration of raw materials into confined spaces and association through highly specific non-covalent interactions between biomolecules. Using similar strategies, the proposed research will focus on confining metal and semiconductor nanocrystals to pre-determined surface patterns and controlling their arrangement through tunable, orthogonal biomolecular binding. Once a perfect two-dimensional seed layer has been constructed, successive layers of single nanocrystals will be nucleated epitaxially with long-range order and tunable crystallographic orientations. The proposed research exploits the ability of biomolecules to bind specific targets in a tunable, orthogonal, multivalent, and reversible manner to the arrangements of DNA-nanoparticle conjugates on chemically defined surfaces. Through careful balance of the attractive and repulsive forces between the particles, the array, and the outside surface, it is envisioned that single or mixed nanoparticles can be packed to adopt uniform crystal orientation in two and three dimensions from simple mixing and annealing of biomolecule-nanoparticle conjugates with biomolecule-stamped surfaces. To control the crystallographic alignment of each particle with its neighbors, the nanoparticles will be assembled using a mixture of non-covalent biomolecular interactions. To create solar cells in which layers of donor and acceptor nanocrystals that are not only oriented normal to the top and bottom electrodes but are also arranged in a checkerboard pattern, multicomponent nanocrystals (e.g. CdSe, CdTe) will be conjugated with biochemical linkers such that only interactions between the CdTe and CdSe promote particle packing within the array. The proposed research will: (1) elucidate the role of single and binary cooperative particle-DNA interactions in influencing nanoparticle crystallographic orientation in two and three dimensions; (2) understand how confinement of nanoparticles on patterned arrays of biomolecules and modification of the surrounding substrate can nucleate long-range order over macroscopic areas via predefined grain boundaries; and (3) synthesize and characterize DNA conjugated semiconductor nanocrystals and assemble them into 2- and 3-D binary superlattice arrays for photovoltaics.

14 SOLAR ENERGY↗

Application Crash Consistency and Performance with CCFS

Recent research has shown that applications often incorrectly implement crash consistency. In this paper, we present the Crash-Consistent File System (ccfs), a file system that improves the correctness of application-level crash consistency protocols while maintaining high performance. A key idea in ccfs is the abstraction of a stream. Within a stream, updates are committed in program order, improving correctness; across streams, there are no ordering restrictions, enabling scheduling flexibility and high performance. We empirically demonstrate that applications running atop ccfs achieve high levels of crash consistency. Further, we show that ccfs performance under standard file-system benchmarks is excellent, in the worst case on par with the highest performing modes of Linux ext4, and in some cases notably better. Finally, overall, we demonstrate that both application correctness and high performance can be realized in a modern file system.

97 MATHEMATICS AND COMPUTING↗

Preliminary assessment of systems for deriving liquid and gaseous fuels from waste or grown organics

The overall feasibility of the chemical conversion of waste or grown organic matter to fuel is examined from the technical, economic, and social viewpoints. The energy contribution from a system that uses waste and grown organic feedstocks is estimated as 4 to 12 percent of our current energy consumption. Estimates of today's market prices for these fuels are included. Economic and social issues are as important as technology in determining the feasibility of such a proposal. An orderly program of development and demonstration is recommended to provide reliable data for an assessment of the viability of the proposal.

Graham, R. W.↗

ADA and multi-microprocessor real-time simulation

The selection of a high-order programming language for a real-time distributed network simulation is described. The additional problem of implementing a language on a possibly changing network is addressed. The recently designed language ADA (trademarked by DoD) was chosen since it provides the best model of the underlying application to be simulated.

Feyock, S.↗

The application of a second generation low-order panel method - program 'Vsaero' - to powerplant installation studies

Results from the application of a second generation low-order panel method to a number of powerplant installations are presented. The method, which retains the advantages of ease of use and low operating cost of earlier panel methods while retaining the aerodynamic modelling rigor of higher-order methods was used to predict the flow in and around typical nacelles and aircraft for a wide range of conditions. The ability of the second generation low-order analysis to calculate internal flows without the leakage problems associated with earlier programs is demonstrated and correlation between calculated and measured surface pressures and flow behavior, including predicting streamlines and locating regions of separated flow, is presented.

Clark, D. R.↗

The application of a low-order panel method - program VSAERO to powerplant and airframe flow studies

Results from the application of VSAERO, a low-order panel method, to three practical aircraft configurations are presented. The Grumman 698-411 tilt-nacelle V/STOL model is analyzed with particular emphasis on the inlet pressures and the nacelle/fuselage interference effects. Excellent correlation with experiment is reported for the inlet pressure ratio and the inlet operational boundaries. Analysis of an inlet designed for a tilt-rotor/nacelle aircraft is presented. The code was used in a design environment for this configuration to determine an inlet geometry that maintained attached flow for three design flight conditions: hover, hover-transition and cruise. VSAERO is also used to examine the prop-slipstream induced loading for the Langley prop-fan configuration. The versatility and economy of the aerodynamic modeling program, VSAERO, is demonstrated.

Strash, D. J.↗

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.

Oliker, Leonid↗